Submission #1297121

#	Time	Username	Problem	Language	Result	Execution time	Memory
1297121		harryleee	Gondola (IOI14_gondola)	C++20	20 / 100	6 ms	1352 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
bool exist[25000];

int valid(int n, int a[]){
    memset(exist, false, sizeof(exist));
    int app = -1;
    for (int i = 0; i < n; ++i){
        if (exist[a[i]]) return false;
        exist[a[i]] = true;
        if (a[i] <= n && app == -1) app = i;
    }
    if (app == -1) return 1;
    for (int i = app + 1; i < n; ++i){
        if (a[i] <= n){
            if (a[i] == 1 && a[i - 1] != n) return 0;
            if (a[i] != 1 && a[i - 1] + 1 != a[i]) return 0;
        }
        else a[i] = a[i - 1] + 1;
    }
    return 1;
}

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

int countReplacement(int n, int inputSeq[]){
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10