# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
254517 | 2020-07-30T07:30:50 Z | b00n0rp | Gondola (IOI14_gondola) | C++17 | 41 ms | 4736 KB |
#include "gondola.h" #include<bits/stdc++.h> using namespace std; #define ll long long int valid(int n, int inputSeq[]){ int mx = inputSeq[0],mn = inputSeq[0]; for(int i = 1; i < n; i ++){ mx = max(mx,inputSeq[i]); mn = min(mn,inputSeq[i]); } set<int> s; for(int i = 0; i < n; i ++){ s.insert(inputSeq[i]); } if(s.size() != n) return 0; if(mn > n) return 1; for(int i = 0; i < n; i ++){ if(inputSeq[i] <= n){ for(int j = i+1; j != i; j = (j+1)%n){ if(inputSeq[j] > n) continue; if(inputSeq[j] != ((inputSeq[i]+(j-i)+n-1)%n)+1) return 0; } return 1; } } } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- const ll MOD = 1000000009; int countReplacement(int n, int inputSeq[]){ int mx = inputSeq[0],mn = inputSeq[0]; for(int i = 1; i < n; i ++){ mx = max(mx,inputSeq[i]); mn = min(mn,inputSeq[i]); } if(mn > n){ ll ans = 1; for(int i = 1; i <= n; i ++){ ans = (ans*i)%MOD; } return ans; } else assert(0 == 1); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 256 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 0 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 0 ms | 384 KB | Output is correct |
6 | Correct | 12 ms | 2176 KB | Output is correct |
7 | Correct | 36 ms | 3704 KB | Output is correct |
8 | Correct | 24 ms | 3960 KB | Output is correct |
9 | Correct | 8 ms | 1536 KB | Output is correct |
10 | Correct | 28 ms | 4600 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 1 ms | 256 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 0 ms | 384 KB | Output is correct |
6 | Correct | 13 ms | 2176 KB | Output is correct |
7 | Correct | 31 ms | 3712 KB | Output is correct |
8 | Correct | 24 ms | 3968 KB | Output is correct |
9 | Correct | 7 ms | 1536 KB | Output is correct |
10 | Correct | 28 ms | 4600 KB | Output is correct |
11 | Correct | 0 ms | 256 KB | Output is correct |
12 | Correct | 0 ms | 384 KB | Output is correct |
13 | Correct | 17 ms | 2048 KB | Output is correct |
14 | Correct | 1 ms | 256 KB | Output is correct |
15 | Correct | 41 ms | 4736 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | Integer -2 violates the range [0, 350000] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | Integer -2 violates the range [0, 350000] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 384 KB | Integer -2 violates the range [0, 350000] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |