# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
122698 |
2019-06-29T06:56:48 Z |
brcode |
Gondola (IOI14_gondola) |
C++14 |
|
61 ms |
4728 KB |
#include <iostream>
#include <algorithm>
#include <map>
#include "gondola.h"
using namespace std;
int arr[2500];
int valid(int n, int inputSeq[]){
map<int,int> m1;
int holdmin = 1e9;
int ind = 0;
for(int i=0;i<n;i++){
if(m1[inputSeq[i]] == 1){
return 0;
}
if(inputSeq[i]<holdmin){
holdmin = inputSeq[i];
ind = i;
}
m1[inputSeq[i]] = 1;
}
for(int i=ind;i<n;i++){
if(inputSeq[i]<=n && inputSeq[i]!=holdmin){
return 0;
}
holdmin++;
}
if(ind == 0){
return 1;
}
for(int i=0;i<ind;i++){
if(inputSeq[i]<=n && inputSeq[i]!=holdmin){
// cout<<inputSeq[i]<<endl;
return 0;
}
holdmin++;
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
map<int,int> m1;
int holdmax = 0;
for(int i=0;i<n;i++){
holdmax = max(holdmax,gondolaSeq[i]);
m1[gondolaSeq[i]]++;
}
int ans = holdmax-n;
int cntr = 0;
for(int i=1;i<=holdmax;i++){
if(gondolaSeq[i]!=holdmax){
replacementSeq[cntr] = i;
cntr++;
}
}
return ans;
}
int countReplacement(int n, int inputSeq[]){
return 0;
}
/*int main(){
int arr[8] = {2, 3, 4, 9, 6, 7, 1};
cout<<valid(7,arr)<<endl;
}*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
380 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 |
256 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 |
380 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
19 ms |
2296 KB |
Output is correct |
7 |
Correct |
13 ms |
632 KB |
Output is correct |
8 |
Correct |
34 ms |
3960 KB |
Output is correct |
9 |
Correct |
12 ms |
1500 KB |
Output is correct |
10 |
Correct |
50 ms |
4600 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 |
256 KB |
Output is correct |
6 |
Correct |
20 ms |
2296 KB |
Output is correct |
7 |
Correct |
14 ms |
760 KB |
Output is correct |
8 |
Correct |
34 ms |
4096 KB |
Output is correct |
9 |
Correct |
12 ms |
1400 KB |
Output is correct |
10 |
Correct |
47 ms |
4600 KB |
Output is correct |
11 |
Correct |
2 ms |
256 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
24 ms |
2040 KB |
Output is correct |
14 |
Correct |
2 ms |
256 KB |
Output is correct |
15 |
Correct |
61 ms |
4728 KB |
Output is correct |
# |
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 |
- |
# |
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 |
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 |
- |