제출 #1280187

#제출 시각아이디문제언어결과실행 시간메모리
1280187Nurislam곤돌라 (IOI14_gondola)C++20
20 / 100
25 ms4968 KiB
#include <bits/stdc++.h> #include "gondola.h" using namespace std; int valid(int n, int in[]) { vector<int> a; for(int i = 0; i < n; i ++ ) if(in[i] < n)a.push_back(in[i]); set<int> st; for(int i = 0; i < n; i ++ ) st.insert(in[i]); if(st.size() != n) return 0; int cnt = 0; for(int i = 0; i < a.size(); i ++ ) { if(a[i] > a[(i+1)%a.size()]) cnt ++ ; }; return (cnt == 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...