Submission #1197373

#	Time	Username	Problem	Language	Result	Execution time	Memory
1197373		AMel0n	곤돌라 (IOI14_gondola)	C++20	20 / 100	10 ms	3924 KiB

gondola

// fixing sub 3
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define FOR(i,N) for(ll i = 0; i < N; i++)
#define all(x) (x).begin(), (x).end()
#define F first 
#define S seconds


#include "gondola.h"

int valid(int n, int seq[]) {
    int pr = INT_MIN, pri = INT_MIN;
    unordered_set<int> seen;
    FOR(i,n) {
        if (seen.find(seq[i]) != seen.end()) return 0;
        seen.insert(seq[i]);
        if (seq[i] <= n) {
            if (pr != INT_MIN) {
                if (pr <= seq[i]) {
                    if (seq[i] - pr != i-pri) return 0;
                } else {
                    if (n-pr+seq[i] != i-pri) return 0;
                }
            }
            pr = seq[i];
            pri = i;
        }
    }
    return 1;
}


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



int countReplacement(int n, int seq[]) {
    return -3;
}

• 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