Submission #385824

#	Time	Username	Problem	Language	Result	Execution time	Memory
385824		ParsaAlizadeh	Gondola (IOI14_gondola)	C++17	20 / 100	14 ms	1132 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;

int const N = 2.5e5 + 10;

int valid(int n, int inputSeq[]) {
    int st = -1;
    vector<bool> mark(N, false);
    for (int i = 0; i < n; i++) {
        if (inputSeq[i] <= n) {
            if (st == -1)
                st = (inputSeq[i] - 1) - i + n;
            else if (inputSeq[i] - 1 != (st + i) % n)
                return 0;
        }
        if (mark[inputSeq[i]])
            return 0;
        mark[inputSeq[i]] = true;
    }
    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