# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
302573 | kevinsogo | Gondola (IOI14_gondola) | C++17 | 39 ms | 2688 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;
using ll = long long;
const ll mod = 1000000009;
ll mpow(ll b, ll e) {
if (e == 0) return 1;
if (e & 1) return mpow(b, e - 1) * b % mod;
return mpow(b * b % mod, e >> 1);
}
vector<int> arr(int *s, int n, int d = 0) {
vector<int> v(s, s + n);
for (int i = 0; i < n; i++) v[i] += d;
return v;
}
int rotatoize(vector<int>& v) {
int p = 0, n = v.size();
while (p < n && v[p] >= n) p++;
if (p < n) rotate(v.begin(), v.begin() + (p - v[p] + n) % n, v.end());
return p;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
vector<int> gon = arr(gondolaSeq, n, -1);
vector<int> rep;
int p = rotatoize(gon);
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... |