Submission #1268876

#TimeUsernameProblemLanguageResultExecution timeMemory
1268876kawhietGondola (IOI14_gondola)C++20
20 / 100
6 ms1096 KiB
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;

int valid(int n, int inputSeq[]) {
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        a[i] = inputSeq[i];
        a[i] %= n;
        if (a[i] == 0) {
            a[i] = n;
        }
    }
    for (int i = 1; i < n; i++) {
        if (a[i] % n != (a[i - 1] + 1) % n) {
            return 0;
        }
    }
    return 1;
}

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

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