| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1290373 | islam_2010 | 곤돌라 (IOI14_gondola) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
const int sz = 2e5+5;
const int inf = 1e9 + 7;
int valid(int n, int inputSeq[]){
int ind = -1;
for(int i = 0; i < n; i++){
if(inputSeq[i] == 1){
ind = i;
break;
}
}if(ind == -1){
return 0;
}for(int i = 0; i < n; i++){
if(inputSeq[(ind + i)%n] != i+1){
return 0;
}
}return 1;
}
int replacement(int n, int k, int inputSeq[], int replacementSeq[]) {
return 0;
}
int countReplacement(int n, int inputSeq[]) {
return 0;
}
