oj.uz

답안 #247433

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
247433 2020-07-11T11:20:52 Z Artyom123 곤돌라 (IOI14_gondola) C++14
70 / 100
 80 ms 5496 KB 
#include <bits/stdc++.h>
#include <gondola.h>
using namespace std;

#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define pb emplace_back
#define ll long long
#define ld long double

const int INF = 2e9 + 1;
const ll INFLL = 1e18 + 1;
const int mod = 1e9 + 9;

int valid(int n, int inputSeq[]) {
    vector<int> a(n);
    set<int> lol;
    for (int i = 0; i < n; i++) {
        a[i] = inputSeq[i];
        lol.insert(a[i]);
    }
    if ((int)lol.size() != n) return 0;
    int ind = -1;
    for (int i = 0; i < n; i++) {
        if (a[i] <= n) ind = i;
    }
    if (ind == -1) return 1;
    int now = a[ind];
    for (int i = 0; i < n; i++) {
        if (a[ind] <= n && a[ind] != now) return 0;
        ind++;
        if (ind >= n) ind -= n;
        now++;
        if (now > n) now = 1;
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    vector<int> a(n);
    for (int i = 0; i < n; i++) a[i] = gondolaSeq[i];
    vector<int> lol;
    int ind = -1;
    for (int i = 0; i < n; i++) {
        if (a[i] > n) lol.pb(a[i]);
        else ind = i;
    }
    vector<int> ans;
    sort(all(lol));
    map<int, int> ma;
    if (ind == -1) {
        for (int i = 1; i <= n; i++) {
            ma[a[i]] = i;
        }
    } else {
        int now = a[ind];
        for (int i = 0; i < n; i++) {
            if (a[ind] > n) {
                ma[a[ind]] = now;
            }
            now++;
            if (now > n) now = 1;
            ind++;
            if (ind >= n) ind -= n;
        }
    }
    int last = n;
    for (auto &c : lol) {
        while (last + 1 <= c) {
            assert(ma[c] > 0);
            ans.pb(ma[c]);
            ma[c] = last + 1;
            last++;
        }
    }
    int len = ans.size();
    for (int i = 0; i < len; i++) replacementSeq[i] = ans[i];
    /*
    cout << len << endl;
    for (auto &c : ans) cout << c << " ";
    */
    return len;
}

ll my_pow(ll n, ll m) {
    if (m == 0) return 1;
    ll now = my_pow(n, m / 2);
    if (m % 2 == 0) return (now * now) % mod;
    return (((now * now) % mod) * n) % mod;
}

int countReplacement(int n, int inputSeq[]) {
    if (!valid(n, inputSeq)) return 0;
    vector<int> a(n);
    bool f = false, is_fixed = false;
    vector<int> lol;
    ll cnt = n;
    for (int i = 0; i < n; i++) {
        a[i] = inputSeq[i];
        if (a[i] > n) {
            f = true;
            lol.pb(a[i]);
        }
        if (a[i] <= n) {
            is_fixed = true;
            cnt--;
        }
    }
    if (!f) return 1;
    sort(all(lol));
    ll last = n;
    ll ans = 1;
    for (int i = 0; i < (int)lol.size(); i++) {
        ans *= my_pow(cnt, lol[i] - last - 1);
        ans %= mod;
        last = lol[i];
        cnt--;
    }
    if (!is_fixed) {
        ans *= n;
        ans %= mod;
    }
    return ans;
}

/*
int main() {
    int n;
    cin >> n;
    int a[n], b[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    replacement(n, a, b);
    return 0;
}
*/

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 22 ms 2304 KB Output is correct
7 Correct 35 ms 4088 KB Output is correct
8 Correct 30 ms 4224 KB Output is correct
9 Correct 12 ms 1536 KB Output is correct
10 Correct 31 ms 4864 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 256 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 23 ms 2432 KB Output is correct
7 Correct 40 ms 3960 KB Output is correct
8 Correct 38 ms 4216 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 33 ms 4864 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 21 ms 2304 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 48 ms 4984 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Runtime error 5 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Runtime error 5 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Halted 0 ms 0 KB -

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 44 ms 4344 KB Output is correct
10 Correct 36 ms 3704 KB Output is correct
11 Correct 16 ms 1536 KB Output is correct
12 Correct 19 ms 1792 KB Output is correct
13 Correct 7 ms 640 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 256 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 45 ms 4344 KB Output is correct
10 Correct 40 ms 3712 KB Output is correct
11 Correct 16 ms 1536 KB Output is correct
12 Correct 19 ms 1792 KB Output is correct
13 Correct 7 ms 768 KB Output is correct
14 Correct 57 ms 4984 KB Output is correct
15 Correct 80 ms 5496 KB Output is correct
16 Correct 14 ms 1280 KB Output is correct
17 Correct 42 ms 3840 KB Output is correct
18 Correct 26 ms 2276 KB Output is correct