#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+1;
int d[N], rm[N];
void solve() {
int n, q; cin>>n>>q;
for (int i=0; i<=n; ++i) d[i]=rm[i]=0;
vector<int> v;
for (int i=0; i<q; ++i) {
int p; cin>>p;
v.push_back(p);
}
for (int i=1; i<q; ++i) d[i]=v[i]-v[i-1]-1;
for (int i=1; i<q-1; ++i) {
if (d[i] <= 0) continue;
if (d[i]%2) --d[i], --d[i+1], ++rm[i], ++rm[i+1];
else if (rm[i] == 0) d[i]-=2, d[i+1]-=2, rm[i]+=2, rm[i+1]+=2;
}
bool ok=true;
for (int i=1; i<q; ++i) {
if ((d[i]&1) || d[i] < 0) ok=false;
if (d[i]%2 == 0 && d[i] > 0 && rm[i] == 0) ok=false;
}
if (!ok) {
cout<<-1<<"\n";
return;
} else {
cout<<0<<"\n\n";
}
}
int main() {
int t; cin>>t;
while (t--) solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
212 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
212 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Incorrect |
8 ms |
340 KB |
Output isn't correct |
4 |
Incorrect |
8 ms |
340 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
324 KB |
Output isn't correct |
2 |
Incorrect |
3 ms |
980 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
212 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Incorrect |
8 ms |
340 KB |
Output isn't correct |
4 |
Incorrect |
8 ms |
340 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
212 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
3 |
Incorrect |
8 ms |
340 KB |
Output isn't correct |
4 |
Incorrect |
8 ms |
340 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
8 |
Incorrect |
12 ms |
1236 KB |
Output isn't correct |
9 |
Incorrect |
15 ms |
1576 KB |
Output isn't correct |
10 |
Incorrect |
13 ms |
1480 KB |
Output isn't correct |
11 |
Incorrect |
16 ms |
1620 KB |
Output isn't correct |