제출 #589451

#제출 시각아이디문제언어결과실행 시간메모리
589451AlperenT곤돌라 (IOI14_gondola)C++17
20 / 100
15 ms2108 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int n, int arr[]){ int arr2[n]; copy(arr, arr + n, arr2); sort(arr2, arr2 + n); if(unique(arr2, arr2 + n) != arr2 + n) return false; 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++) v.push_back(arr[j]); for(int j = 0; j < i; j++) v.push_back(arr[j]); break; } } for(int i = 0; i < n; i++) if(v[i] <= n && v[i] != 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...