Submission #291336

#TimeUsernameProblemLanguageResultExecution timeMemory
291336georgerapeanu곤돌라 (IOI14_gondola)C++11
10 / 100
14 ms1152 KiB
#include "gondola.h" #include <cstdio> using namespace std; inline int get_in_range(int st,int dr,int val){ int tmp = (val - st) % (dr - st + 1); if(tmp < 0){ tmp += (dr - st + 1); } return tmp + st; } int valid(int n, int inputSeq[]) { int pos = -1; for(int i = 0;i < n;i++){ if(inputSeq[i] <= n){ pos = i; } } if(pos == -1){ return 1; } for(int i = 0;i < n;i++){ if(inputSeq[i] <= n && inputSeq[i] != get_in_range(1,n,inputSeq[pos] + i - pos)){ 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...