# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
30941 | kajebiii | Gondola (IOI14_gondola) | C++14 | 19 ms | 5400 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;
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<double, double> pd;
typedef pair<int, int> pi;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll; typedef pair<ll, pi> plp;
typedef tuple<int, int, int> ti; typedef tuple<ll, int, int> tli;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF * 2;
int valid(int n, int nr[]) {
int ix = -1, cnt = 0;
for(int i=0; i<n; i++) if(nr[i] >= 1 && nr[i] <= n) {
ix = i;
break;
}
if(ix == -1) {
sort(nr, nr+n);
for(int i=0; i+1<n; i++) if(nr[i] == nr[i+1]) return 0;
return 1;
}
ix = (ix + n - (nr[ix]-1)) % n;
for(int i=0; i<n; i++) if(nr[(ix+i)%n] != (i+1)) return 0;
return 1;
}
//----------------------
const int MAX_N = 1e5 + 100;
int temp[MAX_N];
int replacement(int n, int nr[], int res[]) {
for(int i=0; i<n; i++) temp[i] = nr[i];
int ix = -1, cnt = 0;
for(int i=0; i<n; i++) if(nr[i] >= 1 && nr[i] <= n) {
ix = i;
break;
}
if(ix != -1) {
ix = (ix + n - (nr[ix]-1)) % n;
for(int i=0; i<n; i++) nr[i] = temp[(i+ix)%n];
}
// for(int i=0; i<n; i++) printf("%d ", nr[i]); puts("");
int ansL = 0;
vector<pi> ps;
for(int i=0; i<n; i++) ps.push_back(pi(nr[i], i));
sort(ALL(ps));
for(int i=0; i<n; i++) nr[i] = i+1;
int now = n;
for(int i=0; i<n; i++) {
while(now < ps[i].one) {
now++;
res[ansL++] = nr[ps[i].two];
nr[ps[i].two] = now;
}
}
return ansL;
}
//----------------------
int countReplacement(int n, int inputSeq[]) {
return -3;
}
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... |