제출 #1243564

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1243564		inkvizytor	Gondola (IOI14_gondola)	C++20	100 / 100	53 ms	5192 KiB

gondola

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

#define ll long long

int valid(int n, int inputSeq[])
{
    int p = 0;
    for (int i = 0; i < n; i++) {
        if (inputSeq[i] <= n) {
            p = i-(inputSeq[i]-1);
            if (p < 0) {
                p+=n;
            }
            break;
        }
    }
    map<int, bool> mp;
    for (int i = 0; i < n; i++) {
        if (inputSeq[i] <= n) {
            if ((i-p+n)%n != inputSeq[i]-1) {
                return 0;
            }
        }
        else {
            if (mp[inputSeq[i]]) {
                return 0;
            }
            mp[inputSeq[i]] = 1;
        }
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int p = 0;
    for (int i = 0; i < n; i++) {
        if (gondolaSeq[i] <= n) {
            p = i-(gondolaSeq[i]-1);
            if (p < 0) {
                p+=n;
            }
            break;
        }
    }
    vector<pair<int, int>> x;
    for (int i = 0; i < n; i++) {
        if (gondolaSeq[i] > n) {
            x.push_back({gondolaSeq[i], i});
        }
    }
    sort(x.begin(), x.end());
    int w = n, in = 0;
    for (auto i : x) {
        int k = i.second-p+1;
        if (k <= 0) {
            k += n;
        }
        replacementSeq[in] = k;
        in++;
        w++;
        while (w < i.first) {
            replacementSeq[in] = w;
            in++;
            w++;
        }
    }
    return in;
}

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

const ll M = 1e9+9;

ll pow(ll a, ll b) {
    if (b <= 0) {
        return 1;
    }
    ll x = pow(a, b/2);
    x = (x*x)%M;
    if (b%2) {
        x *= a;
    }
    return x%M;
}

int countReplacement(int n, int inputSeq[])
{
    if (!valid(n, inputSeq)) {
        return 0;
    }
    ll w = 1, l = 0;
    vector<ll> x;
    for (int i = 0; i < n; i++) {
        if (inputSeq[i] > n) {
            x.push_back(inputSeq[i]);
            l++;
        }
    }
    sort(x.begin(), x.end());
    ll p = n;
    if ((int)x.size() == n) {
        w = n;
    }
    for (ll i : x) {
        w *= pow(l, i-p-1);
        w %= M;
        l--;
        p = i;
    }
    return (int)w;
}

• 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: 5 / 5
• Subtask 8: 15 / 15
• Subtask 9: 15 / 15
• Subtask 10: 10 / 10