oj.uz

Submission #1042945

# Submission time Handle Problem Language Result Execution time Memory
1042945 2024-08-03T15:19:38 Z dpsaveslives Gondola (IOI14_gondola) C++17
100 / 100
 38 ms 6004 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#define f first
#define s second
#define ll long long
using namespace std;
const int MAXN = 1e5;
const int MOD = 1e9+9;
ll fac[MAXN+1];
void factorial(){
    fac[0] = 1;
    for(int i = 1;i<=MAXN;++i){
        fac[i] = fac[i-1]*i%MOD;
    }
}
ll exp(ll x, ll n){
    x %= MOD;
    ll res = 1;
    while(n > 0){
        if(n % 2 == 1){
            res = res*x%MOD;
        }
        x = x*x%MOD;
        n /= 2;
    }
    return res;
}
int valid(int n, int inputSeq[]){
    int pos = -1; set<int> vals;
    for(int i = 0;i<n;++i){
        if(inputSeq[i] <= n && pos == -1){
            pos = i;
        }
        vals.insert(inputSeq[i]);
    }
    if(vals.size() != n){
        return 0;
    }
    if(pos == -1){
        return 1;
    }
    int cur = inputSeq[pos];
    for(int i = pos;i<n;++i){
        if(inputSeq[i] <= n){
            //cout << i << " " << cur << "\n";
            if(inputSeq[i] != cur){
                return 0;
            }
        }
        if(cur == n){
            cur = 0;
        }
        ++cur;
    }
    for(int i = 0;i<=pos-1;++i){
        if(inputSeq[i] <= n){
            if(inputSeq[i] != cur){
                return 0;
            }
        }
        if(cur == n){
            cur = 0;
        }
        ++cur;

    }
    return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    vector<pair<int,int>> arr;
    int pos = -1; bool any = false;
    for(int i = 0;i<n;++i){
        if(gondolaSeq[i] <= n){
            if(pos == -1){
                pos = i;
            }
        }
        else{
            any = true;
            arr.push_back({gondolaSeq[i],i});
        }
    }
    if(!any){
        return 0;
    }
    int rep = 0, cur;
    if(pos != -1){
        cur = gondolaSeq[pos];
    }
    else{
        cur = 1;
        pos = 0;
    }
    vector<int> reps(n,-1);
    for(int i = pos;i<n;++i){
        if(gondolaSeq[i] > n){
            reps[i] = cur;
        }
        if(cur == n){
            cur = 0;
        }
        ++cur;
    }
    for(int i = 0;i<=pos-1;++i){
        if(gondolaSeq[i] > n){
            reps[i] = cur;
        }
        if(cur == n){
            cur = 0;
        }
        ++cur;
    }
    sort(arr.begin(),arr.end());
    cur = n+1; int i = 0;
    while(i < arr.size()){
        replacementSeq[rep] = reps[arr[i].s];
        //cout << rep << " " << replacementSeq[rep] << "\n";
        ++rep;
        while(cur < arr[i].f){ //until arr[i] = cur
            replacementSeq[rep] = cur;
            //cout << rep << " " << replacementSeq[rep] << "\n";
            ++rep; ++cur;
        }
        ++cur; ++i;
    }
    return rep;
}
int countReplacement(int n,	int	inputSeq[]){
    if(!valid(n,inputSeq)) return 0;
    int pos = -1; bool any = false;
    vector<pair<int,int>> arr;
    for(int i = 0;i<n;++i){
        if(inputSeq[i] <= n){
            if(pos == -1){
                pos = i;
            }
        }
        else{
            any = true;
            arr.push_back({inputSeq[i],i});
        }
    }
    if(!any){
        return 1;
    }
    ll ans = 1ll;
    if(pos != -1){
        sort(arr.begin(),arr.end());
        int cur = n; int i = 0; ll cnt = arr.size();
        while(i < arr.size()){
            ll x = exp(1ll*cnt,1ll*(arr[i].f-cur-1));
            ans = ans*x%MOD;
            cur = arr[i].f;
            ++i; --cnt;
        }
    }
    else{
        sort(arr.begin(),arr.end());
        int cur = n-1; int i = 0; ll cnt = arr.size();
        while(i < arr.size()){
            ll x = exp(1ll*cnt,1ll*(arr[i].f-cur-1));
            ans = ans*x%MOD;
            cur = arr[i].f;
            ++i; --cnt;
        }
        /*if(n == 2){
            return ans;
        }
        factorial();
        ll x = fac[n]; x -= n;
        x %= MOD;
        ll inv = exp(x,MOD-2);
        ans = ans*inv%MOD;*/
    }
    return ans;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:36:20: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |     if(vals.size() != n){
      |        ~~~~~~~~~~~~^~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:115: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]
  115 |     while(i < arr.size()){
      |           ~~^~~~~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:150:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  150 |         while(i < arr.size()){
      |               ~~^~~~~~~~~~~~
gondola.cpp:160:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  160 |         while(i < arr.size()){
      |               ~~^~~~~~~~~~~~

Subtask #1
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 344 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 7 ms 2508 KB Output is correct
7 Correct 20 ms 4180 KB Output is correct
8 Correct 11 ms 4440 KB Output is correct
9 Correct 4 ms 1728 KB Output is correct
10 Correct 16 ms 5056 KB Output is correct

Subtask #3
10.0 / 10.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 344 KB Output is correct
5 Correct 0 ms 440 KB Output is correct
6 Correct 6 ms 2396 KB Output is correct
7 Correct 18 ms 4308 KB Output is correct
8 Correct 13 ms 4444 KB Output is correct
9 Correct 4 ms 1520 KB Output is correct
10 Correct 16 ms 4948 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 9 ms 2392 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 21 ms 5244 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.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 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 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 5 ms 1116 KB Output is correct
12 Correct 5 ms 1116 KB Output is correct
13 Correct 7 ms 1552 KB Output is correct
14 Correct 4 ms 1116 KB Output is correct
15 Correct 13 ms 2388 KB Output is correct

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 344 KB Output is correct

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.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 1 ms 348 KB Output is correct
6 Correct 1 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 21 ms 4664 KB Output is correct
10 Correct 23 ms 3928 KB Output is correct
11 Correct 6 ms 1628 KB Output is correct
12 Correct 8 ms 1784 KB Output is correct
13 Correct 2 ms 704 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 440 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 21 ms 4468 KB Output is correct
10 Correct 17 ms 3932 KB Output is correct
11 Correct 6 ms 1628 KB Output is correct
12 Correct 8 ms 1884 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 32 ms 5348 KB Output is correct
15 Correct 38 ms 6004 KB Output is correct
16 Correct 5 ms 1372 KB Output is correct
17 Correct 20 ms 4184 KB Output is correct
18 Correct 11 ms 2904 KB Output is correct