Submission #292740

#TimeUsernameProblemLanguageResultExecution timeMemory
292740TMJNGondola (IOI14_gondola)C++17
20 / 100
18 ms1664 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int c[250001]; int valid(int n, int inputSeq[]){ int t=1; for(int i=0;i<n;i++){ if(inputSeq[i]<=n){ for(int j=0;j<n;j++){ if(inputSeq[(i+j)%n]<=n){ if((inputSeq[i]+j)%n!=inputSeq[(i+j)%n]%n){ t=0; } } } break; } } for(int i=0;i<n;i++){ if(c[inputSeq[i]])t=0; c[inputSeq[i]]++; } return t; } //---------------------- int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return -2; } //---------------------- int countReplacement(int n, int inputSeq[]) { return -3; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...