| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 282381 | iliccmarko | Gondola (IOI14_gondola) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
using namespace std;
int valid(int n, int p[])
{
for(int i = 1;i<n;i++)
{
if(p[i]==1&&p[i-1]<n)
return 0;
if(p[i]!=p[i-1]-1&&p[i-1]<=n)
return 0;
}
return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]);
{
return 1;
}
int countReplacement(int n, int inputSeq[])
{
return 1;
}