# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68797 | 2018-08-18T13:44:31 Z | Vahan | Gondola (IOI14_gondola) | C++17 | 19 ms | 5600 KB |
#include "gondola.h" #include<vector> using namespace std; int valid(int n, int inputSeq[]) { int x[200000]; vector<int> v; for(int i=0;i<n;i++) { if(inputSeq[i]<=n) { v.push_back(inputSeq[i]); x[inputSeq[i]]=i; } } int t=0; for(int i=1;i<v.size();i++) { if(v[i-1]>v[i]) t++; } if(t>=2) return 0; if(t==1 && v.back()>v[0]) return 0; t=0; for(int i=1;i<v.size();i++) { if(v[i-1]<v[i]) { if(v[i]-v[i-1]!=x[v[i]]-x[v[i-1]]) { t=1; break; } } if(v[i-1]>v[i]) { if(n-(v[i-1]-v[i])!=x[v[i]]-x[v[i-1]]) { t=1; break; } } } if(t==1) return 0; return 1; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 420 KB | Output is correct |
4 | Correct | 2 ms | 424 KB | Output is correct |
5 | Correct | 2 ms | 428 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 548 KB | Output is correct |
2 | Correct | 2 ms | 780 KB | Output is correct |
3 | Correct | 2 ms | 780 KB | Output is correct |
4 | Correct | 3 ms | 780 KB | Output is correct |
5 | Correct | 2 ms | 828 KB | Output is correct |
6 | Correct | 9 ms | 1860 KB | Output is correct |
7 | Correct | 19 ms | 2956 KB | Output is correct |
8 | Correct | 13 ms | 3212 KB | Output is correct |
9 | Correct | 6 ms | 3212 KB | Output is correct |
10 | Correct | 15 ms | 3880 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 3880 KB | Output is correct |
2 | Correct | 2 ms | 3880 KB | Output is correct |
3 | Correct | 3 ms | 3880 KB | Output is correct |
4 | Correct | 3 ms | 3880 KB | Output is correct |
5 | Correct | 2 ms | 3880 KB | Output is correct |
6 | Correct | 8 ms | 3880 KB | Output is correct |
7 | Correct | 17 ms | 4684 KB | Output is correct |
8 | Correct | 16 ms | 4940 KB | Output is correct |
9 | Correct | 5 ms | 4940 KB | Output is correct |
10 | Correct | 14 ms | 5600 KB | Output is correct |
11 | Incorrect | 5 ms | 5600 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 5600 KB | Integer -2 violates the range [0, 350000] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 5600 KB | Integer -2 violates the range [0, 350000] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 5600 KB | Integer -2 violates the range [0, 350000] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 5600 KB | Integer -3 violates the range [0, 1000000008] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 5600 KB | Integer -3 violates the range [0, 1000000008] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 5600 KB | Integer -3 violates the range [0, 1000000008] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 5600 KB | Integer -3 violates the range [0, 1000000008] |
2 | Halted | 0 ms | 0 KB | - |