Submission #842634

#TimeUsernameProblemLanguageResultExecution timeMemory
842634WarinchaiGondola (IOI14_gondola)C++14
0 / 100
1 ms348 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; int valid(int n, int s[]) { int prev=0,count=0; for(int i=1;i<=n;i++){ if(s[i]<=n){ if(s[i]<prev){ count++; } prev=s[i]; } } if(count>1){ return 0; } 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...