Submission #836798

#	Time	Username	Problem	Language	Result	Execution time	Memory
836798		Jarif_Rahman	Gondola (IOI14_gondola)	C++17	75 / 100	41 ms	10232 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

const ll md = 1e9+9;

ll pw(ll x, ll p){
    if(!p) return 1;
    if(p&1) return (pw(x, p^1)*x)%md;
    return pw((x*x)%md, p>>1);
}

bool distinct(deque<int> S){
    sort(S.begin(), S.end());
    for(int i = 1; i < S.size(); i++) if(S[i] == S[i-1]) return 0;
    return 1;
}

int valid(int n, int _S[]){
    deque<int> S;
    for(int i = 0; i < n; i++) S.pb(_S[i]);
    int mn = *min_element(S.begin(), S.end());
    while(S[0] != mn) S.pb(S[0]), S.pop_front();

    if(!distinct(S)) return 0;

    for(int i = 1; i < n; i++) if(S[i] <= n){
        if(S[i] != (mn+i-1)%n+1) return 0;
    }

    return 1;
}

int replacement(int n, int _S[], int R[]){
    deque<int> S;
    for(int i = 0; i < n; i++) S.pb(_S[i]);
    int mn = *min_element(S.begin(), S.end());
    while(S[0] != mn) S.pb(S[0]), S.pop_front();

    int mx = *max_element(S.begin(), S.end());
    if(mx == n) return 0;
    int x = (max_element(S.begin(), S.end())-S.begin()+mn-1)%n+1;

    map<int, int> mp;
    for(int i = 0; i < n; i++){
        if(S[i] > n && S[i] != mx) mp[S[i]] = (mn+i-1)%n+1;
    }

    for(int i = n+1; i <= mx; i++){
        if(mp[i] == 0) R[i-n-1] = x, x = i;
        else R[i-n-1] = mp[i];
    }
    return mx-n;
}

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

    int ans = 1, ls = n;
    vector<int> s;
    for(int i = 0; i < n; i++) if(S[i] > n) s.pb(S[i]);

    sort(s.begin(), s.end());
    for(int i = 0; i < s.size(); i++){
        ans = (ll(ans)*pw(int(s.size())-i, s[i]-ls-1))%md;
        ls = s[i];
    }
    return ans;
}

Compilation message (stderr)

gondola.cpp: In function 'bool distinct(std::deque<int>)':
gondola.cpp:20:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for(int i = 1; i < S.size(); i++) if(S[i] == S[i-1]) return 0;
      |                    ~~^~~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:69:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     for(int i = 0; i < s.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: 0 / 15
• Subtask 10: 0 / 10