Submission #995405

#	Time	Username	Problem	Language	Result	Execution time	Memory
995405		thinknoexit	Gondola (IOI14_gondola)	C++17	10 / 100	12 ms	764 KiB

gondola

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

int valid(int n, int a[]) {
    int mn = n + 1;
    int idx = 0;
    for (int i = 0;i < n;i++) {
        if (a[i] <= n) {
            if (a[i] < mn) {
                mn = a[i];
                idx = i;
            }
        }
    }
    if (mn == n + 1) return 1;
    idx = (idx - mn + 1 + n) % n;
    for (int i = 0;i < n;i++) {
        if (a[(i + idx) % n] <= n && a[(i + idx) % n] != i + 1) return 0;
    }
    sort(a, a + n);
    for (int i = 1;i < n;i++) {
        if (a[i] == a[i - 1]) return 0;
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {

    return -2;
}

int countReplacement(int n, int inputSeq[]) {

    return -3;
}

• 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