Submission #1360528

#	Time	Username	Problem	Language	Result	Execution time	Memory
1360528		nini_gvenetadze	Gondola (IOI14_gondola)	C++20	0 / 100	0 ms	344 KiB

gondola

#include<bits/stdc++.h>
using namespace std;
#include "gondola.h"
int valid(int n, int inputseq[])
{
    for(int i=0; i<n; i++)
    {
        for(int j=i+1; j<n; j++)
        {
            if(inputseq[i]==inputseq[j])
            {
                return 0;
            }
        }
    }
    int k=-1;
    for(int i=0; i<n; i++)
    {
        if(inputseq[i]<=n)
        {
            k=i;
            break;
        }
    }

    if(k==-1) return 1;

    int c=inputseq[k];

    for(int i=1; i<n; i++)
    {
        int j=k+1;
        if(j>=n) j-=n;

        int w=c+1;
        if(w>n) w=1;

        if(inputseq[j]<=n)
        {
            if(inputseq[j]!=w)
            {
                return 0;
            }
        }
        c=w;
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    return 0;
}

int countReplacement(int n, int inputSeq[]){
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 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