# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
379819 | ponytail | Gondola (IOI14_gondola) | C++17 | 43 ms | 5228 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"
using namespace std;
const int MOD = 1e9 + 9; // remember to long long
int valid(int n,int inputSeq[]){
int cnt=0;
set<int>s;
for(int i=0;i<n;i++) s.insert(inputSeq[i]);
for(int i=0;i<n;i++)cnt+=(inputSeq[i]>=1&&inputSeq[i]<=n);
if(s.size()!=n) return 0;
if(cnt==0) return 1;
for(int i=0;i<n;i++){
if(inputSeq[i]>=1 && inputSeq[i]<=n){
int now=inputSeq[i];
for(int j=i;j<i+n;j++){
if(now!=inputSeq[j%n] && inputSeq[j%n]>=1 && inputSeq[j%n]<=n){
return 0;
}
now=now%n+1;
}
return 1;
}
}
}
int replacement(int n,int gondolaSeq[],int replacementSeq[]){
}
int countReplacement(int n,int inputSeq[]){
}
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... |