oj.uz

Submission #749975

# Submission time Handle Problem Language Result Execution time Memory
749975 2023-05-29T02:41:47 Z Abrar_Al_Samit Gondola (IOI14_gondola) C++17
75 / 100
 38 ms 4964 KB 
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

const int nax = 1e5 + 3;
const int mod = 1e9 + 9;

map<int,int>cnt;
int expected[nax];

void get_expected(int n, int inputSeq[]) {
    for(int i=0; i<n; ++i) {
        expected[i] = 0;
    }

    int min_at = min_element(inputSeq, inputSeq+n) - inputSeq;

    int cur_val = inputSeq[min_at];
    int cur_id = min_at;

    for(int i=cur_id; ; ++i, ++cur_val) {
        if(i==n) i = 0;
        if(cur_val>n) cur_val = 1;

        if(expected[i]) break;

        expected[i] = cur_val;
    }
}
int valid(int n, int inputSeq[]) {
    for(int i=0; i<n; ++i) {
        cnt[inputSeq[i]]++;
        if(cnt[inputSeq[i]]>1) {
            return 0;
        }
    }

    get_expected(n, inputSeq);


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

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
    get_expected(n, gondolaSeq);

    vector<pair<int,int>>v;
    for(int i=0; i<n; ++i) if(gondolaSeq[i]>n) {
        v.emplace_back(gondolaSeq[i], expected[i]);
    }
    sort(v.begin(), v.end());

    int l = 0;
    int at = 0;

    while(at<v.size()) {
        int cur_gondola = v[at].second;

        while(l+n+1<=v[at].first) {
            replacementSeq[l] = cur_gondola;
            cur_gondola = l+n+1;

            ++l;
        }
        ++at;
    }
    return l;
}

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

int mul(int x, int y) {
    return (x * 1LL * y) % mod;
}
int quickpow(int a, int b) {
    int ret = 1;
    while(b) {
        if(b&1) ret = mul(ret, a);
        a = mul(a, a);
        b >>= 1;
    }
    return ret;
}
int countReplacement(int n, int inputSeq[]) {
    if(!valid(n, inputSeq)) return 0;

    int mx = 0, gtn = 0;

    vector<int>v;
    for(int i=0; i<n; ++i) {
        mx = max(mx, inputSeq[i]);
        if(inputSeq[i]>n) {
            ++gtn;
            v.push_back(inputSeq[i]);
        }
    }
    v.push_back(n);
    sort(v.begin(), v.end());
    long long ans = 1;

    for(int i=1; i<v.size(); ++i) {
        int cnt = v[i] - v[i-1] - 1;

        int option = gtn - i + 1;

        ans *= quickpow(option, cnt);
        ans %= mod;
    }
    return ans;
}

Compilation message

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:62:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     while(at<v.size()) {
      |           ~~^~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:107:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |     for(int i=1; i<v.size(); ++i) {
      |                  ~^~~~~~~~~

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 1 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 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 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 13 ms 2312 KB Output is correct
7 Correct 8 ms 608 KB Output is correct
8 Correct 21 ms 4144 KB Output is correct
9 Correct 10 ms 1492 KB Output is correct
10 Correct 29 ms 4820 KB Output is correct

Subtask #3
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 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 12 ms 2260 KB Output is correct
7 Correct 8 ms 608 KB Output is correct
8 Correct 21 ms 4156 KB Output is correct
9 Correct 7 ms 1576 KB Output is correct
10 Correct 30 ms 4848 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 15 ms 2132 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 37 ms 4964 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 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

# 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 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

Subtask #6
20.0 / 20.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 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 852 KB Output is correct
12 Correct 10 ms 980 KB Output is correct
13 Correct 12 ms 1424 KB Output is correct
14 Correct 7 ms 852 KB Output is correct
15 Correct 18 ms 2252 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 1 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #9
0 / 15.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 1 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 38 ms 4820 KB Output is correct
10 Correct 28 ms 4012 KB Output is correct
11 Correct 10 ms 1748 KB Output is correct
12 Correct 13 ms 2004 KB Output is correct
13 Incorrect 3 ms 724 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #10
0 / 10.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 1 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 38 ms 4644 KB Output is correct
10 Correct 28 ms 3916 KB Output is correct
11 Correct 11 ms 1732 KB Output is correct
12 Correct 14 ms 2008 KB Output is correct
13 Incorrect 5 ms 840 KB Output isn't correct
14 Halted 0 ms 0 KB -