| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 204790 | awlintqaa | 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.
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "gondola.h"
int done[100009];
int valid(int N, int a[]){
int n=N;
for(int i=0;i<n;i++)a[i]=inputSeq[i];
int st=-1,mn=1e9;
vi ret;
for(int i=0;i<n;i++){
if(a[i]<=n && a[i]<mn){
mn=a[i];
st=i;
}
else if (a[i]>n)ret.pb(a[i]);
}
sort(ret.begin(),ret.end());
if(ret.size()){
for(int i=1;i<ret.size();i++){
if(ret[i]!=ret[i-1]+1)return 0;
}
}
if(st==-1)return 1;
int goal=a[st];
while(!done[st]){
if(a[st]<=n && a[st]!=goal)return 0;
done[st]=1;
st++;
goal++;
st%=n;
if(goal>n)goal=1;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}