제출 #589443

#제출 시각아이디문제언어결과실행 시간메모리
589443AlperenT곤돌라 (IOI14_gondola)C++17
10 / 100
14 ms1752 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int n, int arr[]){ int mn = *min_element(arr, arr + n); if(mn > n) return true; else{ vector<int> v; for(int i = 0; i < n; i++){ if(arr[i] == mn){ for(int j = i; j < n; j++) if(arr[j] <= n) v.push_back(arr[j]); for(int j = 0; j < i; j++) if(arr[j] <= n) v.push_back(arr[j]); break; } } int curmax = 0; for(auto i : v){ if(i <= curmax) return false; else curmax = i; } 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...