Submission #308213

#TimeUsernameProblemLanguageResultExecution timeMemory
308213tengiz05Gondola (IOI14_gondola)C++17
10 / 100
13 ms1152 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; const int N = 1e5+5; int a[N]; int valid(int n, int inputSeq[]){ for(int i=0;i<n;i++)a[i] = inputSeq[i]; int i; for(i=0;i<n;i++){ if(a[i] <= n)break; }if(a[i] > n)return true; int now = a[i]; for(int j=0;j<n;j++){ if(a[i] <= n && a[i] != now)return 0; now++; if(now > n)now = 1; i++; i%=n; } return 1; } //---------------------- 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...