Submission #415852

#	Time	Username	Problem	Language	Result	Execution time	Memory
415852		LouayFarah	Gondola (IOI14_gondola)	C++14	25 / 100	16 ms	2124 KiB

gondola

#include "bits/stdc++.h"
#include "gondola.h"
using namespace std;
 
#define pb push_back
 
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return 1;
}
int countReplacement(int n, int inputSeq[])
{
  return 1;
}
 
vector<int> book;
vector<int> r;
int valid(int n, int inputSeq[])
{
    if(n==1)
        return 1;
    book.assign(250001, 0);
    for(int i = 0; i<n; i++)
    {
        book[inputSeq[i]]++;
        if(book[inputSeq[i]]>1)
        {
            return 0;
        }
    }

    int counter = 0;
    int curr = 0;
    for(int i = 0; i<n; i++)
    {
        if(inputSeq[i]<=n)
        {
            curr = inputSeq[i];
            break;
        }
        counter++;
    }

    if(curr==0)
        return 1;

    int temp = curr;
    for(int i = counter; i<n; i++)
    {
        if(inputSeq[i]>n)
        {
            temp++;
            if(temp>n)
                temp = 1;
        }
        else
        {
            if(inputSeq[i]!=temp)
                return 0;
            temp++;
            if(temp>n)
                temp = 1;
        }
    }

    temp = curr;
    for(int i = counter; i>=0; i--)
    {
        if(inputSeq[i]>n)
        {
            temp--;
            if(temp==0)
                temp = n;
        }
        else
        {
            if(inputSeq[i]!=temp)
                return 0;
            temp--;
            if(temp==0)
                temp = n;
        }
    }
    return 1;
}

• 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: 5 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10