oj.uz

Submission #856853

# Submission time Handle Problem Language Result Execution time Memory
856853 2023-10-04T17:40:09 Z ntkphong Gondola (IOI14_gondola) C++14
45 / 100
 12 ms 1116 KB 
#include <bits/stdc++.h>
using namespace std;
#include "gondola.h"

vector<int> bld(int n, int k, int gondolaSeq[]) {
    vector<int> seq;
    seq.push_back(gondolaSeq[k]);
        
    for(int i = 1; i <= n - gondolaSeq[k]; i ++) {
        int j = (k + i) % n;
        seq.push_back(gondolaSeq[j]);
    }
        
    reverse(seq.begin(), seq.end());
        
    for(int i = 1; i <= gondolaSeq[k] - 1; i ++) {
        int j = (k - i + n) % n;
        seq.push_back(gondolaSeq[j]);
    }
        
    reverse(seq.begin(), seq.end());
    return seq;    
}

int valid(int n, int inputSeq[]) {
    
    int k = 0;
    for(int i = 0; i < n; i ++) {
        if(inputSeq[k] > inputSeq[i]) {
            k = i;
        }        
    }
    
    if(inputSeq[k] <= n) {
        for(int i = 1; i <= n - inputSeq[k]; i ++) {
            int j = (k + i) % n;
            if(inputSeq[j] <= n && inputSeq[j] != inputSeq[k] + i) {
                return 0;
            }
        }
            
        for(int i = 1; i <= inputSeq[k] - 1; i ++) {
            int j = (k - i + n) % n;
            if(inputSeq[j] <= n && inputSeq[j] != inputSeq[k] - i) {
                return 0;
            }
        }
    }
    
    sort(inputSeq, inputSeq + n);
    
    for(int i = 0; i + 1 < n; i ++) {
        if(inputSeq[i] == inputSeq[i + 1]) {
            return 0;
        }
    }
    
    return 1;
}

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

struct DSU {    
    vector<int> par;
    
    void init(int n) {
        par.resize(n + 10);
        for(int i = 1; i <= n; i ++) par[i] = i;
    }
    
    int get_root(int x) {
        return par[x] == x ? x : par[x] = get_root(par[x]);
    }
    
    void unite(int u, int v) {
        u = get_root(u);
        v = get_root(v);
        par[v] = u;
    }
};

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    int max_value = *max_element(gondolaSeq, gondolaSeq + n);
    
    DSU F;
    F.init(max_value + 1);
    
    int k = 0;
    for(int i = 0; i < n; i ++) {
        if(gondolaSeq[k] > gondolaSeq[i]) {
            k = i;
        }        
    }
    
    for(int i = 0; i < n; i ++) {
        F.unite(gondolaSeq[i] + 1, gondolaSeq[i]);        
    }
        
    int l = 0;
    if(gondolaSeq[k] > n) {
        for(int i = 0; i < n; i ++) {
            for(int j = i + 1; j < gondolaSeq[i]; j = F.get_root(j)) {
                replacementSeq[l ++] = j; 
                F.unite(j + 1, j);
            }
        }
    } else {
        vector<int> seq = bld(n, k, gondolaSeq);
        
        for(int i = 0; i < n; i ++) {
            int j = i + 1;
            F.unite(j + 1, j);
        }
        
        for(int i = 0; i < n; i ++) {
            for(int j = i + 1; j < seq[i]; j = F.get_root(j)) {
                replacementSeq[l ++] = j; 
                F.unite(j + 1, j);
            }
        }
    }
    
    return l; 
}

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

const int mod = 1000000009;

int binpow(int a, int b) {
    if(!b) return 1;
    
    if(b % 2 == 0) {
        int x = binpow(a, b / 2);
        return 1LL * x * x % mod;
    }
    
    return 1LL * binpow(a, b - 1) * a % mod;
}

int countReplacement(int n, int inputSeq[]) {
    if(!valid(n, inputSeq)) return 0;

    int k = 0;
    for(int i = 0; i < n; i ++) {
        if(inputSeq[k] > inputSeq[i]) {
            k = i;
        }        
    }

    vector<int> seq;
    
    for(int i = 0; i < n; i ++) {
        if(inputSeq[i] > n) {
            seq.push_back(inputSeq[i]);
        }
    }
    
    sort(seq.begin(), seq.end());
    int curr = n;
    int total = 1;
    
    if(inputSeq[k] > n) {
        for(int i = 0; i < n; i ++) {
            total = 1LL * total * (i + 1) % mod;
        }
    }
    
    for(int i = 0; i < seq.size(); i ++) {
        if(seq[i] > curr + 1)
            total = 1LL * total * binpow((seq.size() - i), seq[i] - 1 - curr) % mod;
        
        curr = seq[i];
    }
    
    return total;
}

Compilation message

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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 588 KB Output is correct
7 Correct 7 ms 604 KB Output is correct
8 Correct 8 ms 648 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 12 ms 768 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 7 ms 604 KB Output is correct
8 Correct 8 ms 604 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 12 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 7 ms 604 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Incorrect 1 ms 348 KB Integer 977 violates the range [1, 975]
8 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB Integer 977 violates the range [1, 975]
8 Halted 0 ms 0 KB -

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 360 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 12 ms 1116 KB Output is correct
10 Correct 10 ms 984 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 5 ms 604 KB Output is correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 12 ms 1112 KB Output is correct
10 Correct 10 ms 984 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 5 ms 604 KB Output is correct
13 Incorrect 1 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -