Submission #1325305

#	Time	Username	Problem	Language	Result	Execution time	Memory
1325305		kasamchi	곤돌라 (IOI14_gondola)	C++20	20 / 100	17 ms	568 KiB

gondola

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

int valid(int n, int inputSeq[]) {
    for (int i = 0; i < n; i++) {
        inputSeq[i]--;
    }

    int beg = -1;
    for (int i = 0; i < n; i++) {
        if (inputSeq[i] < n) {
            beg = (inputSeq[i] - i + n) % n;
        }
    }
    
    if (beg != -1) {
        for (int i = 0; i < n; i++) {
            if (inputSeq[i] < n) {
                if (inputSeq[i] != (beg + i) % n) {
                    return 0;
                }
            }
        }
    }

    sort(inputSeq, inputSeq + n);
    if (unique(inputSeq, inputSeq + n) - inputSeq != n) {
        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: 10 / 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