# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
431659 | MilosMilutinovic | Gondola (IOI14_gondola) | C++14 | 57 ms | 4660 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 "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int N, int A[]) {
int j = -1;
for (int i = 0; i < N; i++)
if (A[i] >= 1 && A[i] <= N) {
j = i;
break;
}
set<int> vals;
for (int i = 0; i < N; i++)
vals.insert(A[i]);
if (vals.size() != N)
return 0;
if (j == -1)
return 1;
int val = A[j];
for (int i = 0; i < N; i++) {
int id = (i + j) % N;
if (A[id] >= 1 && A[id] <= N && A[id] != val)
return 0;
val++;
if (val == N + 1)
val = 1;
}
return 1;
}
int replacement(int N, int A[], int ans[]) {
vector<int> B;
for (int i = 0; i < N; i++)
if (A[i] > N)
B.push_back(i);
int start_id = -1;
for (int i = 0; i < N; i++)
if (A[i] >= 1 && A[i] <= N) {
start_id = i;
break;
}
if (start_id == -1) {
start_id = 0;
for (int i = 0; i < N; i++)
if (A[start_id] > A[i])
start_id = i;
}
vector<int> start_val(N);
for (int i = 0; i < N; i++) {
int index = (start_id + i) % N;
int val = A[start_id] + i;
if (val > N)
val -= N;
start_val[index] = val;
}
sort(B.begin(), B.end(), [&](int i, int j){
return A[i] < A[j];
});
if (B.empty())
return 0;
int index = 0, last = N + 1;
for (int i = 0; i < (int) B.size(); i++) {
ans[index++] = start_val[B[i]];
if (i == 0)
for (int j = N + 1; j < A[B[i]]; j++)
ans[index++] = j;
else
for (int j = A[B[i - 1]] + 1; j < A[B[i]]; j++)
ans[index++] = j;
}
return index;
}
int countReplacement(int N, int A[]) {
return valid(N, A);
}
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... |