제출 #832399

#제출 시각아이디문제언어결과실행 시간메모리
832399ttamx곤돌라 (IOI14_gondola)C++14
10 / 100
9 ms1452 KiB
#include "gondola.h" #include<bits/stdc++.h> using namespace std; int valid(int n, int Seq[]){ vector<int> s(n); for(int i=0;i<n;i++)if(Seq[i]<=n)s[i]=Seq[i]; for(int t=0;t<2;t++){ for(int i=0;i<n;i++){ if(s[i]>0){ auto &x=s[(i+1)%n]; int val=s[i]%n+1; if(x==0)x=val; else if(x!=val)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...