Submission #1833712
Source Code Expand
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; import java.util.NoSuchElementException; public class Main { static PrintWriter out; static InputReader ir; static void solve() { int n=ir.nextInt(); int m=n/2; int x=ir.nextInt(); int[] w=ir.nextIntArray(n); int[] f=new int[1<<m]; long ret=0; for(int i=0;i<1<<m;i++){ int tot=0; for(int j=0;j<m;j++){ if((i&(1<<j))!=0){ tot+=w[j]; } } f[i]=tot; } Arrays.sort(f); for(int i=0;i<1<<(n-m);i++){ int tot=0; for(int j=0;j<n-m;j++){ if((i&(1<<j))!=0){ tot+=w[m+j]; } } if(tot<=x) ret+=(long)(upper_bound(f,0,f.length-1,x-tot)-lower_bound(f,0,f.length-1,x-tot)); out.println(upper_bound(f,0,f.length-1,2)); } out.println(ret); } public static int lower_bound(int[] a, int fromIndex, int toIndex, int val) { if (val > a[toIndex]) return toIndex + 1; if (val <= a[fromIndex]) return fromIndex; int lb = fromIndex - 1, ub = toIndex; while (ub - lb > 1) { int mid = (ub - lb)/2+lb; if (a[mid] >= val) { ub = mid; } else { lb = mid; } } return ub; } public static int upper_bound(int[] a, int fromIndex, int toIndex, int val) { if (val >= a[toIndex]) return toIndex + 1; if (val < a[fromIndex]) return fromIndex; int lb = fromIndex - 1, ub = toIndex; while (ub - lb > 1) { int mid = (ub - lb)/2+lb; if (a[mid] > val) { ub = mid; } else { lb = mid; } } return ub; } public static void main(String[] args) throws Exception { ir = new InputReader(System.in); out = new PrintWriter(System.out); solve(); out.flush(); } static class InputReader { private InputStream in; private byte[] buffer = new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) { this.in = in; this.curbuf = this.lenbuf = 0; } public boolean hasNextByte() { if (curbuf >= lenbuf) { curbuf = 0; try { lenbuf = in.read(buffer); } catch (IOException e) { throw new InputMismatchException(); } if (lenbuf <= 0) return false; } return true; } private int readByte() { if (hasNextByte()) return buffer[curbuf++]; else return -1; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private void skip() { while (hasNextByte() && isSpaceChar(buffer[curbuf])) curbuf++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (!isSpaceChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } int res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } long res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public double nextDouble() { return Double.parseDouble(next()); } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } public char[][] nextCharMap(int n, int m) { char[][] map = new char[n][m]; for (int i = 0; i < n; i++) map[i] = next().toCharArray(); return map; } } }
Submission Info
Submission Time | |
---|---|
Task | C - 無駄なものが嫌いな人 |
User | holeguma |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 4476 Byte |
Status | WA |
Exec Time | 271 ms |
Memory | 29452 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 0 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | max_1.txt, max_2.txt, max_3.txt, max_4.txt, pair_1.txt, pair_2.txt, power2_1.txt, power2_2.txt, power2_3.txt, power2_4.txt, power2_5.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, small_1.txt, small_2.txt, small_3.txt, small_4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
max_1.txt | WA | 174 ms | 25592 KB |
max_2.txt | WA | 203 ms | 29452 KB |
max_3.txt | WA | 172 ms | 26996 KB |
max_4.txt | WA | 193 ms | 27528 KB |
pair_1.txt | WA | 210 ms | 27028 KB |
pair_2.txt | WA | 167 ms | 26136 KB |
power2_1.txt | WA | 191 ms | 26864 KB |
power2_2.txt | WA | 194 ms | 28644 KB |
power2_3.txt | WA | 178 ms | 27588 KB |
power2_4.txt | WA | 173 ms | 27504 KB |
power2_5.txt | WA | 96 ms | 18772 KB |
random_1.txt | WA | 271 ms | 25684 KB |
random_2.txt | WA | 212 ms | 23536 KB |
random_3.txt | WA | 178 ms | 27432 KB |
random_4.txt | WA | 199 ms | 25396 KB |
random_5.txt | WA | 185 ms | 27920 KB |
random_6.txt | WA | 255 ms | 28156 KB |
random_7.txt | WA | 190 ms | 29404 KB |
random_8.txt | WA | 236 ms | 29220 KB |
random_9.txt | WA | 220 ms | 22548 KB |
sample_1.txt | WA | 69 ms | 22996 KB |
sample_2.txt | WA | 70 ms | 21204 KB |
sample_3.txt | WA | 86 ms | 21204 KB |
sample_4.txt | WA | 74 ms | 20692 KB |
small_1.txt | WA | 70 ms | 21332 KB |
small_2.txt | WA | 70 ms | 20564 KB |
small_3.txt | WA | 69 ms | 21844 KB |
small_4.txt | WA | 68 ms | 21204 KB |