Submission #1275834

#TimeUsernameProblemLanguageResultExecution timeMemory
1275834LeynaGondola (IOI14_gondola)C++20
10 / 100
10 ms1344 KiB
#include "gondola.h" #include <iostream> #include <vector> #include <algorithm> using namespace std; int valid(int n, int inputSeqArray[]) { vector<int> inputSeq(n); for (int i=0; i<n; i++) inputSeq[i] = inputSeqArray[i]; int mini = 1e9; int min_idx; for (int i=0; i<n; i++){ if (inputSeq[i] < mini){ mini = inputSeq[i]; min_idx = i; } } int last = 0; for (int i=min_idx; i<n; i++){ if (inputSeq[i] <= n){ if (inputSeq[i] <= last) return false; last = inputSeq[i]; } } for (int i=0; i<min_idx; i++){ if (inputSeq[i] <= n){ if (inputSeq[i] <= last) return false; last = inputSeq[i]; } } sort(inputSeq.begin(), inputSeq.end()); for (int i=1; i<n; i++){ if (inputSeq[i] == inputSeq[i-1]) return false; } return true; } //---------------------- 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...