# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823457 | kebine | Gondola (IOI14_gondola) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[]) {
for(int i=1; i<n; i++) {
if(inputSeq[i] != 1) {
if(inputSeq[i-1] != inputSeq[i]-1) {
return 0;
}
}
else {
if(inputSeq[i-1] != inputSeq[i]-1) {
return 0;
}
}
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
int freq[250004];
memset(freq, 0, sizeof(freq));
int mxn = n;
for(int i=0; i<n; i++) {
freq[gondolaSeq[i]]++;
mxn = max(mxn, gondolaSeq[i]);
}
int ret = mxn - n;
int cnt = 0;
for(int i=1; i<mxn; i++) {
if(freq[i] == 0) {
replacementSeq[cnt] = i;
cnt++;
}
}
return ret;
}
int countReplacement(int n, int inputSeq[]) {
}