Submission #253298

#TimeUsernameProblemLanguageResultExecution timeMemory
253298eohomegrownappsGondola (IOI14_gondola)C++14
10 / 100
12 ms1152 KiB
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]){
    vector<bool> seen(250001,false);
    int mnv = 250001;
    int mnind = -1;
    for (int i = 0; i<n; i++){
        if (seen[inputSeq[i]]){
            return 0;
        }
        seen[inputSeq[i]]=true;
        if (mnv>inputSeq[i]){
            mnv=inputSeq[i];
            mnind=i;
        }
    }
    for (int i = mnind+1; i!=mnind; i=(i+1)%n){
        if (inputSeq[i]<=n){
            if (inputSeq[i]<=mnv){
                return 0;
            }
            mnv=inputSeq[i];
        }
    }
    return 1;
}

//----------------------

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

//----------------------

int countReplacement(int n, int inputSeq[])
{
  return -3;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...