제출 #320132

#제출 시각아이디문제언어결과실행 시간메모리
320132lukameladze곤돌라 (IOI14_gondola)C++14
20 / 100
15 ms2284 KiB
# include <bits/stdc++.h> #include "gondola.h" using namespace std; long long x,num,idx,mp[300005]; int valid(int n , int a[]) { //cin>>n; idx=-1; for (int i=0; i<n; i++) { // cin>>a[i]; if (mp[a[i]]) x=1; mp[a[i]]=1; if (a[i]<=n) idx=i; } if (x==1) { return 0; } if (idx==-1) { return 1; } num=a[idx]; for (int i=idx+1; i<n; i++) { num++; if (num==n+1) num=1; if (a[i]<=n && a[i]!=num) { return 0; } } for (int i=0; i<idx; i++) { num++; if (num==n+1) num=1; if (a[i]<=n && a[i]!=num) { return 0; } } return 1; } int replacement(int n, int gondolaSeq[], int replacementSeq[]) { return 0; } int countReplacement(int n, int inputSeq[]) { return 0; }
#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...