# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48824 | leehosu01 | 동전 게임 (KOI15_coin) | C++17 | 1091 ms | 25024 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |