| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1360483 | lizi14 | 곤돌라 (IOI14_gondola) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
#include "gondola.h"
int valid(int n, int inputSeq[]){
int hi=0;
vector<int>v;
set<int>s;
for(int i=0; i<n; i++){
if(inputSeq[i]<=n)v.push_back(inputSeq[i]);
if(s.find(inputSeq[i])!=s.end()){
hi=1;
}
s.insert(inputSeq[i]);
}
for(int i=1; i<n; i++){
if(v[i]==v[i-1]+1)continue;
hi=1;
}
if(hi==1)return false;
else return true;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
return;
}
int countReplacement(int n, int inputSeq[]){
return;
}