Submission #749985

#	Time	Username	Problem	Language	Result	Execution time	Memory
749985		Abrar_Al_Samit	Gondola (IOI14_gondola)	C++17	100 / 100	69 ms	6984 KiB

gondola

#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[]) {
    cnt.clear();
    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;
    }
    if(gtn==n) {
        ans *= n;
        ans %= mod;
    }
    return ans;
}

Compilation message (stderr)

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

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 5 / 5
• Subtask 8: 15 / 15
• Subtask 9: 15 / 15
• Subtask 10: 10 / 10