oj.uz

Submission #996570

# Submission time Handle Problem Language Result Execution time Memory
996570 2024-06-10T19:56:05 Z hasan2006 Gondola (IOI14_gondola) C++17
100 / 100
 38 ms 8016 KB 
#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 5e5 + 9 , mod = 1e9 + 9;
ll a[N] , b[N] , d[N] , c[N] , dp[N] ;

int valid(int n , int inputSeq[]){
    int x = -1 , y , k;
    set<int>st;
    for(int i = 0; i < n; i++){
        st.insert(inputSeq[i]);
        if(inputSeq[i] <= n)
            x = k = i , y = inputSeq[i];
    }
    if(st.size() != n){
        return 0;
    }
    if(x == -1)
        return 1;
    while((x + 1) % n != k){
        x = (x + 1) % n;
        y++;
        y = (y - 1) % n + 1;
        if(inputSeq[x] <= n && inputSeq[x] != y)
            return 0;
    }
    return 1;
}


int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    int x = 0 , y = 1 , k = 0;
    for(int i = 0; i < n; i++)
        if(gondolaSeq[i] <= n)
            x = k = i , y = gondolaSeq[i];
    for(int i = 1; i <= 3e5; i++)
        c[i] = 0;
    int mx = 0 ,s = 0 , f;
    c[gondolaSeq[x]] = y;
    if(gondolaSeq[x] > mx)
        mx = gondolaSeq[x],f = y;
    while((x + 1) % n != k){
        x = (x + 1) % n;
        y++;
        y = (y - 1) % n + 1;
        c[gondolaSeq[x]] = y;
        if(gondolaSeq[x] > mx)
            mx = gondolaSeq[x],f = y;
    }
    x = n + 1;
    while(x <= mx){
        if(x == mx){
            replacementSeq[s++] = f;
            break;
        }
        if(c[x]){
            replacementSeq[s++] = c[x];
        }else {
            replacementSeq[s++] = f;
            f = x;
        }
        x++;
    }
  return s;
}

ll binpow(ll x , int y){
    ll ans = 1;
    while(y > 0){
        if(y % 2) ans = ans * x % mod, y--;
        else x = x * x % mod , y/=2;
    }
    return ans;
}

int countReplacement(int n, int inputSeq[]){
    if(!valid(n , inputSeq)){
        return 0;
    }
    vector<int>v;
    for(int i = 0; i < n; i++)
        if(inputSeq[i] > n)
            v.pb(inputSeq[i]);
    if(!v.size())
        return 1;
    v.pb(n);
    sort(all(v));
    ll ans = 1;
    for(int i = 1; i < v.size(); i++){
        ans = ans * binpow(v.size() - i , v[i] - v[i - 1] - 1) % mod;
    }
    if(v.size() == n + 1)
        ans = ans * n % mod;
    return ans;
}


// Author : حسن

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:33:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   33 |     if(st.size() != n){
      |        ~~~~~~~~~~^~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:107:22: 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++){
      |                    ~~^~~~~~~~~~
gondola.cpp:110:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  110 |     if(v.size() == n + 1)
      |        ~~~~~~~~~^~~~~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:77:33: warning: 'f' may be used uninitialized in this function [-Wmaybe-uninitialized]
   77 |             replacementSeq[s++] = f;
      |             ~~~~~~~~~~~~~~~~~~~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2400 KB Output is correct
2 Correct 1 ms 2400 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 8 ms 4440 KB Output is correct
7 Correct 19 ms 6164 KB Output is correct
8 Correct 13 ms 6236 KB Output is correct
9 Correct 5 ms 3676 KB Output is correct
10 Correct 17 ms 6860 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2400 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 8 ms 4444 KB Output is correct
7 Correct 20 ms 5980 KB Output is correct
8 Correct 14 ms 6324 KB Output is correct
9 Correct 5 ms 3672 KB Output is correct
10 Correct 18 ms 7004 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 11 ms 4264 KB Output is correct
14 Correct 0 ms 2400 KB Output is correct
15 Correct 26 ms 7196 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6496 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6584 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6588 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6588 KB Output is correct
4 Correct 1 ms 6592 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 1 ms 6604 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 6 ms 7004 KB Output is correct
12 Correct 7 ms 7112 KB Output is correct
13 Correct 8 ms 7004 KB Output is correct
14 Correct 6 ms 7004 KB Output is correct
15 Correct 11 ms 7772 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2400 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 26 ms 6476 KB Output is correct
10 Correct 21 ms 5708 KB Output is correct
11 Correct 7 ms 3672 KB Output is correct
12 Correct 9 ms 3952 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 27 ms 6492 KB Output is correct
10 Correct 26 ms 5724 KB Output is correct
11 Correct 7 ms 3676 KB Output is correct
12 Correct 10 ms 3952 KB Output is correct
13 Correct 3 ms 2652 KB Output is correct
14 Correct 34 ms 7200 KB Output is correct
15 Correct 38 ms 8016 KB Output is correct
16 Correct 6 ms 3420 KB Output is correct
17 Correct 24 ms 6192 KB Output is correct
18 Correct 13 ms 4444 KB Output is correct