# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1183421 | Albara_Abdulhafith | 곤돌라 (IOI14_gondola) | C++20 | 0 ms | 0 KiB |
#include "gondola.h"
int valid(int n, int inputSeq[])
{
int mn = n + 1;
int id = -1;
map<int, int> freq;
for(int i = 0; i < n; i++){
if(inputSeq[i] <= n and inputSeq[i] < mn){
mn = inputSeq[i];
id = i;
}
freq[inputSeq[i]]++;
if(freq[inputSeq[i]] > 1){
return 0;
}
}
if(id == -1){
return 1;
}
for(int i = 0; i < n; i++){
if(inputSeq[(i + id) % n] <= n and inputSeq[(i + id) % n] != mn){
return 0;
}
mn++;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}