Submission #773541

#	Time	Username	Problem	Language	Result	Execution time	Memory
773541		loctildore	Gondola (IOI14_gondola)	C++14	55 / 100	14 ms	2196 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
// trans rights
#define ll long long
#define f first
#define s second
#define endl '\n'
#define all(x) begin(x), end(x)

int valid(int n, int inputSeq[])
{
    int tmp = -1;
    set<int> st;
    for (int i = 0; i < n; i++) {
        if (inputSeq[i] <= n) {
            int cur = (inputSeq[i] - i + n) % n;
            if (tmp == -1) tmp = cur;
            if (tmp != cur) return 0;
        }
        else {
            if (st.find(inputSeq[i]) != st.end()) return 0;
            st.insert(inputSeq[i]);
        }
    }
    return 1;
}

//----------------------

int ori[100069];
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int offst = 1;
    pair<int,int> maxi = {0, -1};
    for (int i = 0; i < n; i++) {
        if (gondolaSeq[i] <= n) {
            offst = gondolaSeq[i] - i;
        }
        maxi = max(maxi, {gondolaSeq[i], i});
    }
    for (int i = 0; i < n; i++) {
        ori[i] = (i + offst + n) % n;
        if (ori[i] == 0) ori[i] = n;
    }
    int l = maxi.f - n;
    for (int i = 0; i < l; i++) {
        replacementSeq[i] = -1;
    }
    for (int i = 0; i < n; i++) {
        if (gondolaSeq[i] > n && gondolaSeq[i] != maxi.f) {
            replacementSeq[gondolaSeq[i] - n - 1] = ori[i];
        }
    }
    int cur = ori[maxi.s];
    for (int i = 0; i < l; i++) {
        if (~replacementSeq[i]) continue;
        replacementSeq[i] = cur;
        cur = i + n + 1;
    }
    return l;
}

//----------------------

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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10