Submission #1268918

#	Time	Username	Problem	Language	Result	Execution time	Memory
1268918		kawhiet	Gondola (IOI14_gondola)	C++20	25 / 100	6 ms	1096 KiB

gondola

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

int valid(int n, int inputSeq[]) {
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        a[i] = inputSeq[i];
        a[i] %= n;
        if (a[i] == 0) {
            a[i] = n;
        }
    }
    for (int i = 1; i < n; i++) {
        if (a[i] % n != (a[i - 1] + 1) % n) {
            return 0;
        }
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    vector<pair<int, int>> a(n);
    vector<int> b(n);
    for (int i = 0; i < n; i++) {
        a[i] = {gondolaSeq[i], i};
        b[i] = gondolaSeq[i] % n;
        if (b[i] == 0) {
            b[i] = n;
        }
    }
    vector<int> val(n);
    iota(val.begin(), val.end(), 1);
    for (int i = 0; i < n; i++) {
        if (b[i] <= n) {
            val[i] = b[i];
            for (int j = i - 1; j >= 0; j--) {
                val[j] = val[j + 1] - 1;
                if (val[j] == 0) {
                    val[j] = n;
                }
            }
            for (int j = i + 1; j < n; j++) {
                val[j] = val[j - 1] + 1;
                if (val[j] == n + 1) {
                    val[j] = 1;
                }
            }
        }
        break;
    }
    sort(a.begin(), a.end());
    int x = n, j = 0;
    for (auto [k, i] : a) {
        while (k > x) {
            x++;
            replacementSeq[j++] = val[i];
            val[i] += x;
        }
    }
    return x - n;
}

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

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