Submission #1041125

#TimeUsernameProblemLanguageResultExecution timeMemory
1041125DeathIsAweGondola (IOI14_gondola)C++14
10 / 100
6 ms1116 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; #define ll long long int valid(int n, int inputSeq[]) { int start = -1, temp; for (int i=0;i<n;i++) { if (inputSeq[i] <= n) { start = i; break; } } if (start == -1) { return 1; } else { for (int i=start+1;i<n;i++) { if (inputSeq[i] <= n) { temp = (inputSeq[i] - inputSeq[start] + n) % n; if (temp != i - start) { return 0; } start = i; } } } 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...