# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236948 | crossing0ver | Gondola (IOI14_gondola) | C++17 | 33 ms | 5240 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;
const int MAXN = 1E5+5;
int n,a[MAXN];
int valid(int n1, int inputSeq[]) {
n = n1;
int pos = -1;
for (int i = 0; i < n; i++) {
a[i] = inputSeq[i];
if (a[i] <= n)
pos = i;
}
if (pos != -1) {
int x = (a[pos] - pos - 1)%n;
if (x <0) x+= n;
int b[MAXN];
for (int i = 0; i < n; i++) {
b[(x + i)%n] = a[i];
}
for (int i = 0;i < n; i++)
a[i] = b[i];
}
set<int> s;
for (int i = 0; i < n; i++) {
if (a[i] < n) {
if (a[i] != i + 1) return 0;
}
s.insert(a[i]);
}
if (s.size() != n) return 0;
return 1;
}
int replacement(int n1, int gondolaSeq[], int replacementSeq[]){
valid(n1,gondolaSeq);
vector<int> v;
for (int i = 0; i < n ;i++) {
if (a[i] > n) {
v.push_back(a[i]);
}
}
sort (v.begin(),v.end());
int last = n;
vector<int> b(n+1);
vector<int> g;
for (int i = 0; i < n; i++)
if (a[i] <= n) b[a[i]] = 1;
for (int i = 1; i <= n; i++) {
if (!b[i]) g.push_back(b[i]);
}
int cnt = 0;
int val = n+1;
vector<bool> good(1e6);
for (int i = 0; i < v.size(); i++)
good [v[i]] = 1;
if (v.size() == 0) return 0;
int mx = v.back() + 1;
while (val != mx) for (int i = 0; i < g.size(); i++) {
if (!good[ g[i] ]) {
replacementSeq[cnt] = g[i];
g[i] = val;
val++;
cnt++;
}
}
return cnt;
}
int countReplacement(int n, int inputSeq[]) { return 0;}
/*
main() {
int n;
cin >> n;
int inputseq[n];
for (int i = 0;i < n; i++)
cin >> inputseq[i];
// cout << (n,inputseq);
} */
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |