# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96658 | KLPP | DEL13 (info1cup18_del13) | C++14 | 19 ms | 1272 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;
typedef long long int lld;
int mod(int x){
if(x==0)return 0;
if(x%2==1)return 1;
return 2;
}
bool test(vector<int> v){
/*for(int i=0;i<=v.size();i++){
for(int j=0;j<3;j++)DP[i][j]=-1;
}DP[0][0]=1;
DP[0][1]=0;
DP[0][2]=0;*/
bool DP[v.size()+1];
DP[0]=true;
for(int i=1;i<=v.size();i++){
DP[i]=false;
int res=v[i-1];
res=mod(res);
//cout<<res<<"Y"<<endl;
for(int j=i-2;j>-1;j--){
res=v[j]-res;
if(res>=0){
res=mod(res);
//cout<<res<<endl;
if(res%2==0){
DP[i]=DP[i]|DP[j];
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |