Submission #1290376

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

int valid(int n, int inputSeq[]) {
    int ind = -1;
    for (int i = 0; i < n; i++) {
        if (inputSeq[i] == 1) {
            ind = i;
            break;
        }
    }
    if (ind == -1) return 0;

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

int replacement(int n, int inputSeq[], 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...