Submission #866622

#TimeUsernameProblemLanguageResultExecution timeMemory
866622Onur_IlgazGondola (IOI14_gondola)C++17
10 / 100
7 ms1116 KiB
#include "gondola.h" #include <bits/stdc++.h> #define inf INT_MAX int valid(int n, int arr[]) { int ind = 0, mn = inf; for(int i = 0; i < n; i++) { if(arr[i] < mn) ind = i, mn = arr[i]; } for(int i = (ind + 1) % n; i % n != ind; i = (i + 1) % n) { if(arr[i] <= n) { if(arr[i] < mn) { return 0; } mn = arr[i]; } } 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...