Submission #1360533

#	Time	Username	Problem	Language	Result	Execution time	Memory
1360533		nini_gvenetadze	곤돌라 (IOI14_gondola)	C++20	20 / 100	967 ms	756 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; 
    int c=-1; 
    for(int i=0; i<n; i++)
    {
        if(inputseq[i]<=n)
        {
            if(c==-1)
            {
                c=inputseq[i];
                k=i;
                continue;
            }

            if(inputseq[i]==1)
            {
                c=inputseq[i];
                k=i;
                continue;
            }

            if(inputseq[i]-c!=i-k)
            {
                return 0;
            }

            c=inputseq[i];
            k=i;
        }
    }

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

int countReplacement(int n, int inputSeq[]){
    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