oj.uz

답안 #166814

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
166814 2019-12-04T07:41:23 Z tri 곤돌라 (IOI14_gondola) C++14
100 / 100
 93 ms 6008 KB 
#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

namespace debug {
    const int DEBUG = true;

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x);

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x);

    template<class T>
    void pr(const vector<T> &x);

    template<class T>
    void pr(const set<T> &x);

    template<class T1, class T2>
    void pr(const map<T1, T2> &x);

    template<class T>
    void pr(const T &x) { if (DEBUG) cout << x; }

    template<class T, class... Ts>
    void pr(const T &first, const Ts &... rest) { pr(first), pr(rest...); }

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x) { pr("{", x.f, ", ", x.s, "}"); }

    template<class T>
    void prIn(const T &x) {
        pr("{");
        bool fst = 1;
        for (auto &a : x) {
            pr(fst ? "" : ", ", a), fst = 0;
        }
        pr("}");
    }

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x) { prIn(x); }

    template<class T>
    void pr(const vector<T> &x) { prIn(x); }

    template<class T>
    void pr(const set<T> &x) { prIn(x); }

    template<class T1, class T2>
    void pr(const map<T1, T2> &x) { prIn(x); }

    void ps() { pr("\n"), cout << flush; }

    template<class Arg, class... Args>
    void ps(const Arg &first, const Args &... rest) {
        pr(first, " ");
        ps(rest...);
    }
}
using namespace debug;

int valid(int N, int a[]) {
    set<int> seen;

    int off = -1;

    for (int i = 0; i < N; i++) {
        if (seen.count(a[i])) {
            return false;
        }
        seen.insert(a[i]);

        if (a[i] <= N) {
            int nOff = (N + i - (a[i] - 1)) % N;
            if (off == -1) {
                off = nOff;
            } else {
                if (off != nOff) {
                    return false;
                }
            }
        }
    }
    return true;
}

int replacement(int N, int a[], int rep[]) {

    int off = 0;
    for (int i = 0; i < N; i++) {
        if (a[i] <= N) {
            off = (N + i - (a[i] - 1)) % N;
        }
    }
//    ps(off);

    vi mod(a, a + N);

    for (int i = 0; i < N; i++) {
        if (mod[i] > N) {
            mod[i] = (i + 1 + N - off) % N;
            if (mod[i] == 0) {
                mod[i] = N;
            }
        }
    }

//    ps(mod);

    vector<pi> ord;

    for (int i = 0; i < N; i++) {
        if (a[i] > N) {
            ord.pb({a[i], i});
        }
    }

    sort(ord.begin(), ord.end());

    int nxt = N + 1;
    int L = 0;

    for (pi cur : ord) {
        while (nxt <= cur.f) {
            rep[L++] = mod[cur.s];
            mod[cur.s] = nxt++;
        }
    }

    return L;
}

const ll MOD = 1e9 + 9;

ll binExp(ll b, ll p) {
//    ps(b, p);
    b %= MOD;
    ll c = 1;
    while (p > 0) {
        if (p & 1) {
            c = c * b % MOD;
        }
        b = b * b % MOD;
        p >>= 1;
    }
    return c;
}

int countReplacement(int N, int a[]) {
    if (!valid(N, a)) {
        return 0;
    }

    int fixed = 0;

    vi free;
    for (int i = 0; i < N; i++) {
        if (a[i] <= N) {
            fixed++;
        } else {
            free.pb(a[i]);
        }
    }
//    ps(fixed);
//    ps(free);

    sort(free.begin(), free.end());

    int nxt = N + 1;

    ll cnt = 1;

    for (int i = 0; i < free.size(); i++) {
        cnt = cnt * binExp(N - fixed - i, free[i] - nxt) % MOD;
        nxt = free[i] + 1;
    }

    if (fixed == 0) {
        cnt = cnt * N % MOD;
    }

    return cnt;
}

//int main() {
//    int inp[] = {3, 4};
//    ps(countReplacement(2, inp));
//}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:189:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < free.size(); i++) {
                     ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 19 ms 2168 KB Output is correct
7 Correct 13 ms 632 KB Output is correct
8 Correct 35 ms 3960 KB Output is correct
9 Correct 11 ms 1528 KB Output is correct
10 Correct 45 ms 4600 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 20 ms 2296 KB Output is correct
7 Correct 26 ms 632 KB Output is correct
8 Correct 36 ms 3960 KB Output is correct
9 Correct 11 ms 1528 KB Output is correct
10 Correct 49 ms 4600 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 7 ms 504 KB Output is correct
14 Correct 10 ms 376 KB Output is correct
15 Correct 14 ms 632 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 296 KB Output is correct
6 Correct 2 ms 420 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 12 ms 892 KB Output is correct
12 Correct 13 ms 1148 KB Output is correct
13 Correct 18 ms 1268 KB Output is correct
14 Correct 13 ms 892 KB Output is correct
15 Correct 24 ms 2376 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 60 ms 4472 KB Output is correct
10 Correct 47 ms 3832 KB Output is correct
11 Correct 18 ms 1528 KB Output is correct
12 Correct 21 ms 1912 KB Output is correct
13 Correct 6 ms 632 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 63 ms 4624 KB Output is correct
10 Correct 46 ms 3796 KB Output is correct
11 Correct 58 ms 1528 KB Output is correct
12 Correct 21 ms 1912 KB Output is correct
13 Correct 6 ms 632 KB Output is correct
14 Correct 73 ms 5340 KB Output is correct
15 Correct 93 ms 6008 KB Output is correct
16 Correct 14 ms 1400 KB Output is correct
17 Correct 59 ms 4316 KB Output is correct
18 Correct 89 ms 2424 KB Output is correct