Submission #3246145
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REP(i, n) for(int i = 0; i < n; i++) #define REPR(i, n) for(int i = n; i >= 0; i--) #define FOR(i, m, n) for(int i = m; i < n; i++) #define FORR(i, m, n) for(int i = m; i >= n; i--) #define SORT(v, n) sort(v, v+n); #define VSORT(v) sort(v.begin(), v.end()); #define ll long long #define pb(a) push_back(a) ll dp[51][51][2501]; int main(){ int n, a; cin >> n >> a; vector<int> x(n); REP(i, n) cin >> x[i]; dp[0][0][0] = 1; REP(j, 50){ REP(k, 50){ REP(s, 2501 - x[j]){ if(j >= 1 && s < x[j]) dp[j][k][s] = dp[j - 1][k][s]; else if(j >= 1 && k >= 1 && s >= x[j]) dp[j][k][s] = dp[j - 1][k][s] + dp[j][k - 1][s - x[j]]; } } } ll ans = 0; REP(i, n) ans += dp[n][i + 1][(i + 1) * a]; cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Tak and Cards |
User | harsaka |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 852 Byte |
Status | WA |
Exec Time | 23 ms |
Memory | 49024 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | 0 / 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 | WA | 23 ms | 49024 KB |
example_02.txt | WA | 23 ms | 49024 KB |
example_03.txt | WA | 22 ms | 49024 KB |
example_04.txt | WA | 22 ms | 49024 KB |
subtask1_01.txt | WA | 23 ms | 49024 KB |
subtask1_02.txt | WA | 22 ms | 49024 KB |
subtask1_03.txt | AC | 22 ms | 49024 KB |
subtask1_04.txt | AC | 22 ms | 49024 KB |
subtask1_05.txt | WA | 22 ms | 49024 KB |
subtask1_06.txt | WA | 23 ms | 49024 KB |
subtask1_07.txt | AC | 23 ms | 49024 KB |
subtask1_08.txt | WA | 22 ms | 49024 KB |
subtask1_09.txt | WA | 22 ms | 49024 KB |
subtask2_01.txt | WA | 22 ms | 49024 KB |
subtask2_02.txt | WA | 22 ms | 49024 KB |
subtask2_03.txt | WA | 23 ms | 49024 KB |
subtask2_04.txt | WA | 22 ms | 49024 KB |
subtask2_05.txt | AC | 22 ms | 49024 KB |
subtask2_06.txt | AC | 23 ms | 49024 KB |
subtask2_07.txt | AC | 23 ms | 49024 KB |
subtask2_08.txt | WA | 22 ms | 49024 KB |
subtask2_09.txt | WA | 23 ms | 49024 KB |
subtask2_10.txt | WA | 23 ms | 49024 KB |
subtask2_11.txt | WA | 23 ms | 49024 KB |