# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
428423 | markthitrin | 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 "gondola.h"
#include <map>
int valid(int n, int inputSeq[])
{
std::map<int,bool> g;
int max = 0;
int find_min = 2000000000;
int min_pos = 0;
for(int q = 0 ;q<n;q++){
if(g[inputSeq[q]])
return 0;
g[inputSeq[q]] = true;
if(find_min > inputSeq[q]){
find_min = inputSeq[q];
min_pos = q;
}
}
if(find_min > n)
return 1;
int last_pos = min_pos - fins_min;
for(int q = min_pos;q < min_pos + n;q++){
if(max < inputSeq[q % n] && inputSeq[q % n] <= n){
if(inputSeq[q % n] - max != q - last_pos)
return 0;
max = inputSeq[q % n];
inputSeq[q % n] = 2000000000;
last_pos = q;
}
}
for(int q = 0 ;q<n;q++){
if(inputSeq[q] <= n)
return 0;
}
return 1;
}
//----------------------
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
return -2;
}
//----------------------
int countReplacement(int n, int inputSeq[])
{
return -3;
}