# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47143 | 2018-04-28T05:21:58 Z | Kmcode | DEL13 (info1cup18_del13) | C++14 | 44 ms | 2920 KB |
#include "bits/stdc++.h" using namespace std; #define MAX 100002 int n; vector<int> v; int q; vector<pair<int, int> > vv; bool ng; vector<int> ope; vector<int> v2; void er() { v2.clear(); for (int i = 0; i < vv.size(); i++) { int L = vv[i].first; int R = vv[i].second; if (R - L +1 > 2) { if ((R - L + 1) % 2) { } else { R--; } } int mid = (R + L) / 2; int z = 0; while (R - L + 1 > 2) { ope.push_back(mid); R--; L++; z += 2; } int rng = vv[i].second - vv[i].first; rng++; rng -= z; v2.push_back(rng); } for (int i = 1; i < vv.size(); i++) { int mint = min(v2[i - 1], v2[i]); while (mint--) { v2[i - 1]--; v2[i]--; ope.push_back(vv[i].first-1); } } for (int i = 0; i < v2.size(); i++) { if (v2[i]) { ng = true; break; } } vv.clear(); } int main() { int t; cin >> t; while (t--) { ope.clear(); ng = false; scanf("%d%d", &n,&q); v.clear(); v.push_back(0); for (int i = 0; i < q; i++) { int a; scanf("%d", &a); v.push_back(a); } v.push_back(n+1); v.push_back(n + 2); for (int i = 1; i < v.size(); i++) { if (v[i] - v[i - 1] - 1 == 0) { er(); continue; } vv.push_back(make_pair(v[i - 1] + 1, v[i] - 1)); } if (ng) { puts("-1"); } else { cout << ope.size() << endl; bool out = false; for (int el : ope) { if (out) { printf(" "); } out = true; printf("%d", el); } puts(""); } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 248 KB | Output isn't correct |
2 | Incorrect | 3 ms | 364 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 248 KB | Output isn't correct |
2 | Incorrect | 3 ms | 364 KB | Output isn't correct |
3 | Incorrect | 10 ms | 552 KB | Output isn't correct |
4 | Incorrect | 12 ms | 612 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 1024 KB | Output is correct |
2 | Correct | 4 ms | 1304 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 248 KB | Output isn't correct |
2 | Incorrect | 3 ms | 364 KB | Output isn't correct |
3 | Incorrect | 10 ms | 552 KB | Output isn't correct |
4 | Incorrect | 12 ms | 612 KB | Output isn't correct |
5 | Incorrect | 3 ms | 1304 KB | Output isn't correct |
6 | Incorrect | 2 ms | 1304 KB | Output isn't correct |
7 | Incorrect | 3 ms | 1304 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 248 KB | Output isn't correct |
2 | Incorrect | 3 ms | 364 KB | Output isn't correct |
3 | Incorrect | 10 ms | 552 KB | Output isn't correct |
4 | Incorrect | 12 ms | 612 KB | Output isn't correct |
5 | Incorrect | 3 ms | 1304 KB | Output isn't correct |
6 | Incorrect | 2 ms | 1304 KB | Output isn't correct |
7 | Incorrect | 3 ms | 1304 KB | Output isn't correct |
8 | Incorrect | 9 ms | 1632 KB | Output isn't correct |
9 | Incorrect | 11 ms | 1984 KB | Output isn't correct |
10 | Incorrect | 12 ms | 2276 KB | Output isn't correct |
11 | Incorrect | 44 ms | 2920 KB | Output isn't correct |