#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[]){
map<int, bool>mp;
for(int i=0; i<n; i++){
if(!mp[inputSeq[i]])
mp[inputSeq[i]]=true;
else return 0;
}
int fi=-1;
for(int i=0; i<n; i++){
if(inputSeq[i]<=n){
if(fi==-1) fi=i;
else{
int check=i+inputSeq[fi]-fi;
check%=n;
if(check==0) check=n;
if(check!=inputSeq[i]) return 0;
}
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
int rotate=0;
for(int i=0; i<n; i++){
if(gondolaSeq[i]<=n) rotate=(gondolaSeq[i]-i+1)%n;
}
int initSeq[n]={};
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > >pq;
for(int i=0; i<n; i++){
initSeq[i]=gondolaSeq[(i-rotate)%n];
if(initSeq[i]>n) pq.push({initSeq[i], i+1});
}
int idx=0, cnt=0;
while(!pq.empty()){
int replacementGondola=pq.top().first;
int idxc=pq.top().second;
pq.pop();
replacementSeq[idx++]=idxc;
for(int i=cnt; i<replacementGondola; i++){
replacementSeq[idx++]=i;
}
cnt=replacementGondola+1;
}
return idx;
}
int countReplacement(int n, int inputSeq[]){
}
Compilation message
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:54:1: warning: no return statement in function returning non-void [-Wreturn-type]
}
^
# |
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 |
# |
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 |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
20 ms |
2424 KB |
Output is correct |
7 |
Correct |
14 ms |
1272 KB |
Output is correct |
8 |
Correct |
35 ms |
4344 KB |
Output is correct |
9 |
Correct |
12 ms |
1656 KB |
Output is correct |
10 |
Correct |
48 ms |
5112 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
380 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 |
256 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
20 ms |
2428 KB |
Output is correct |
7 |
Correct |
14 ms |
1272 KB |
Output is correct |
8 |
Correct |
35 ms |
4344 KB |
Output is correct |
9 |
Correct |
12 ms |
1532 KB |
Output is correct |
10 |
Correct |
47 ms |
4984 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
26 ms |
2424 KB |
Output is correct |
14 |
Correct |
2 ms |
376 KB |
Output is correct |
15 |
Correct |
58 ms |
5240 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Integer 0 violates the range [1, 77] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Integer 0 violates the range [1, 77] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Integer 0 violates the range [1, 77] |
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 |
256 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 |
- |