oj.uz

Submission #637056

# Submission time Handle Problem Language Result Execution time Memory
637056 2022-08-31T11:21:12 Z Dec0Dedd DEL13 (info1cup18_del13) C++14
6 / 100
 16 ms 1416 KB 
#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;

   if (q == 0) {
      cout<<0<<"\n";
      return;
   }

   for (int i=0; i<=n; ++i) d[i]=rm[i]=0;
   vector<int> v;
   v.push_back(0);
   for (int i=0; i<q; ++i) {
      int p; cin>>p;
      v.push_back(p);
   }
   q+=2, v.push_back(n+1);

   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";
   } else {
      cout<<0<<"\n";
      cout<<"\n";
   }
}

int main() {
   int t; cin>>t;
   while (t--) solve();
}

Subtask #1
0.0 / 15.0

# 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

Subtask #2
0.0 / 15.0

# 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 320 KB Output isn't correct
4 Incorrect 8 ms 212 KB Output isn't correct

Subtask #3
6.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is partially correct
2 Correct 3 ms 980 KB Output is partially correct

Subtask #4
0.0 / 25.0

# 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 320 KB Output isn't correct
4 Incorrect 8 ms 212 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

Subtask #5
0.0 / 30.0

# 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 320 KB Output isn't correct
4 Incorrect 8 ms 212 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 11 ms 1108 KB Output isn't correct
9 Incorrect 15 ms 1188 KB Output isn't correct
10 Incorrect 13 ms 1236 KB Output isn't correct
11 Incorrect 16 ms 1416 KB Output isn't correct