# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
292763 |
2020-09-07T13:02:32 Z |
TMJN |
Gondola (IOI14_gondola) |
C++17 |
|
24 ms |
2816 KB |
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int C[250001];
int valid(int n, int inputSeq[]){
int t=1;
for(int i=0;i<n;i++){
if(inputSeq[i]<=n){
for(int j=0;j<n;j++){
if(inputSeq[(i+j)%n]<=n){
if((inputSeq[i]+j)%n!=inputSeq[(i+j)%n]%n){
t=0;
}
}
}
break;
}
}
for(int i=0;i<n;i++){
if(C[inputSeq[i]])t=0;
C[inputSeq[i]]++;
}
return t;
}
int K[100000],P[250001];
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
int mx=0;
for(int i=0;i<n;i++){
mx=max(mx,gondolaSeq[i]);
}
for(int i=0;i<n;i++){
K[i]=i+1;
}
for(int i=0;i<n;i++){
if(gondolaSeq[i]<=n){
for(int j=0;j<n;j++){
K[(i+j)%n]=(gondolaSeq[i]+j)%n;
}
for(int j=0;j<n;j++){
if(!K[j])K[j]=n;
}
break;
}
}
for(int i=0;i<n;i++){
P[gondolaSeq[i]]=K[i];
}
for(int i=0;i<n;i++){
if(gondolaSeq[i]==mx){
int c=0;
int t=K[i];
for(int j=n+1;j<=mx-1;j++){
if(!P[j]){
replacementSeq[c]=t;
t=j;
}
else{
replacementSeq[c]=P[j];
}
c++;
}
replacementSeq[c]=t;
}
}
return mx-n;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
# |
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 |
512 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
7 ms |
672 KB |
Output is correct |
7 |
Correct |
15 ms |
1024 KB |
Output is correct |
8 |
Correct |
12 ms |
896 KB |
Output is correct |
9 |
Correct |
4 ms |
512 KB |
Output is correct |
10 |
Correct |
14 ms |
1024 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 |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 KB |
Output is correct |
6 |
Correct |
6 ms |
640 KB |
Output is correct |
7 |
Correct |
15 ms |
1024 KB |
Output is correct |
8 |
Correct |
12 ms |
928 KB |
Output is correct |
9 |
Correct |
4 ms |
512 KB |
Output is correct |
10 |
Correct |
14 ms |
1024 KB |
Output is correct |
11 |
Correct |
0 ms |
384 KB |
Output is correct |
12 |
Correct |
0 ms |
384 KB |
Output is correct |
13 |
Correct |
7 ms |
1280 KB |
Output is correct |
14 |
Correct |
0 ms |
384 KB |
Output is correct |
15 |
Correct |
16 ms |
1152 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 |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
384 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 |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
0 ms |
384 KB |
Output is correct |
7 |
Correct |
1 ms |
372 KB |
Output is correct |
8 |
Correct |
1 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
384 KB |
Output is correct |
10 |
Correct |
1 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
1 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
0 ms |
384 KB |
Output is correct |
7 |
Correct |
1 ms |
288 KB |
Output is correct |
8 |
Correct |
1 ms |
384 KB |
Output is correct |
9 |
Correct |
1 ms |
384 KB |
Output is correct |
10 |
Correct |
1 ms |
384 KB |
Output is correct |
11 |
Correct |
13 ms |
1664 KB |
Output is correct |
12 |
Correct |
15 ms |
1920 KB |
Output is correct |
13 |
Correct |
15 ms |
1920 KB |
Output is correct |
14 |
Correct |
13 ms |
1664 KB |
Output is correct |
15 |
Correct |
24 ms |
2816 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
384 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
256 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
256 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
256 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |