#include<bits/stdc++.h>
#include "gondola.h"
#define MAXN 500007
using namespace std;
int n;
int s[MAXN],last,maxs,where[MAXN];
bool li[MAXN];
int valid(int N, int inputSeq[]){
n=N;
int mins=1;
for(int i=1;i<=n;i++){
s[i]=inputSeq[i-1];
s[i+n]=s[i];
if(s[i]<s[mins]){
mins=i;
}
}
for(int i=mins;i<mins+n;i++){
if(s[i]<=n and s[i]!=s[mins]+i-mins)return 0;
if(s[i]>n){
if(li[s[i]])return 0;
li[s[i]]=true;
}
}
return 1;
}
int replacement(int N, int gondolaSeq[], int replacementSeq[]){
n=N;
maxs=1;
for(int i=1;i<=n;i++){
s[i]=gondolaSeq[i-1];
if(s[i]>s[maxs])maxs=i;
where[s[i]]=i;
}
for(int i=n+1;i<=maxs;i++){
if(where[i]==0){
replacementSeq[i-n-1]=maxs;
}else{
replacementSeq[i-n-1]=where[i];
}
}
return s[maxs]-n;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2384 KB |
Output is correct |
2 |
Correct |
1 ms |
2384 KB |
Output is correct |
3 |
Correct |
1 ms |
2636 KB |
Output is correct |
4 |
Correct |
1 ms |
2384 KB |
Output is correct |
5 |
Correct |
1 ms |
2384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2384 KB |
Output is correct |
2 |
Correct |
1 ms |
2384 KB |
Output is correct |
3 |
Correct |
1 ms |
2384 KB |
Output is correct |
4 |
Correct |
1 ms |
2384 KB |
Output is correct |
5 |
Correct |
1 ms |
2384 KB |
Output is correct |
6 |
Correct |
4 ms |
2640 KB |
Output is correct |
7 |
Correct |
7 ms |
2640 KB |
Output is correct |
8 |
Correct |
6 ms |
2640 KB |
Output is correct |
9 |
Correct |
3 ms |
2384 KB |
Output is correct |
10 |
Correct |
7 ms |
2640 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2384 KB |
Output is correct |
2 |
Correct |
1 ms |
2384 KB |
Output is correct |
3 |
Correct |
1 ms |
2384 KB |
Output is correct |
4 |
Correct |
1 ms |
2384 KB |
Output is correct |
5 |
Correct |
1 ms |
2384 KB |
Output is correct |
6 |
Correct |
5 ms |
2640 KB |
Output is correct |
7 |
Correct |
12 ms |
2640 KB |
Output is correct |
8 |
Correct |
6 ms |
2640 KB |
Output is correct |
9 |
Correct |
3 ms |
2384 KB |
Output is correct |
10 |
Correct |
9 ms |
2640 KB |
Output is correct |
11 |
Correct |
1 ms |
2552 KB |
Output is correct |
12 |
Correct |
1 ms |
2384 KB |
Output is correct |
13 |
Correct |
4 ms |
2640 KB |
Output is correct |
14 |
Correct |
1 ms |
2384 KB |
Output is correct |
15 |
Correct |
7 ms |
2640 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
4432 KB |
Integer 0 violates the range [1, 76] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
4600 KB |
Integer 0 violates the range [1, 76] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
4604 KB |
Integer 0 violates the range [1, 76] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
504 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Integer -3 violates the range [0, 1000000008] |
2 |
Halted |
0 ms |
0 KB |
- |