Submission #2742046
Source Code Expand
#include <iostream> #include <algorithm> #include <string> #include <vector> using namespace std; #define REP(i,n) for(int i = 0; i <(int)(n); i++) typedef long long ll; const int NMAX = 51; const int VMAX = 51*51+1; //const int VMAX = 100; ll dp[NMAX][NMAX][VMAX]; int main() { dp[0][0][0] = 1; int N, A; cin>>N>>A; vector<int> data(N); REP(i,N) cin>>data[i]; REP(i,N) { int x = data[i]; int from = i, to = i+1; for(int a = 0; a < NMAX; a++) for(int b = 0; b < VMAX; b++) dp[to][a][b] = 0LL; for(int m = 0; m < N; m++) { for(int v = 0; v < VMAX; v++) { dp[to][m][v] += dp[from][m][v]; if(m+1 < NMAX && v+x < VMAX) { dp[to][m+1][v+x] += dp[from][m][v]; #ifdef DEBUG cout << i<<to<<","<<m+1 << "," << v+x << "," << dp[to][m+1][v+x] << endl; #endif } } } } ll ans = 0; for(int i = 1; i <= N; i++) { #ifdef DEBUG cout << i << " " << dp[N][i][A*i] << endl; #endif ans += dp[N][i][A*i]; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tak and Cards |
User | kmatsunaga |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1053 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 52096 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 100 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | example_01.txt, example_02.txt, example_03.txt, example_04.txt |
Subtask1 | example_01.txt, example_02.txt, example_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt |
All | example_01.txt, example_02.txt, example_03.txt, example_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_01.txt | AC | 3 ms | 5376 KB |
example_02.txt | AC | 3 ms | 5376 KB |
example_03.txt | AC | 4 ms | 9472 KB |
example_04.txt | AC | 15 ms | 36096 KB |
subtask1_01.txt | AC | 7 ms | 17664 KB |
subtask1_02.txt | AC | 7 ms | 17664 KB |
subtask1_03.txt | AC | 7 ms | 17664 KB |
subtask1_04.txt | AC | 7 ms | 17664 KB |
subtask1_05.txt | AC | 7 ms | 17664 KB |
subtask1_06.txt | AC | 2 ms | 3328 KB |
subtask1_07.txt | AC | 2 ms | 3328 KB |
subtask1_08.txt | AC | 7 ms | 17664 KB |
subtask1_09.txt | AC | 7 ms | 17664 KB |
subtask2_01.txt | AC | 26 ms | 52096 KB |
subtask2_02.txt | AC | 25 ms | 52096 KB |
subtask2_03.txt | AC | 24 ms | 51072 KB |
subtask2_04.txt | AC | 25 ms | 52096 KB |
subtask2_05.txt | AC | 26 ms | 52096 KB |
subtask2_06.txt | AC | 25 ms | 52096 KB |
subtask2_07.txt | AC | 25 ms | 52096 KB |
subtask2_08.txt | AC | 15 ms | 36096 KB |
subtask2_09.txt | AC | 15 ms | 36096 KB |
subtask2_10.txt | AC | 20 ms | 44288 KB |
subtask2_11.txt | AC | 21 ms | 46336 KB |