Submission #1833692
Source Code Expand
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; 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[x+1]; int[] l=new int[x+1]; 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]; } } if(tot<=x) f[tot]++; } 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) l[tot]++; } long ret=0; for(int i=0;i<=x;i++){ ret+=(long)f[i]*(long)l[x-i]; } out.println(ret); } 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 | 3669 Byte |
Status | RE |
Exec Time | 292 ms |
Memory | 679508 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 | RE | 88 ms | 34924 KB |
max_2.txt | RE | 89 ms | 37100 KB |
max_3.txt | RE | 90 ms | 37996 KB |
max_4.txt | AC | 100 ms | 21844 KB |
pair_1.txt | RE | 86 ms | 36076 KB |
pair_2.txt | RE | 88 ms | 36076 KB |
power2_1.txt | MLE | 230 ms | 283348 KB |
power2_2.txt | AC | 101 ms | 21460 KB |
power2_3.txt | MLE | 270 ms | 575948 KB |
power2_4.txt | AC | 104 ms | 21460 KB |
power2_5.txt | AC | 184 ms | 243156 KB |
random_1.txt | MLE | 277 ms | 617428 KB |
random_2.txt | RE | 86 ms | 38228 KB |
random_3.txt | MLE | 249 ms | 532720 KB |
random_4.txt | RE | 90 ms | 33644 KB |
random_5.txt | AC | 100 ms | 23636 KB |
random_6.txt | AC | 103 ms | 19412 KB |
random_7.txt | RE | 89 ms | 36204 KB |
random_8.txt | MLE | 292 ms | 679508 KB |
random_9.txt | RE | 90 ms | 37996 KB |
sample_1.txt | AC | 71 ms | 19924 KB |
sample_2.txt | AC | 73 ms | 19028 KB |
sample_3.txt | MLE | 218 ms | 439420 KB |
sample_4.txt | AC | 73 ms | 18260 KB |
small_1.txt | MLE | 254 ms | 403924 KB |
small_2.txt | AC | 83 ms | 29908 KB |
small_3.txt | AC | 73 ms | 19156 KB |
small_4.txt | AC | 73 ms | 21076 KB |