Submission #431548

#	Time	Username	Problem	Language	Result	Execution time	Memory
431548		MilosMilutinovic	Gondola (IOI14_gondola)	C++14	15 / 100	15 ms	588 KiB

gondola

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

int valid(int N, int A[]) {
    int j = -1;
    for (int i = 0; i < N; i++)
        if (A[i] >= 1 && A[i] <= N) {
            j = i;
            break;
        }
    if (j == -1)
        return 1;
    int val = A[j];
    for (int i = 0; i < N; i++) {
        int id = (i + j) % N;

        if (A[id] >= 1 && A[id] <= N && A[id] != val)
            return 0;

        val++;
        if (val == N + 1)
            val = 1;
    }
    return 1;
}

int replacement(int N, int A[], int ans[]) {
    return 1;
}

int countReplacement(int N, int A[]) {
    return valid(N, A);
}

• 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: 5 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10