oj.uz

Submission #578259

# Submission time Handle Problem Language Result Execution time Memory
578259 2022-06-16T09:33:29 Z alirezasamimi100 Gondola (IOI14_gondola) C++17
100 / 100
 62 ms 10032 KB 
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long int;

ll pow(ll x, ll y, ll mod){
    ll ans=1;
    while (y != 0) {
        if (y & 1) ans = ans * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return ans;
}

const int N = 2.5e5 + 10, MOD = 1000000009;

int valid(int n, int inputSeq[])
{
    int ls = -1, cnt = 0;
    map<int, int> mp;
    for(int i = 0; i < n; i++){
        cnt++;
        if(mp[inputSeq[i]]) return 0;
        mp[inputSeq[i]] = 1;
        if(inputSeq[i] <= n){
            if(ls != -1 && (ls + cnt - 1) % n + 1 != inputSeq[i]) return 0;
            ls = inputSeq[i];
            cnt = 0;
        }
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int cyc = 1, mx = 0;
    map<int, int> mp;
    for(int i = 0; i < n; i++){
        mx = max(mx, gondolaSeq[i]);
        if(gondolaSeq[i] <= n){
            cyc = (n + gondolaSeq[i] - i) % n;
        }
    }
    for(int i = 0; i < n; i++){
        mp[gondolaSeq[i]] = (n + i + cyc - 1) % n + 1;
    }
    for(int i = n + 1; i <= mx; i++){
        if(mp[i]) replacementSeq[i - n - 1] = mp[i];
        else{
            replacementSeq[i - n - 1] = mp[mx];
            mp[mx] = i;
        }
    }
    return mx - n;
}

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

int countReplacement(int n, int inputSeq[])
{
    if(!valid(n, inputSeq)) return 0;
    ll ans = 1;
    int k = 0, f = 1;
    vector<int> vec = {n};
    for(int i = 0; i < n; i++){
        if(inputSeq[i] > n) k++, vec.push_back(inputSeq[i]);
        else f = 0;
    }
    if(f) ans = n;
    sort(vec.begin(), vec.end());
    for(int i = 1; i <= k; i++){
        ans = ans * pow(k - i + 1, vec[i] - vec[i - 1] - 1, MOD) % MOD;
    }
    return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory 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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory 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 14 ms 2132 KB Output is correct
7 Correct 7 ms 596 KB Output is correct
8 Correct 24 ms 3892 KB Output is correct
9 Correct 8 ms 1364 KB Output is correct
10 Correct 30 ms 4400 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory 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
6 Correct 12 ms 2132 KB Output is correct
7 Correct 9 ms 596 KB Output is correct
8 Correct 22 ms 3872 KB Output is correct
9 Correct 7 ms 1364 KB Output is correct
10 Correct 28 ms 4524 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 8 ms 556 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory 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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory 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 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 340 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 21 ms 4196 KB Output is correct
12 Correct 22 ms 4808 KB Output is correct
13 Correct 31 ms 4560 KB Output is correct
14 Correct 22 ms 4300 KB Output is correct
15 Correct 59 ms 10032 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory 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

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory 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 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 40 ms 4100 KB Output is correct
10 Correct 30 ms 3284 KB Output is correct
11 Correct 11 ms 1364 KB Output is correct
12 Correct 13 ms 1620 KB Output is correct
13 Correct 3 ms 596 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 40 ms 3980 KB Output is correct
10 Correct 30 ms 3372 KB Output is correct
11 Correct 16 ms 1364 KB Output is correct
12 Correct 14 ms 1628 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 49 ms 5320 KB Output is correct
15 Correct 62 ms 5964 KB Output is correct
16 Correct 10 ms 1364 KB Output is correct
17 Correct 37 ms 4128 KB Output is correct
18 Correct 19 ms 2388 KB Output is correct