# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
356816 | NachoLibre | Gondola (IOI14_gondola) | C++17 | 31 ms | 3304 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>
using namespace std;
#ifndef wambule
#include "gondola.h"
#endif
const int mod = 1000000009;
int P(int a, int b) {
if(b == 0) return 1;
if(b & 1) return 1ll * P(a, b - 1) * a % mod;
int c = P(a, b / 2);
return 1ll * c * c % mod;
}
void G(int a[], int b[], int n) {
for(int i = 0; i < n; ++i) a[i] = b[i];
}
void D(int a[], int n) {
int j = 0;
for(int i = 0; i < n; ++i) {
if(a[i] <= n) {
j = i - a[i] + 1;
if(j < 0) j += n;
break;
}
}
int b[n];
G(b, a, n);
for(int i = j; i < n; ++i) {
# | 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... |