Submission #563083

#	Time	Username	Problem	Language	Result	Execution time	Memory
563083		shahriarkhan	Gondola (IOI14_gondola)	C++14	20 / 100	29 ms	4492 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std ;

int valid(int n, int inputSeq[])
{
    int idx = -1 , cur = 0 ;
    map<int,int> vis ;
    for(int i = 0 ; i < n ; ++i)
    {
        if(inputSeq[i]<=n)
        {
            idx = i ;
            cur = inputSeq[i] - 1 ;
            break ;
        }
    }
    for(int i = idx ; i < n ; ++i)
    {
        if((inputSeq[i]<=n) && (inputSeq[i]!=(cur+1))) return 0 ;
        cur = (cur+1)%n ;
    }
    for(int i = 0 ; i < n ; ++i)
    {
        if(vis[inputSeq[i]]) return 0 ;
        vis[inputSeq[i]] = 1 ;
    }
    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