Submission #1308282

#	Time	Username	Problem	Language	Result	Execution time	Memory
1308282		Rares	Gondola (IOI14_gondola)	C++20	0 / 100	1 ms	348 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;

const int MAXN=1e6+10;
const int MOD=1e9+9;

int f[MAXN];

int valid (int n, int a[]){
    int x=-1;
    for (int i=1;i<=n;++i){
        a[i]=a[i-1];
    }
    for (int i=1;i<=n;++i){
        if (a[i]>n) continue;
        int crt=a[i]-i;
        if (crt<0) crt+=n;
        if (x==-1){
            x=crt;
        }
        else{
            if (x!=crt) return 0;
        }
    }
    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