# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1025092 | nvujica | Gondola (IOI14_gondola) | C++14 | 13 ms | 2520 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"
#define ll long long
#define fi first
#define se second
using namespace std;
const int maxn = 3e5 + 10, mod = 1e9 + 9;
int a[maxn];
int bio[maxn];
vector <pair<int, int> > v;
int mul(int x, int y){
return ((ll)x * y) % mod;
}
int valid(int n, int inputSeq[]){
for(int i = 0; i < n; i++){
a[i] = inputSeq[i] - 1;
if(bio[a[i]]) return 0;
bio[a[i]] = 1;
}
for(int i = 0; i < n; i++){
if(a[i] < n){
for(int j = 0; j < n; j++){
if(a[(i + j) % n] < n){
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... |