Submission #1833710
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 | A - 素数、コンテスト、素数 |
User | holeguma |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 4476 Byte |
Status | RE |
Exec Time | 74 ms |
Memory | 21460 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 0 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | RE | 74 ms | 20180 KB |
00_sample_02.txt | RE | 71 ms | 17876 KB |
00_sample_03.txt | RE | 72 ms | 20948 KB |
00_sample_04.txt | RE | 71 ms | 17364 KB |
01_test_01.txt | RE | 72 ms | 21076 KB |
01_test_02.txt | RE | 72 ms | 21460 KB |
01_test_03.txt | RE | 71 ms | 17748 KB |
01_test_04.txt | RE | 70 ms | 21204 KB |
01_test_05.txt | RE | 69 ms | 21204 KB |
01_test_06.txt | RE | 71 ms | 19156 KB |
01_test_07.txt | RE | 70 ms | 19284 KB |
01_test_08.txt | RE | 73 ms | 17364 KB |
01_test_09.txt | RE | 71 ms | 19156 KB |
01_test_10.txt | RE | 70 ms | 19796 KB |
01_test_11.txt | RE | 71 ms | 21204 KB |
01_test_12.txt | RE | 71 ms | 17748 KB |
01_test_13.txt | RE | 69 ms | 19284 KB |
01_test_14.txt | RE | 71 ms | 19028 KB |
01_test_15.txt | RE | 71 ms | 17748 KB |
01_test_16.txt | RE | 74 ms | 19028 KB |
01_test_17.txt | RE | 72 ms | 21076 KB |
01_test_18.txt | RE | 71 ms | 19156 KB |
01_test_19.txt | RE | 70 ms | 21332 KB |
01_test_20.txt | RE | 71 ms | 18900 KB |
01_test_21.txt | RE | 71 ms | 19156 KB |
01_test_22.txt | RE | 73 ms | 20948 KB |
01_test_23.txt | RE | 70 ms | 20308 KB |
01_test_24.txt | RE | 70 ms | 21204 KB |
01_test_25.txt | RE | 70 ms | 19156 KB |