제출 #1242501

#제출 시각아이디문제언어결과실행 시간메모리
1242501edga1Gondola (IOI14_gondola)C++20
20 / 100
9 ms584 KiB
#include <bits/stdc++.h> #include "gondola.h" #define pb push_back using namespace std; int valid(int n, int inputSeq[]) { int s=0,o; for(int i=0; i<n; i++){ if(inputSeq[i]<=n){ s=1; o=(i-inputSeq[i]+1+n)%n; } } if(!s){ sort(inputSeq,inputSeq+n); for(int i=0; i<n-1; i++){ if(inputSeq[i]==inputSeq[i+1]) return 0; } return 1; } for(int i=0; i<n; i++){ if(i!=(inputSeq[i]-1+o)%n && inputSeq[i]<=n) return 0; } sort(inputSeq,inputSeq+n); for(int i=0; i<n-1; i++){ if(inputSeq[i]==inputSeq[i+1]) return 0; } return 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...