| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 362492 | Pety | 곤돌라 (IOI14_gondola) | C++14 | 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>
//#include "gondola.h"
using namespace std;
int valid (int n, int inputSeq[]) {
vector<int>f;
f.resize(250002);
for (int i = 0; i < n; i++) {
int next = (i + 1) % n;
if (f[inputSeq[i]])
return 0;
f[inputSeq[i]] = 1;
if (inputSeq[i] <= n && inputSeq[next] <= n) {
if (inputSeq[i] == n && inputSeq[next] != 1)
return 0;
else if (inputSeq[i] < n && inputSeq[next] != inputSeq[i] + 1)
return 0;
}
}
return 1;
}
int replacement (int n, int inputSeq[], int replacementSeq[]) {
vector<int>f;
f.resize(250002);
int mx = 0;
for (int i = 0; i < n; i++) {
f[inputSeq[i]] = 1;
mx = max(mx, inputSeq[i]);
}
int l = 0;
for (int i = 1; i <= mx; i++)
if (!f[i])
replacementSeq[l++] = i;
return l;
}
int countReplacement (int n, int inputSeq[]) {
return 0;
}
/*int main()
{
int aux[] = {3, 1, 4};
int aux2[1] = {0};
cout << replacement(3, aux, aux2);
return 0;
}*/
