# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153272 | 2019-09-13T07:04:27 Z | arnold518 | Gondola (IOI14_gondola) | C++14 | 24 ms | 2404 KB |
#include "gondola.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int MAXN = 1e5; int valid(int N, int *A) { int i, j; for(i=0; i<N; i++) A[i]--; vector<int> S(A, A+N); sort(S.begin(), S.end()); S.erase(unique(S.begin(), S.end()), S.end()); if(S.size()!=N) return 0; int flag=-1; for(i=0; i<N; i++) { if(A[i]>=N) continue; int t=(A[i]-i+N)%N; if(flag==-1) flag=t; else if(flag!=t) return 0; } return 1; } int replacement(int N, int *A, int *B) { int i, j, ret=0; int flag=0; vector<pii> V; for(i=0; i<N; i++) { if(A[i]<=N) { flag=(A[i]-1-i+N)%N; continue; } V.push_back({A[i], i}); } for(i=0; i<N; i++) A[i]=(i+flag)%N+1; sort(V.begin(), V.end()); int now=N+1; for(i=0; i<V.size(); i++) { int p=V[i].first, q=V[i].second; while(A[q]!=p) { B[ret++]=A[q]; A[q]=now++; } } return ret; } int countReplacement(int N, int *A) { }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 256 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 | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 252 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 2 ms | 252 KB | Output is correct |
6 | Correct | 10 ms | 632 KB | Output is correct |
7 | Correct | 20 ms | 1016 KB | Output is correct |
8 | Correct | 14 ms | 888 KB | Output is correct |
9 | Correct | 7 ms | 504 KB | Output is correct |
10 | Correct | 20 ms | 1016 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 256 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 | 10 ms | 632 KB | Output is correct |
7 | Correct | 20 ms | 1016 KB | Output is correct |
8 | Correct | 14 ms | 888 KB | Output is correct |
9 | Correct | 7 ms | 504 KB | Output is correct |
10 | Correct | 20 ms | 1016 KB | Output is correct |
11 | Correct | 2 ms | 256 KB | Output is correct |
12 | Correct | 3 ms | 376 KB | Output is correct |
13 | Correct | 11 ms | 656 KB | Output is correct |
14 | Correct | 2 ms | 256 KB | Output is correct |
15 | Correct | 23 ms | 1016 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 256 KB | Output is correct |
2 | Correct | 3 ms | 252 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 3 ms | 256 KB | Output is correct |
5 | Correct | 3 ms | 256 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 | 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 | 376 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Correct | 3 ms | 376 KB | Output is correct |
9 | Correct | 3 ms | 376 KB | Output is correct |
10 | Correct | 3 ms | 376 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 | 252 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 | 376 KB | Output is correct |
7 | Correct | 2 ms | 400 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 376 KB | Output is correct |
10 | Correct | 2 ms | 248 KB | Output is correct |
11 | Correct | 12 ms | 1016 KB | Output is correct |
12 | Correct | 14 ms | 1148 KB | Output is correct |
13 | Correct | 18 ms | 1568 KB | Output is correct |
14 | Correct | 12 ms | 1144 KB | Output is correct |
15 | Correct | 24 ms | 2404 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 256 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |