oj.uz

답안 #128342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128342 2019-07-10T18:44:08 Z dolphingarlic 곤돌라 (IOI14_gondola) C++14
100 / 100
 38 ms 3360 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#pragma GCC Optimize("O3")
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define MOD 1000000009
typedef long long ll;
using namespace std;

int valid(int n, int inputSeq[]) {
    vector<int> gondolas;
    FOR(i, 0, n) gondolas.push_back(inputSeq[i]);
    sort(gondolas.begin(), gondolas.end());
    FOR(i, 1, n) if (gondolas[i] == gondolas[i - 1]) return 0;

    FOR(i, 0, n) {
        if (inputSeq[i] <= n) {
            FOR(j, 1, n + 1) {
                int k = (i + j - inputSeq[i]) % n;
                while (k < 0) k += n;
                if (inputSeq[k] <= n && inputSeq[k] != j) return 0;
            }
            return 1;
        }
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    vector<pair<int, int>> broken;
    int offset = 0;
    FOR(i, 0, n) {
        if (gondolaSeq[i] > n)
            broken.push_back({gondolaSeq[i], i + 1});
        else
            offset = i - gondolaSeq[i] + 1;
    }
    FOR(i, 0, broken.size()) {
        broken[i].second = (broken[i].second - offset - 1 + n) % n + 1;
    }

    int indx = 0, curr = n;
    sort(broken.begin(), broken.end());
    for (pair<int, int> i : broken) {
        replacementSeq[indx++] = i.second;
        curr++;
        FOR(j, curr, i.first)
        replacementSeq[indx++] = j;
        curr = i.first;
    }

    return indx;
}

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

ll expo(ll x, ll y) {
    ll res = 1;
    x = x % MOD;
    while (y > 0) {
        if (y & 1) res = (res * x) % MOD;
        y = y >> 1;
        x = (x * x) % MOD;
    }
    return res;
}

int countReplacement(int n, int inputSeq[]) {
    if (!valid(n, inputSeq)) return 0;
    // If there are k replaced cars {a, b}, {c, d}, ...
    // Then ans is k^(d - b) * (k - 1)^(f - d) + ...
    vector<ll> broken;
    broken.push_back(0);
    FOR(i, 0, n) {
        if (inputSeq[i] > n)
            broken.push_back((ll) (inputSeq[i] - n));
    }
    sort(broken.begin(), broken.end());
    ll ans = 1;
    FOR(i, 1, broken.size()) {
        ans = (ans * expo(ll(broken.size() - i), (ll)(broken[i] - broken[i - 1] - 1))) % MOD;
    }
    if (broken.size() == n + 1) ans = (ans * (ll)(n)) % MOD;
    return ans;
}

// int gondolas[100000], replacements[100000];

// int main() {
//     int T, n;
//     cin >> T >> n;
//     FOR(i, 0, n) cin >> gondolas[i];
//     if (T < 4) cout << valid(n, gondolas);
//     else if (T < 7) {
//         int k = replacement(n, gondolas, replacements);
//         cout << k << ' ';
//         FOR(i, 0, k) cout << replacements[i] << ' ';
//     }
//     else cout << countReplacement(n, gondolas);
// }

Compilation message

gondola.cpp:3:0: warning: ignoring #pragma GCC Optimize [-Wunknown-pragmas]
 #pragma GCC Optimize("O3")
 
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:4:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(i, x, y) for (int i = x; i < y; i++)
gondola.cpp:39:9:
     FOR(i, 0, broken.size()) {
         ~~~~~~~~~~~~~~~~~~~             
gondola.cpp:39:5: note: in expansion of macro 'FOR'
     FOR(i, 0, broken.size()) {
     ^~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:4:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(i, x, y) for (int i = x; i < y; i++)
gondola.cpp:81:9:
     FOR(i, 1, broken.size()) {
         ~~~~~~~~~~~~~~~~~~~             
gondola.cpp:81:5: note: in expansion of macro 'FOR'
     FOR(i, 1, broken.size()) {
     ^~~
gondola.cpp:84:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (broken.size() == n + 1) ans = (ans * (ll)(n)) % MOD;
         ~~~~~~~~~~~~~~^~~~~~~~

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 376 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 10 ms 888 KB Output is correct
7 Correct 20 ms 1396 KB Output is correct
8 Correct 15 ms 1268 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 21 ms 1268 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 380 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 10 ms 888 KB Output is correct
7 Correct 20 ms 1272 KB Output is correct
8 Correct 15 ms 1268 KB Output is correct
9 Correct 7 ms 632 KB Output is correct
10 Correct 20 ms 1268 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 10 ms 888 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 21 ms 1268 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 256 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 #5
10.0 / 10.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 376 KB Output is correct
4 Correct 2 ms 376 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 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

Subtask #6
20.0 / 20.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
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
11 Correct 12 ms 660 KB Output is correct
12 Correct 13 ms 760 KB Output is correct
13 Correct 17 ms 1448 KB Output is correct
14 Correct 12 ms 632 KB Output is correct
15 Correct 23 ms 2276 KB Output is correct

Subtask #7
5.0 / 5.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

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 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 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 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 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 26 ms 1600 KB Output is correct
10 Correct 21 ms 1316 KB Output is correct
11 Correct 10 ms 784 KB Output is correct
12 Correct 13 ms 764 KB Output is correct
13 Correct 4 ms 504 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 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 3 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 27 ms 1648 KB Output is correct
10 Correct 23 ms 1272 KB Output is correct
11 Correct 10 ms 788 KB Output is correct
12 Correct 12 ms 944 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 34 ms 2944 KB Output is correct
15 Correct 38 ms 3360 KB Output is correct
16 Correct 8 ms 932 KB Output is correct
17 Correct 25 ms 1900 KB Output is correct
18 Correct 15 ms 1656 KB Output is correct