oj.uz

Submission #1096564

# Submission time Handle Problem Language Result Execution time Memory
1096564 2024-10-04T18:36:41 Z Tymond Gondola (IOI14_gondola) C++17
100 / 100
 63 ms 7248 KB 
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
 
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
 
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

int valid(int n, int inputSeq[]){
    vi a;
    vi vec;
    map<int, int> cnt;
    pii mn = {10000000, 0};
    for(int i = 0; i < n; i++){
        a.pb(inputSeq[i]);
        cnt[a[i]]++;
        if(a[i] < mn.fi){
            mn.fi = a[i];
            mn.se = i;
        }
    }

    for(auto ele : cnt){
        if(ele.se > 1){
            return 0;
        }
    }

    vi na;
    for(int i = mn.se; i < n; i++){
        na.pb(a[i]);
    }
    for(int i = 0; i < mn.se; i++){
        na.pb(a[i]);
    }
    a = na;
    for(int i = 0; i < n; i++){
        if(a[i] <= n){
            vec.pb(i);
        }
    }

    if(sz(vec) <= 1){
        return 1;
    }

    for(int i = 0; i + 1 < sz(vec); i++){
        if(a[vec[i + 1]] <= a[vec[i]]){
            return 0;
        }

        if(vec[i + 1] - vec[i] != a[vec[i + 1]] - a[vec[i]]){
            return 0;
        }
    }

    if(n - vec.back() - 1 != (n - a[vec.back()] + a[vec[0]] - 1)){
        return 0;
    }
    return 1;
}

//----------------------
const int INF = 1e9;

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    int l = 0;
    vi a;
    set<pii> x;
    pii mn = {INF, 0};
    for(int i = 0; i < n; i++){
        a.pb(gondolaSeq[i]);
        if(a[i] > n){
            x.insert({a[i], i});
        }
        
        if(a[i] < mn.fi){
            mn.fi = a[i];
            mn.se = i;
        }
    }

    vi p;
    int ok = n + 1;
   // cout << mn.fi << ' ' << mn.se << '\n';
    while(sz(x)){
        pii akt = *(x.begin());
        x.erase(x.begin());

        int our;
        if(mn.fi > n){
            our = akt.se + 1;
        }else if(akt.se >= mn.se){
            our = mn.fi + akt.se - mn.se;
            if(our > n){
                our -= n;
            }
        }else{
            our = mn.fi + n - mn.se + akt.se;
            while(our > n){
                our -= n;
            }
        }
        //cout << akt.se << ' ' << our << '\n';
        p.pb(our);
        our = ok;
        while(our < akt.fi){
            p.pb(our);
            our++;
        }

        ok = our + 1;
    }

    l = sz(p);
    for(int i = 0; i < l; i++){
        replacementSeq[i] = p[i];
    }
    return l;
}

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

const int MOD = 1e9 + 9;
ll fastPow(ll x, ll y){
    //x**y
    ll res = 1;
    ll r = x;
    while(y > 0){
        if(y & 1){
           res = (ll)res * r;
           res %= MOD;
        }
        y /= 2;
        r = (ll)r * r;
        r %= MOD;
    }

    return res;
}

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

    vi a;
    pii mn = {INF, 0};
    for(int i = 0; i < n; i++){
        a.pb(inputSeq[i]);
        if(a[i] < mn.fi){
            mn.fi = a[i];
            mn.se = i;
        }
    }

    ll ans = 1LL;
    if(mn.fi > n){
        ans = n;
    }

    set<pii> s;
    for(int i = 0; i < n; i++){
        if(a[i] > n){
            s.insert({a[i], i});
        }
    }

    int u = n + 1;
    while(sz(s)){
        pii akt = *s.begin();
        s.erase(s.begin());

        ans = (ll)ans * fastPow(sz(s) + 1, akt.fi - u);
        ans %= MOD;
        u = akt.fi + 1;
    }

    return (int)ans;
}

/*int main(){
    int S[7] = {9, 8, 17, 12, 13, 16, 10};
    cout<<countReplacement(7, S) << '\n';
    return 0;
}*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 448 KB Output is correct
4 Correct 1 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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 10 ms 3188 KB Output is correct
7 Correct 21 ms 4464 KB Output is correct
8 Correct 23 ms 5720 KB Output is correct
9 Correct 5 ms 2108 KB Output is correct
10 Correct 18 ms 6456 KB Output is correct

Subtask #3
10.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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 3164 KB Output is correct
7 Correct 21 ms 4668 KB Output is correct
8 Correct 15 ms 5720 KB Output is correct
9 Correct 5 ms 2140 KB Output is correct
10 Correct 18 ms 6408 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 12 ms 2896 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 29 ms 6404 KB Output is correct

Subtask #4
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 1 ms 344 KB Output is correct

Subtask #5
10.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 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #6
20.0 / 20.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 1 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1748 KB Output is correct
12 Correct 8 ms 1752 KB Output is correct
13 Correct 15 ms 3124 KB Output is correct
14 Correct 6 ms 1752 KB Output is correct
15 Correct 16 ms 3324 KB Output is correct

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 43 ms 5628 KB Output is correct
10 Correct 31 ms 4556 KB Output is correct
11 Correct 12 ms 1852 KB Output is correct
12 Correct 14 ms 2140 KB Output is correct
13 Correct 4 ms 856 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 1 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 44 ms 5692 KB Output is correct
10 Correct 31 ms 4564 KB Output is correct
11 Correct 12 ms 1884 KB Output is correct
12 Correct 14 ms 2156 KB Output is correct
13 Correct 3 ms 860 KB Output is correct
14 Correct 61 ms 6548 KB Output is correct
15 Correct 63 ms 7248 KB Output is correct
16 Correct 10 ms 1628 KB Output is correct
17 Correct 39 ms 4852 KB Output is correct
18 Correct 21 ms 3028 KB Output is correct