제출 #1325299

#제출 시각아이디문제언어결과실행 시간메모리
1325299kasamchi곤돌라 (IOI14_gondola)C++20
10 / 100
5 ms624 KiB
#include "gondola.h"

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) {
        return 1;
    }

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    return -2;
}

int countReplacement(int n, int inputSeq[]) {
    return -3;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...