# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48824 | 2018-05-19T08:00:40 Z | leehosu01 | 동전 게임 (KOI15_coin) | C++17 | 1000 ms | 25024 KB |
#include<bits/stdc++.h> using namespace std; int K,T; bool AB[1001][1001]; bitset<1001>ch[1001][1001]; void ABK(int A,int B,int K) { if(ch[A][B][K])return;ch[A][B][K]=1; if(A+K<B||B+K<A||K==0){if(!(A+K+1<B||B+K+2<A))AB[A][B]=1;return;} ABK(A+1,B,K-1); ABK(A+1,B+1,K-1); ABK(A,B+1,K-1); ABK(A,B,K-1); } int main() { ios::sync_with_stdio(0); cin.tie(0); cin>>K>>T; ABK(0,0,K); for(;T--;) { int A,B; cin>>A>>B; printf("%d\n",AB[A][B]); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 432 KB | Output is correct |
3 | Correct | 3 ms | 564 KB | Output is correct |
4 | Correct | 2 ms | 564 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 564 KB | Output is correct |
2 | Correct | 2 ms | 564 KB | Output is correct |
3 | Correct | 2 ms | 592 KB | Output is correct |
4 | Correct | 2 ms | 612 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 612 KB | Output is correct |
2 | Correct | 3 ms | 612 KB | Output is correct |
3 | Correct | 6 ms | 740 KB | Output is correct |
4 | Correct | 28 ms | 872 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 1272 KB | Output is correct |
2 | Correct | 6 ms | 1552 KB | Output is correct |
3 | Correct | 663 ms | 20164 KB | Output is correct |
4 | Execution timed out | 1091 ms | 25024 KB | Time limit exceeded |
5 | Halted | 0 ms | 0 KB | - |