Submission #623392

#	Time	Username	Problem	Language	Result	Execution time	Memory
623392		yuto1115	Gondola (IOI14_gondola)	C++17	100 / 100	50 ms	5928 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < ll(n); ++i)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); ++i)
#define rrep(i, n) for(ll i = ll(n) - 1; i >= 0; --i)
#define rrep2(i, n, t) for(ll i = ll(n) - 1; i >= ll(t); --i)
#define pb push_back
#define eb emplace_back
#define SZ(a) int(a.size())
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;
const int inf = 1001001001;
const ll linf = 1001001001001001001;

template<class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int valid(int n, int inputSeq[]) {
    int p1 = -1;
    set<int> st;
    rep(i, n) {
        int now = inputSeq[i];
        if (st.count(now)) return 0;
        st.insert(now);
        if (now <= n) {
            int p = (i - (now - 1) + n) % n;
            if (p1 != -1 and p1 != p) return 0;
            p1 = p;
        }
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    int p1 = -1;
    int mx = n, mx_id = -1;
    rep(i, n) {
        int now = gondolaSeq[i];
        if (chmax(mx, now)) mx_id = i;
        if (now <= n) {
            int p = (i - (now - 1) + n) % n;
            assert(p1 == -1 or p1 == p);
            p1 = p;
        }
    }
    if (mx == n) return 0;
    if (p1 == -1) p1 = 0;
    vi pre(mx + 1, -1);
    rep(i, n) {
        if (i == mx_id or gondolaSeq[i] <= n) continue;
        pre[gondolaSeq[i]] = 1 + (i - p1 + n) % n;
    }
    int now = 1 + (mx_id - p1 + n) % n;
    rep2(i, n + 1, mx + 1) {
        if (pre[i] == -1) {
            pre[i] = now;
            now = i;
        }
        replacementSeq[i - (n + 1)] = pre[i];
    }
    return mx - n;
}

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

const int mod = 1000000009;

ll mod_pow(ll a, int t) {
    ll res = 1;
    while (t) {
        if (t & 1) res = (res * a) % mod;
        a = (a * a) % mod;
        t >>= 1;
    }
    return res;
}

int countReplacement(int n, int inputSeq[]) {
    if (!valid(n, inputSeq)) return 0;
    vi v = {n};
    rep(i, n) if (inputSeq[i] > n) v.pb(inputSeq[i]);
    sort(all(v));
    ll res = 1;
    rep2(i, 1, SZ(v)) {
        res *= mod_pow(SZ(v) - i, v[i] - v[i - 1] - 1);
        res %= mod;
    }
    if (SZ(v) > n) res = (res * n) % mod;
    return res;
}

• 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