Submission #66324

#TimeUsernameProblemLanguageResultExecution timeMemory
66324someone_aaGondola (IOI14_gondola)C++17
0 / 100
4 ms588 KiB
#include "gondola.h" #include <bits/stdc++.h> using namespace std; int valid(int n, int arr[]) { bool check = true; for(int i=1;i<n;i++) { if(arr[i] > n) continue; else if(arr[i] == 1 && arr[i-1] < n) { check = false; } else { if(arr[i-1] <= n && arr[i-1] != arr[i] - 1) check = false; } } if(check) return 1; else return 0; } //---------------------- 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...