| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1352395 | hmms127 | Gondola (IOI14_gondola) | C++20 | 0 ms | 0 KiB |
#include "gondola.h"
#include "bits/stdc++.h"
using namespace std;
#define f1(n) for(int i=0;i<n;i++)
#define f3(n) for(int j=0;j<n;j++)
#define f2(m,n,q) for(int i=m;i<n;i+=q)
#define f4(m,n,q) for(int j=m;j<n;j+=q)
#define int long long
#define pb push_back
constexpr int N=2e5+5,M=1e10,LOG=21,mod=998244353,inf=1e15;
using pr=pair<int,int>;
using ar=array<int,3>;
int valid(int n, int a[]) {
int idx=0;vector<int>v;
for (int i=0;i<n;i++)if (a[i]==1){idx=i;break;}
for (int i=idx;i<n;i++)v.pb(a[i]);
for (int i=0;i<idx;i++)v.pb(a[i]);
int k=1;
for (int i=0;i<n;i++)k&=(v[i]==i+1);
return k;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}