# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96457 | KLPP | DEL13 (info1cup18_del13) | C++14 | 29 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 possible(int n,vector<int> v){
vector<int> diff;
for(int i=0;i<v.size()-1;i++){
diff.push_back(v[i+1]-v[i]-1);
}
/*for(int i=0;i<diff.size();i++){
cout<<diff[i]<<" ";
}cout<<endl;*/
int res=0;
int sz=0;
for(int i=0;i<diff.size();i++){
if(diff[i]!=0){
sz++;
res+=diff[i];
res%=2;
}else{
if(sz==1 || res!=0)return -1;
sz=0;
res=0;
}
}
if(sz==1 || res!=0)return -1;
return 0;
}
int main(){
int T;
cin>>T;
while(T--){
int n;
cin>>n;
int l;
cin>>l;
vector<int> seq(l+2);
seq[0]=0;
for(int i=1;i<=l;i++){
cin>>seq[i];
}seq[l+1]=n+1;
int sol=possible(n,seq);
cout<<sol<<endl;
if(sol)cout<<endl;
}
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... |