| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1304994 | mlecio | Gondola (IOI14_gondola) | C++20 | 0 ms | 0 KiB |
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int inputSeq[])
{
set<int>a;
long long mini=1e18;
int indeks=-2137;
for(int i=0;i<n;i++){
int x=inputSeq[i];
if(!(x<mini))
{
x=mini;
ind=i;
}
if(a[x].count!=0){
return 0;
}
a.insert(x);
}
vector<int>b;
for(int i=indeks;i<n;i++){
b.push_back(inputSeq[i]);
}
for(int i=0;i<indeks;i++){
b.push_back(inputSeq[i]);
}
int pop=0;
for(int i=0;i<n-1;i++){
if(b[i]>n)
continue;
if(pop>b[i])
return 0;
pop=b[i];
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
}
int countReplacement(int n, int inputSeq[])
{
}
