답안 #590698

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
590698	2022-07-06T08:50:46 Z	proma	곤돌라 (IOI14_gondola)	C++17	100 / 100	25 ms	3288 KB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int MOD = 1e9+9;

int bp(int a, int n) {
    if (!n) return 1;
    if (n % 2) return a * bp(a, n - 1) % MOD;
    int b = bp(a, n / 2);
    return b * b % MOD;
}

int32_t valid(int32_t n, int32_t inputSeq[])
{
    vector <int> a(n);
    int flag = 0;
    for (int i = 0; i < n; i ++) {
        if (inputSeq[i] <= n) {
            a[i] = inputSeq[i];
            for (int j = i + 1; j < n; j ++) {
                a[j] = (a[j-1] + 1) % n;
                if (!a[j]) a[j] = n;
            }
            if (i) {
                a[0] = (a[n-1] + 1) % n;
                if (!a[0]) a[0] = n;
            }
            for (int j = 1; j < i; j ++) {
                a[j] = (a[j-1] + 1) % n;
                if (!a[j]) a[j] = n;
            }
            flag = 1;
            break;
        }
    }
    vector <int> tmp(n);
    for (int i = 0; i < n; i ++) {
        tmp[i] = inputSeq[i];
    }
    sort(tmp.begin(), tmp.end());
    for (int i = 1; i < n; i ++) {
        if (tmp[i] == tmp[i-1]) return 0;
    }

    if (!flag) return 1;
    for (int i = 0; i < n; i ++) {
        if (inputSeq[i] <= n and inputSeq[i] != a[i]) return 0;
    }
    return 1;
}

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

int32_t replacement(int32_t n, int32_t gondolaSeq[], int32_t replacementSeq[])
{
    vector <int> a(n);
    vector <pair <int, int>> p;
    int flag = 0;
    for (int i = 0; i < n; i ++) {
        if (gondolaSeq[i] <= n) {
            a[i] = gondolaSeq[i];
            for (int j = i + 1; j < n; j ++) {
                a[j] = (a[j-1] + 1) % (n + 1);
                a[j] = max(1ll, a[j]);
            }
            if (i) {
                a[0] = (a[n-1] + 1) % (n + 1);
                a[0] = max(1ll, a[0]);
            }
            for (int j = 1; j < i; j ++) {
                a[j] = (a[j-1] + 1) % (n + 1);
                a[j] = max(1ll, a[j]);
            }
            flag = 1;
            break;
        }
    }
    if (!flag) {
        for (int i = 0; i < n; i ++) {
            a[i] = i + 1;
        }
    }

    for (int i = 0; i < n; i ++) {
        if (gondolaSeq[i] > n) p.push_back({gondolaSeq[i], a[i]});
    }
    sort(p.begin(), p.end());
    int last = n + 1, pos = 0;
    for (auto i: p) {
        replacementSeq[pos ++] = i.second;
        while (last < i.first) {
            replacementSeq[pos ++] = last ++;
        }
        last = i.first + 1;
    }
    return pos;
}

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

int32_t countReplacement(int32_t n, int32_t inputSeq[])
{
    if (!valid(n, inputSeq)) return 0;
    int flag = 1;
    vector <int> v;
    int mx = 0;
    for (int i = 0; i < n; i ++) {
        if (inputSeq[i] > n) v.push_back(inputSeq[i]);
        else flag = 0;
        mx = max(mx, 1ll*inputSeq[i]);
    }
    v.push_back(n);
    sort(v.begin(), v.end());
    int m = v.size();
    int ans = 1;
    if (flag) ans = n;
    for (int i = 1; i < m; i ++) {
        ans *= bp(m - i, v[i] - v[i-1] - 1);
        ans %= MOD;
    }/*
    for (int i = n + 1; i < mx; i ++) {
        if (find(v.begin(), v.end(), i) != v.end()) continue;
        int pos = upper_bound(v.begin(), v.end(), i) - v.begin();
        ans *= m - pos;
        ans %= MOD;
    }*/
    return ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	6 ms	980 KB	Output is correct
7	Correct	14 ms	2004 KB	Output is correct
8	Correct	9 ms	1684 KB	Output is correct
9	Correct	4 ms	724 KB	Output is correct
10	Correct	16 ms	1948 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	6 ms	980 KB	Output is correct
7	Correct	14 ms	2032 KB	Output is correct
8	Correct	14 ms	1672 KB	Output is correct
9	Correct	4 ms	724 KB	Output is correct
10	Correct	22 ms	1852 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	6 ms	980 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	14 ms	2004 KB	Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	8 ms	1236 KB	Output is correct
12	Correct	8 ms	1364 KB	Output is correct
13	Correct	12 ms	1484 KB	Output is correct
14	Correct	7 ms	1116 KB	Output is correct
15	Correct	17 ms	2204 KB	Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	312 KB	Output is correct
9	Correct	19 ms	2272 KB	Output is correct
10	Correct	15 ms	1792 KB	Output is correct
11	Correct	6 ms	940 KB	Output is correct
12	Correct	7 ms	1044 KB	Output is correct
13	Correct	2 ms	468 KB	Output is correct

Subtask #10
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	19 ms	2132 KB	Output is correct
10	Correct	15 ms	1876 KB	Output is correct
11	Correct	8 ms	884 KB	Output is correct
12	Correct	8 ms	1020 KB	Output is correct
13	Correct	2 ms	492 KB	Output is correct
14	Correct	25 ms	3112 KB	Output is correct
15	Correct	25 ms	3288 KB	Output is correct
16	Correct	5 ms	956 KB	Output is correct
17	Correct	17 ms	2148 KB	Output is correct
18	Correct	10 ms	1560 KB	Output is correct

답안 #590698

Compilation message