Submission #508811

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
508811	2022-01-13T20:11:31 Z	aryan12	Gondola (IOI14_gondola)	C++17	100 / 100	52 ms	8132 KB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]) {
    int newSeq[n + 1];
    for(int i = 1; i <= n; i++) {
        newSeq[i] = inputSeq[i - 1];
    }
    for(int i = 0; i < n; i++) {
        if(inputSeq[i] >= 1 && inputSeq[i] <= n) {
            newSeq[inputSeq[i]] = inputSeq[i];
            int pos = i;
            for(int j = inputSeq[i] + 1; j <= n; j++) {
                pos++;
                if(pos == n) {
                    pos = 0;
                }
                newSeq[j] = inputSeq[pos];
            }
            for(int j = 1; j <= inputSeq[i] - 1; j++) {
                pos++;
                if(pos == n) {
                    pos = 0;
                }
                newSeq[j] = inputSeq[pos];
            }
            break;
        }
    }
    map<int, int> mp;
    for(int i = 1; i <= n; i++) {
        if(mp.count(newSeq[i])) {
            return 0;
        }
        mp[newSeq[i]] = 1;
        if(newSeq[i] >= 1 && newSeq[i] <= n && newSeq[i] != i) {
            return 0;
        }
    }
    return 1;
}

int replacement(int n, int inputSeq[], int replacementSeq[]) {
    int newSeq[n + 1];
    for(int i = 1; i <= n; i++) {
        newSeq[i] = inputSeq[i - 1];
    }
    for(int i = 0; i < n; i++) {
        if(inputSeq[i] >= 1 && inputSeq[i] <= n) {
            newSeq[inputSeq[i]] = inputSeq[i];
            int pos = i;
            for(int j = inputSeq[i] + 1; j <= n; j++) {
                pos++;
                if(pos == n) {
                    pos = 0;
                }
                newSeq[j] = inputSeq[pos];
            }
            for(int j = 1; j <= inputSeq[i] - 1; j++) {
                pos++;
                if(pos == n) {
                    pos = 0;
                }
                newSeq[j] = inputSeq[pos];
            }
            break;
        }
    }
    int maxvalue = 0, pos = 0, anspos = 0;
    map<int, int> op;
    for(int i = 1; i <= n; i++) {
        op[newSeq[i]] = i;
        maxvalue = max(maxvalue, newSeq[i]);
        if(newSeq[i] == maxvalue) {
            pos = i;
        }
        newSeq[i] = i;
    }
    for(int i = n + 1; i <= maxvalue; i++) {
        if(op.count(i)) {
            replacementSeq[anspos++] = newSeq[op[i]];
            newSeq[op[i]] = i;
        }
        else {
            replacementSeq[anspos++] = newSeq[pos];
            newSeq[pos] = i;
        }
    }
    return anspos;
}

const long long MOD = 1e9 + 9;

long long power(long long a, long long b) {
    if(b == 0) {
        return 1;
    }
    if(b == 1) {
        return a;
    }
    long long x = power(a, b / 2);
    x *= x;
    x %= MOD;
    if(b & 1) {
        x *= a;
        x %= MOD;
    }
    return x;
}

int countReplacement(int n, int inputSeq[]) {
    long long newSeq[n + 1];
    for(long long i = 1; i <= n; i++) {
        newSeq[i] = inputSeq[i - 1];
    }
    for(long long i = 0; i < n; i++) {
        if(inputSeq[i] >= 1 && inputSeq[i] <= n) {
            newSeq[inputSeq[i]] = inputSeq[i];
            long long pos = i;
            for(long long j = inputSeq[i] + 1; j <= n; j++) {
                pos++;
                if(pos == n) {
                    pos = 0;
                }
                newSeq[j] = inputSeq[pos];
            }
            for(long long j = 1; j <= inputSeq[i] - 1; j++) {
                pos++;
                if(pos == n) {
                    pos = 0;
                }
                newSeq[j] = inputSeq[pos];
            }
            break;
        }
    }
    map<long long, long long> mp;
    long long maxx = 0, uwu = n;
    for(long long i = 1; i <= n; i++) {
        if(mp.count(newSeq[i])) {
            return 0;
        }
        mp[newSeq[i]] = i;
        maxx = max(maxx, newSeq[i]);
        if(newSeq[i] >= 1 && newSeq[i] <= n) {
            uwu--;
        }
        if(newSeq[i] >= 1 && newSeq[i] <= n && newSeq[i] != i) {
            return 0;
        }
    }
    long long ans = 1, prev_idx = n;
    for(auto i: mp) {
        if(i.first <= n) continue;
        long long cur_idx = i.first;   
        long long cur_ans = power(uwu, (cur_idx - prev_idx - 1));
        //cout << "cur_ans = " << cur_ans << "\n";
        if(cur_ans != 0) {
            cur_ans %= MOD;
            ans *= cur_ans;
            ans %= MOD;
        }
        uwu--;
        prev_idx = cur_idx;
    }
    /*for(long long i = n + 1; i <= maxx; i++) {
        if(mp.count(i)) {
            uwu--;
        }
        else {
            ans *= uwu;
            ans %= MOD;
        }
    }*/
    uwu = n;
    for(long long i = 1; i <= n; i++) {
        if(newSeq[i] >= 1 && newSeq[i] <= n) {
            uwu--;
        }
    }
    if(uwu == n) ans *= uwu;
    ans %= MOD;
    return ans;
}

Subtask #1
5.0 / 5.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	204 KB	Output is correct
5	Correct	204 KB	Output is correct

Subtask #2
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	11 ms	2252 KB	Output is correct
7	Correct	8 ms	972 KB	Output is correct
8	Correct	25 ms	4148 KB	Output is correct
9	Correct	8 ms	1484 KB	Output is correct
10	Correct	29 ms	4812 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	12 ms	2252 KB	Output is correct
7	Correct	7 ms	972 KB	Output is correct
8	Correct	24 ms	4144 KB	Output is correct
9	Correct	7 ms	1484 KB	Output is correct
10	Correct	29 ms	4804 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	3 ms	460 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	8 ms	972 KB	Output is correct

Subtask #4
5.0 / 5.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	204 KB	Output is correct
5	Correct	204 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct

Subtask #6
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	19 ms	4556 KB	Output is correct
12	Correct	25 ms	5096 KB	Output is correct
13	Correct	26 ms	2916 KB	Output is correct
14	Correct	19 ms	4556 KB	Output is correct
15	Correct	25 ms	2892 KB	Output is correct

Subtask #7
5.0 / 5.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct

Subtask #8
15.0 / 15.0

#	Verdict	Memory	Grader output
1	Correct	204 KB	Output is correct
2	Correct	204 KB	Output is correct
3	Correct	204 KB	Output is correct
4	Correct	204 KB	Output is correct
5	Correct	204 KB	Output is correct
6	Correct	204 KB	Output is correct
7	Correct	204 KB	Output is correct
8	Correct	204 KB	Output is correct

Subtask #9
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	36 ms	5716 KB	Output is correct
10	Correct	32 ms	4800 KB	Output is correct
11	Correct	10 ms	1868 KB	Output is correct
12	Correct	13 ms	2312 KB	Output is correct
13	Correct	3 ms	716 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	240 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	38 ms	5700 KB	Output is correct
10	Correct	31 ms	4744 KB	Output is correct
11	Correct	10 ms	1868 KB	Output is correct
12	Correct	13 ms	2324 KB	Output is correct
13	Correct	3 ms	716 KB	Output is correct
14	Correct	45 ms	6480 KB	Output is correct
15	Correct	52 ms	8132 KB	Output is correct
16	Correct	11 ms	1740 KB	Output is correct
17	Correct	32 ms	5572 KB	Output is correct
18	Correct	17 ms	3240 KB	Output is correct

Submission #508811

Compilation message