Submission #441250

#TimeUsernameProblemLanguageResultExecution timeMemory
441250AlexRex0Gondola (IOI14_gondola)C++14
10 / 100
14 ms1100 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { int valido = 1, inicio = -1, valor = INT_MAX; for(int i = 0; i < n; ++i){ if(inputSeq[i] <= n && inputSeq[i] < valor){ inicio = i; valor = inputSeq[i]; } } if(inicio != -1){ valor++; for(int i = inicio + 1; i < n; ++i){ if(inputSeq[i] <= n && inputSeq[i] != valor){ valido = 0; } valor++; } for(int i = 0; i < inicio; ++i){ if(inputSeq[i] <= n && inputSeq[i] != valor){ valido = 0; } valor++; } } return valido; } //---------------------- 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...