Submission #102556

#TimeUsernameProblemLanguageResultExecution timeMemory
102556Leonardo_PaesGondola (IOI14_gondola)C++11
10 / 100
14 ms740 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int n, int vet[]){ int x=0; bool ok=true; vet[n]=vet[0]; for(int i=0; i<n; i++){ if(vet[i]>n or vet[i+1]>n){ continue; } else{ if(vet[i+1]<vet[i]){ if(x==0){ x=1; } else{ ok=false; } } } } return ok; } int replacement(int n, int gondolaSeq[], int replacementSeq[]){ return 0; } int countReplacement(int n, int inputSeq[]){ return 0; }
#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...