Submission #515925

#	Time	Username	Problem	Language	Result	Execution time	Memory
515925		asadasdas	Gondola (IOI14_gondola)	C++14	10 / 100	9 ms	944 KiB

gondola

#include <bits/stdc++.h>
#include <gondola.h>

using namespace std;

int valid(int n, int inputseq[])
{
    int index=-1;
    vector<int> real(n);
    for(int i=0; i<n; ++i)
        if(inputseq[i]<=n)
        {
            real[i]=inputseq[i], index=i;
            break;
        }
    if(index==-1)
        return 1;
    int cur=real[index];
    cur=cur==n?1:cur+1;
    for(int j=(index+1)%n; j!=index; j=(j+1)%n,cur=cur==n?1:cur+1)
        if(inputseq[j]<=n && inputseq[j] !=cur)
            return 0;
    return 1;
}

int replacement(int n, int T[], int ans[]) {
            return 0;
}

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

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