Submission #783187

#TimeUsernameProblemLanguageResultExecution timeMemory
783187Minindu206Gondola (IOI14_gondola)C++14
0 / 100
1 ms340 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int inputSeq[]) { int ind = -1; map<int, int> mp; for (int i = 0; i < n; i++) { if(mp[inputSeq[i]] == 1) return 0; if(inputSeq[i] <= n && ind != -1) ind = i; } if(ind == -1) return 1; for(int i=0;i<n;i++) { if(inputSeq[i] <= n) { int dis_pos = (ind - i + n) % n; int dis_num = (inputSeq[ind] - inputSeq[i] + n) % n; if(dis_num != dis_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...