Submission #767594

#	Time	Username	Problem	Language	Result	Execution time	Memory
767594		tigar	Gondola (IOI14_gondola)	C++14	0 / 100	1 ms	304 KiB

gondola

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

using namespace std;
 
int valid(int n, int* inputSeq)
{
    int last=-1, pos=-1;
    for(int i=0; i<n; i++)
    {
        if(inputSeq[i]<=n and last==-1){last=inputSeq[i]; pos=i;}
        else if(inputSeq[i]<=n)
        {
            if((inputSeq[i]-last)%n==(i-pos)%n){last=inputSeq[i]; pos=i;}
            else return 0;
        }
    }
    return 1;
}

int replacement(int n, int* gondolaSeq, int* replacementSeq) 
{
	return 2005;
}

int countReplacement(int n, int* inputSeq) 
{
	return 24;
}

• 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