Submission #3822571
Source Code Expand
#include <iostream> #include <string.h> #include <algorithm> #include <vector> #include <map> #include <queue> #include <stack> long long dp[51][51][2510]; using namespace std; int main(void){ int N,A; cin>>N>>A; int x[50]; for(int i=0;i<N;i++){ cin>>x[i]; } dp[0][0][0]=1; for(int i=0;i<N;i++){ for(int j=0;j<N;j++){ for(int k=0;k<2500;k++){ if(dp[i][j][k]){ dp[i+1][j][k]+=dp[i][j][k]; dp[i+1][j+1][k+x[i]]+=dp[i][j][k]; } } } } long long ans=0; for(int i=1;i<=N;i++){ ans+=dp[N][i][i*A]; } cout<<ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tak and Cards |
User | caffeine40mg |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 730 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 48256 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 | 2 ms | 2304 KB |
example_02.txt | AC | 2 ms | 2304 KB |
example_03.txt | AC | 3 ms | 6400 KB |
example_04.txt | AC | 11 ms | 33024 KB |
subtask1_01.txt | AC | 5 ms | 14592 KB |
subtask1_02.txt | AC | 5 ms | 14592 KB |
subtask1_03.txt | AC | 5 ms | 14592 KB |
subtask1_04.txt | AC | 5 ms | 14592 KB |
subtask1_05.txt | AC | 5 ms | 14592 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 5 ms | 14592 KB |
subtask1_09.txt | AC | 5 ms | 14592 KB |
subtask2_01.txt | AC | 18 ms | 48128 KB |
subtask2_02.txt | AC | 18 ms | 48128 KB |
subtask2_03.txt | AC | 18 ms | 47744 KB |
subtask2_04.txt | AC | 18 ms | 47744 KB |
subtask2_05.txt | AC | 17 ms | 47744 KB |
subtask2_06.txt | AC | 17 ms | 47744 KB |
subtask2_07.txt | AC | 18 ms | 48256 KB |
subtask2_08.txt | AC | 11 ms | 33024 KB |
subtask2_09.txt | AC | 11 ms | 33024 KB |
subtask2_10.txt | AC | 14 ms | 41216 KB |
subtask2_11.txt | AC | 15 ms | 43264 KB |