# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
317064 | daniel920712 | DEL13 (info1cup18_del13) | C++14 | 8 ms | 512 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 <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <queue>
#include <map>
#include <stack>
using namespace std;
int all[100005];
vector < int > tt;
int T,N,M;
stack < int > aaa;
int F(int l,int r)
{
int x,ok=1,i,y;
tt.clear();
while(!aaa.empty()) aaa.pop();
for(i=l;i<=r;i++)
{
if(i==0)
{
if(all[i]!=1) tt.push_back(all[i]-1);
}
else if(all[i]-all[i-1]-1) tt.push_back(all[i]-all[i-1]-1);
}
if(r==M-1)
{
if(all[r]!=N) tt.push_back(N-all[r]);
}
else if(all[r+1]-all[r]-1)
{
tt.push_back(all[r+1]-all[r]-1);
}
if(tt.empty()) return 1;
if(tt.size()==1) return 0;
x=0;
for(auto i:tt)
{
x+=i;
if(i%2==0)
{
if(!aaa.empty()&&aaa.top()==0) aaa.pop();
else aaa.push(0);
}
else aaa.push(1);
}
if(x%2==1) return 0;
if(aaa.empty()) return 1;
x=aaa.top();
while(!aaa.empty())
{
y=aaa.top();
aaa.pop();
}
if(x==0||y==0) return 0;
return 1;
}
int main()
{
int i,j,con,xx=0,ok=1,last;
scanf("%d",&T);
while(T--)
{
scanf("%d %d",&N,&M);
ok=1;
last=0;
for(i=0;i<M;i++) scanf("%d",&all[i]);
if((N-M)%2) printf("-1\n");
else
{
for(i=1;i<M;i++)
{
if(all[i]-all[i-1]==1)
{
ok=ok&F(last,i-1);
last=i;
}
}
ok=ok&&F(last,M-1);
printf("%d\n",ok-1);
}
}
return 0;
}
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... |