Submission #1147978

#	Time	Username	Problem	Language	Result	Execution time	Memory
1147978		efishel	Gondola (IOI14_gondola)	C++20	20 / 100	11 ms	2120 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using ii = pair <ll, ll>;
using vii = vector <ii>;

int valid (int n, int inputSeq[]) {
    vll ve(inputSeq, inputSeq+n);
    {vll th = ve;
    sort(th.begin(), th.end());
    if (unique(th.begin(), th.end()) != th.end()) return 0;} // repeated element
    if (*min_element(ve.begin(), ve.end()) > n) return 1;
    ll j = min_element(ve.begin(), ve.end()) - ve.begin();
    ll exp = (ve[j]-j + n)%n;
    for (ll i = 0; i < n; i++) {
        if (ve[i] > n) continue;
        if ((ve[i]-i + n)%n == exp) continue;
        return 0;
    }
    return 1;
}

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

int countReplacement (int n, int inputSeq[]) {
    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