Submission #584856

#	Time	Username	Problem	Language	Result	Execution time	Memory
584856		Mazaalai	곤돌라 (IOI14_gondola)	C++17	10 / 100	10 ms	1128 KiB

gondola

#include "gondola.h"

int valid(int n, int inputSeq[]) {
    int mini = 0;
    for (int i = 1; i < n; i++) 
        if (inputSeq[i] < inputSeq[mini]) mini = i;
    
    int st = inputSeq[mini];
    for (int i = 1; i < n; i++) {
        int j = (mini + i) % n;
        if (inputSeq[j] > n) continue;
        if (inputSeq[j] <= n && inputSeq[j] != st + i) 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