Submission #1297118

#	Time	Username	Problem	Language	Result	Execution time	Memory
1297118		harryleee	Gondola (IOI14_gondola)	C++20	0 / 100	1 ms	348 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 cnt = 0, pre = 0;
    for (int i = 0; i < n; ++i){
        if (exist[a[i]]) return false;
        exist[a[i]] = true;
    }
    for (int i = 0; i < n; ++i){
        if (a[i] <= n && pre != 0){
            int x1 = a[pre], x2 = a[i];
            if (x1 > x2){
                if (pre + (n - x1) + x2 != i) return 0;
            }
            else if (x1 < x2){
                if (i - pre != x2 - x1) return 0;
            }
            pre = i;
        }
    }
    return true;
}

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

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 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