# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165012 | 2019-11-24T16:28:32 Z | kostia244 | Gondola (IOI14_gondola) | C++17 | 48 ms | 4728 KB |
#include "gondola.h" #include<bits/stdc++.h> #define pb push_back #define all(x) x.begin(), x.end() using namespace std; using ll = long long; using vi = vector<int>; int valid(int n, int a[]) { set<int> x; for (int i = 0; i < n; i++) x.insert(a[i]); if (x.size() != n) return 0; for (int i = 1; i < n; i++) { if (a[i] > n) { a[i] = a[i - 1] + 1; } } for (int i = n; i-- > 1;) { if (a[i] > n) { a[i] = a[i - 1] == n ? 1 : a[i - 1] + 1; } } int i = 0; while (a[i] != 1) i++; int p = 1; for (int j = (i + 1) % n; j != i; j = (j + 1) % n) { if (p+1 != a[j]) return 0; p = a[j]; } return 1; } //---------------------- int pos[250250]; int replacement(int n, int a[], int b[]) { int mx = 0, p = 0; bitset<250250> have; for(int i = 0; i < n; i++) { if(a[i]>n) { have.set(a[i]); pos[a[i]] = i; } if(a[i]>mx) mx = a[i], p = i; } for (int i = 1; i < n; i++) { if (a[i] > n&&a[i-1]<=n) { a[i] = (a[i - 1]%n) + 1; } } for (int i = n; i--;) { if (a[i] > n&&a[i+1]<=n) { a[i] = a[i + 1] == 1 ? n : a[i + 1] - 1; } } for(int i = 0; i < n; i++) if(a[i]>n) exit(-1); int j = 0; for(int i = n+1; i <= mx; i++) { if(have.test(i)) { b[j++] = a[pos[i]]; a[pos[i]] = i; } else { b[j++] = a[p]; a[p] = i; } } return max(0, mx-n); } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 252 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 380 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 16 ms | 2300 KB | Output is correct |
7 | Correct | 38 ms | 3704 KB | Output is correct |
8 | Correct | 29 ms | 3960 KB | Output is correct |
9 | Correct | 10 ms | 1528 KB | Output is correct |
10 | Correct | 40 ms | 4472 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 296 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 16 ms | 2168 KB | Output is correct |
7 | Correct | 39 ms | 3704 KB | Output is correct |
8 | Correct | 29 ms | 3960 KB | Output is correct |
9 | Correct | 10 ms | 1528 KB | Output is correct |
10 | Correct | 36 ms | 4472 KB | Output is correct |
11 | Correct | 2 ms | 376 KB | Output is correct |
12 | Correct | 2 ms | 376 KB | Output is correct |
13 | Correct | 22 ms | 2168 KB | Output is correct |
14 | Correct | 2 ms | 256 KB | Output is correct |
15 | Correct | 48 ms | 4728 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 380 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 380 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 380 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Incorrect | 3 ms | 380 KB | Integer -47 violates the range [1, 72] |
9 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 376 KB | Output is correct |
5 | Correct | 2 ms | 376 KB | Output is correct |
6 | Correct | 2 ms | 424 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Incorrect | 2 ms | 380 KB | Integer -47 violates the range [1, 72] |
9 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Integer -3 violates the range [0, 1000000008] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Integer -3 violates the range [0, 1000000008] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Integer -3 violates the range [0, 1000000008] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Integer -3 violates the range [0, 1000000008] |
2 | Halted | 0 ms | 0 KB | - |