Submission #1340818

#TimeUsernameProblemLanguageResultExecution timeMemory
1340818sallyGondola (IOI14_gondola)C++20
10 / 100
6 ms580 KiB
#include<iostream>
#include<vector>
#include "gondola.h"
using namespace std;


int valid(int N, int seq[]) {
    int flag = 1;
    int diff;
    for(int i=0; i<N; i++) {
        if(seq[i] <= N) {
            diff = seq[i] - i; // val = index + diff
            break;
        }
    }
    for(int i=0; i<N; i++) {
        if(seq[i]>N) continue;
        if(seq[i] != (i + diff + N-1) % N + 1) {
            flag = 0;
            break;
        }
    }
    return flag;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    return -1;
}
int countReplacement(int n, int inputSeq[]) {
    return -1;
}


// int main() {
//     int seq[7] = {7, 1, 2, 3, 4, 5, 6};
//     cout<<valid(7, seq);
// }
#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...