Submission #705369

#	Time	Username	Problem	Language	Result	Execution time	Memory
705369		ToroTN	Gondola (IOI14_gondola)	C++14	20 / 100	12 ms	2468 KiB

gondola

#include<bits/stdc++.h>
using namespace std;
#include "gondola.h"
//#include "grader.cpp"
int a[100005],b[100005];
int valid(int n, int inputSeq[])
{
    int type=1,pos[250005];
    for(int i=0;i<n;i++)
    {
        a[i+1]=inputSeq[i];
    }
    for(int i=1;i<=n;i++)pos[a[i]]=i;
    for(int i=1;i<n;i++)
    {
        if(!(pos[i]==n&&pos[i+1]==1)&&!(pos[i]+1==pos[i+1]))
        {
            type=0;
        }
    }
    return type;
}   

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    for(int i=0;i<n;i++)
    {
        a[i+1]=gondolaSeq[i];
    }
    return 0;
}

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

int countReplacement(int n, int inputSeq[])
{
    for(int i=0;i<n;i++)
    {
        a[i+1]=inputSeq[i];
    }
    return 0;
}

• 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