oj.uz

Submission #801270

# Submission time Handle Problem Language Result Execution time Memory
801270 2023-08-02T05:18:41 Z jlallas384 Gondola (IOI14_gondola) C++17
100 / 100
 46 ms 6024 KB 
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
using ll = long long;
const int mod = 1e9 + 9;
int valid(int n, int inputSeq[]){
    set<int> used;
    int idx = 0;
    for(int i = 0; i < n; i++){
        if(used.count(inputSeq[i])) return 0;
        used.insert(inputSeq[i]);
        if(inputSeq[i] <= n){
            idx = i;
        }
    }
    int nd = inputSeq[idx];
    for(int i = 0; i < n; i++){
        int j = (idx + i) % n;
        if(inputSeq[j] <= n && inputSeq[j] != nd) return 0;
        nd++;
        if(nd > n) nd = 1;
    }
    return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    int idx = -1;
    for(int i = 0; i < n; i++){
        if(gondolaSeq[i] <= n){
            idx = i;
            break;
        }
    }
    vector<int> st(n);
    int nd = (idx == -1 ? 1 : gondolaSeq[idx]);
    if(idx == -1) idx = 0;
    for(int i = 0; i < n; i++){
        st[(idx + i) % n] = nd++;
        if(nd > n) nd = 1;
    }
    vector<pair<int,int>> srt;
    for(int i = 0; i < n; i++){
        if(gondolaSeq[i] > n) srt.emplace_back(gondolaSeq[i], i);
    }
    sort(srt.begin(), srt.end());
    int l = 0;
    int c = n + 1;
    for(auto [v, i]: srt){
        replacementSeq[l++] = st[i];
        while(c < v){
            replacementSeq[l++] = c++;
        }
        c++;
    }
    return l;
}


ll pwr(int x, int y){
    ll res = 1;
    while(y){
        if(y % 2) res = res * x % mod;
        x = (ll) x * x % mod;
        y /= 2;
    }
    return res;
}

int countReplacement(int n, int inputSeq[]){
    if(!valid(n, inputSeq)) return 0;
    vector<int> a;
    for(int i = 0; i < n; i++){
        if(inputSeq[i] > n) a.push_back(inputSeq[i]);
    }
    sort(a.begin(), a.end());
    ll ans = 1;
    int prv = n;
    for(int i = 0; i < a.size(); i++){
        ans = (ans * pwr((int) a.size() - i, a[i] - prv - 1)) % mod;
        prv = a[i];
    }
    if(a.size() == n){
        ans = ans * n % mod;
    }
    return ans;
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:78:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for(int i = 0; i < a.size(); i++){
      |                    ~~^~~~~~~~~~
gondola.cpp:82:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   82 |     if(a.size() == n){
      |        ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 212 KB Output is correct
6 Correct 14 ms 2368 KB Output is correct
7 Correct 11 ms 1140 KB Output is correct
8 Correct 20 ms 4308 KB Output is correct
9 Correct 7 ms 1472 KB Output is correct
10 Correct 27 ms 4948 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 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 12 ms 2388 KB Output is correct
7 Correct 11 ms 1108 KB Output is correct
8 Correct 25 ms 4336 KB Output is correct
9 Correct 6 ms 1492 KB Output is correct
10 Correct 29 ms 5000 KB Output is correct
11 Correct 1 ms 308 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 13 ms 2276 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 33 ms 5068 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory 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 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 0 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 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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory 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 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 308 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 304 KB Output is correct
11 Correct 7 ms 1332 KB Output is correct
12 Correct 10 ms 1472 KB Output is correct
13 Correct 11 ms 1488 KB Output is correct
14 Correct 7 ms 1364 KB Output is correct
15 Correct 16 ms 2380 KB Output is correct

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

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 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 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 1 ms 212 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 0 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 35 ms 4472 KB Output is correct
10 Correct 25 ms 3668 KB Output is correct
11 Correct 11 ms 1572 KB Output is correct
12 Correct 13 ms 1852 KB Output is correct
13 Correct 3 ms 576 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 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 36 ms 4476 KB Output is correct
10 Correct 27 ms 3756 KB Output is correct
11 Correct 11 ms 1492 KB Output is correct
12 Correct 11 ms 1748 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 38 ms 5308 KB Output is correct
15 Correct 46 ms 6024 KB Output is correct
16 Correct 7 ms 1364 KB Output is correct
17 Correct 28 ms 4156 KB Output is correct
18 Correct 15 ms 2472 KB Output is correct