제출 #1007226

#제출 시각아이디문제언어결과실행 시간메모리
1007226The_Samurai곤돌라 (IOI14_gondola)C++17
15 / 100
6 ms1204 KiB
#include "gondola.h"
#include "bits/stdc++.h"
using namespace std;

int valid(int n, int a[]) {
    int last = -1;
    for (int i = 0; i < n; i++) a[i]--;
    for (int i = 0; i < 2 * n; i++) {
        if (a[i % n] > n) continue;
        if (last != -1 and (a[last % n] + i - last) % n != a[i % n]) return 0;
        last = i;
    }
    return 1;
}

//----------------------

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

//----------------------

int countReplacement(int n, int inputSeq[]) {
    return 1;
}
#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...