Submission #308385

#TimeUsernameProblemLanguageResultExecution timeMemory
308385amunduzbaevGondola (IOI14_gondola)C++14
10 / 100
12 ms1184 KiB
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
//#include "grader.cpp"


int valid(int n, int a[]){
    bool b=0;
    int i;
    vector<int>v;
    for(i=0;i<n;i++){
        if(a[i] <= n){
            b=1;
            break;
        }
    }
    if(!b){
        return 1;
    }
    int t=a[i];
    for(int j=0;j<n;j++){
        if(a[i]<=n){
            if(a[i]!=t){
                return 0;
            }
        }
        t++;
        i++;
        if(t>n) t=1;
        if(i==n) i=0;
    }
    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...