| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1015153 | amirhoseinfar1385 | Holiday (IOI14_holiday) | C++17 | 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 "gondola.h"
#include<bits/stdc++.h>
using namespace std;
int inf=1e9+5;
int valid(int n, int inputSeq[])
{
int wh=-1,mn=inf;
for(int i=0;i<n;i++){
if(inputSeq[i]<mn){
wh=i;
mn=inputSeq[i];
}
}
int last=mn;
for(int i=0;i<n;i++){
if(inputSeq[(i+wh)%n]<=n){
if(inputSeq[(i+wh)%n]<last){
return 0;
}
last=inputSeq[(i+wh)%n];
}
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}