Contest Duration: - (local time) (100 minutes) Back to Home

Submission #855328

Source Code Expand

Copy
```import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class Main {
private static final int mod = (int)1e9+7;

final Random random = new Random(0);
final IOFast io = new IOFast();

/// MAIN CODE
public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
int TEST_CASE = 1;
while(TEST_CASE-- != 0) {
int n = io.nextInt();
int A = io.nextInt();
int[] x = io.nextIntArray(n);
int[][] dp = new int[n+1][n*A+1];
dp[0][0] = 1;
for(int i = 0; i < n; i++) {
for(int j = dp[0].length; j >= 0; j--) {
for(int k = i; k >= 0; k--) {
if(j + x[i] < dp[k].length) {
dp[k+1][j+x[i]] += dp[k][j];
}
}
}
}
long ans = 0;
for(int i = 1; i <= n; i++) {
ans += dp[i][i*A];
}
io.out.println(ans);
}
}

/// TEMPLATE
static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }

static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }

void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }

static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); }

void main() throws IOException {
//		IOFast.setFileIO("rle-size.in", "rle-size.out");
try { run(); }
catch (EndOfFileRuntimeException e) { }
io.out.flush();
}
public static void main(String[] args) throws IOException { new Main().main(); }

static class EndOfFileRuntimeException extends RuntimeException {
private static final long serialVersionUID = -8565341110209207657L; }

static
public class IOFast {
private PrintWriter out = new PrintWriter(System.out);

void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

private static final char[] buffer = new char[1024 * 8];
private static char[] str = new char[500*8*2];
private static boolean[] isDigit = new boolean[256];
private static boolean[] isSpace = new boolean[256];
private static boolean[] isLineSep = new boolean[256];

static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
public String nextString() throws IOException { return new String(next()); }
public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
}
}
```

#### Submission Info

Submission Time 2016-08-28 21:15:40+0900 C - Tak and Cards tanzaku Java8 (OpenJDK 1.8.0) 200 6005 Byte WA 215 ms 9556 KB

#### Judge Result

Score / Max Score 0 / 0 200 / 200 0 / 100
Status
 AC × 4
 AC × 12
 AC × 20 WA × 4
Set Name Test Cases
Sample example_01.txt, example_02.txt, example_03.txt, example_04.txt
Case Name Status Exec Time Memory
example_01.txt AC 152 ms 8276 KB
example_02.txt AC 164 ms 8276 KB
example_03.txt AC 147 ms 8276 KB
example_04.txt AC 157 ms 8148 KB
subtask1_01.txt AC 167 ms 8272 KB
subtask1_02.txt AC 161 ms 8404 KB
subtask1_03.txt AC 156 ms 8144 KB
subtask1_04.txt AC 161 ms 8404 KB
subtask1_05.txt AC 174 ms 8272 KB
subtask1_06.txt AC 156 ms 8148 KB
subtask1_07.txt AC 152 ms 8272 KB
subtask1_08.txt AC 155 ms 8276 KB
subtask1_09.txt AC 153 ms 8276 KB
subtask2_01.txt WA 196 ms 9300 KB
subtask2_02.txt AC 186 ms 9428 KB
subtask2_03.txt WA 197 ms 9300 KB
subtask2_04.txt WA 215 ms 9556 KB
subtask2_05.txt AC 173 ms 8208 KB
subtask2_06.txt AC 198 ms 9556 KB
subtask2_07.txt AC 187 ms 9172 KB
subtask2_08.txt AC 178 ms 8912 KB
subtask2_09.txt AC 175 ms 9044 KB
subtask2_10.txt AC 169 ms 8400 KB
subtask2_11.txt WA 177 ms 9168 KB