Submission #308390

#	Time	Username	Problem	Language	Result	Execution time	Memory
308390		amunduzbaev	Gondola (IOI14_gondola)	C++14	20 / 100	14 ms	1664 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
//#include "grader.cpp"
const int N=(300000);
int used[N];
int valid(int n, int a[]){
    bool b=0;
    int i;
    
    for(i=0;i<n;i++){
        if(used[a[i]])
            return 0;
        used[a[i]]++;
    }
    
    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;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10