oj.uz

Submission #962394

# Submission time Handle Problem Language Result Execution time Memory
962394 2024-04-13T12:31:19 Z IUA_Hasin Gondola (IOI14_gondola) C++17
75 / 100
 26 ms 9980 KB 
#include "gondola.h"
#include <bits/stdc++.h>
 
#define endl                                "\n"
#define yeap                                cout<<"YES"<<endl
#define nope                                cout<<"NO"<<endl
#define ll                                  long long

using namespace std;

const ll N = 1e8+1;
ll vis[N];
ll vec[N];
set<ll> ss;

int valid(int n, int inputSeq[])
{
  ll mn = 300000;
  ll mx = -1;
  ll mnind = 0;
  ll status = 1;
  for(int i=0; i<n; i++){
    ll a = inputSeq[i];
    ss.insert(a);
    if(a<mn){
      mn = a;
      mnind = i;
    }
    mx = max(mx, a);
  }
  ll sss = ss.size();
  if(sss!=n){
    status = -1;
  }

  if(status==-1){
    return 0;
  } else {
    if(mn>=n){
      return 1;
    } else {
      ll cnt = 0;
      ll ind = mnind;
      ll temp = mn;
      while(cnt<n){
        ll temp1 = ind%n;
        if(inputSeq[temp1]<=n){
          if(inputSeq[temp1]!=temp){
            status = -1;
            break;
          }
          cnt++;
          ind++;
          temp++;
        } else {
          cnt++;
          ind++;
          temp++;
        }
      }
      if(status==-1){
        return 0;
      } else {
        return 1;
      }
    }
  }



}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{ 
  ll mx = -1;
  ll mn = 300000;
  for(int i=0; i<n; i++){
    ll a = gondolaSeq[i];
    vis[a] = 1;
    mx = max(mx, a);
    mn = min(mn, a);
  }

  if(mx==n){
    return 0;
  } else {
    if(mn>n){
      for(int i=0; i<n; i++){
        ll a = gondolaSeq[i];
        vec[a] = i+1;
      }

      ll cnt = 0;
      ll cnt1 = n;
      for(int i=n+1; i<=mx; i++){
        ll b = vec[i];
        if(vis[i]==1){
          replacementSeq[cnt] = b;
          cnt++;
          cnt1++;
          while(cnt1<i){
            replacementSeq[cnt] = cnt1;
            cnt++;
            cnt1++;
          }
        }
      }

      return cnt;

    } else {
      ll mnind;
      for(int i=0; i<n; i++){
        if(gondolaSeq[i]==mn){
          mnind = i;
          break;
        }
      }

      ll cntt = 0;
      ll temp1 = mn;
      ll temp2 = mnind;

      while(cntt<n){
        ll a = temp1%n;
        ll b = temp2%n;
        ll c = gondolaSeq[b];
        if(a==0){
          a = n;
        }
        vec[c] = a;
        temp1++;
        temp2++;
        cntt++;
      }

      ll cnt = 0;
      ll cnt1 = n;
      for(int i=n+1; i<=mx; i++){
        ll b = vec[i];
        if(vis[i]==1){
          replacementSeq[cnt] = b;
          cnt++;
          cnt1++;
          while(cnt1<i){
            replacementSeq[cnt] = cnt1;
            cnt++;
            cnt1++;
          }
        }
      }

      return cnt;
    }
  }
}

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

int countReplacement(int n, int inputSeq[])
{
  ll status = valid(n, inputSeq);
  if(status==0){
    return 0;
  } else {
    ll big_count = 0;
    ll mn = 300000;
    int mx = -1;
    for(int i=0; i<n; i++){
      mx = max(mx, inputSeq[i]);
      if(inputSeq[i]>n){
        big_count++;
      }
    }
    if(mx==n){
      return 1;
    } else if(mx==n+1){
      return 1;
    } else if(mx==n+2){
      return 1;
    } else if(mx==n+3){
      auto aa = ss.find(n+1);
      if(aa!=ss.end()){
        return 1;
      } else {
        return 2;
      }
    } else {
      if(big_count==1){
        return 1;
      } else if(big_count==2){
        ll ans = 0;
        ll a;
        for(int i=n+1; i<=250; i++){
          auto aa = ss.find(i);
          if(aa!=ss.end()){
            a = i-n-1;
            break;
          }
        }
        ll M = 1000000009;
        ll b = 1;
        for(int i=0; i<a; i++){
          b = b*2;
          b = b%M;
        }
        return b;
      } else if(big_count==3){
        ll ans = 0;
        ll tt = 0;
        ll a, b;
        ll temp;
        for(int i=n+1; i<=250; i++){
          auto aa = ss.find(i);
          if(aa!=ss.end()){
            if(tt==0){
              a = i-n-1;
              tt++;
              temp = i;
              // cout<<i<<endl;
            } else {
              b = i-temp-1;
              // cout<<i<<endl;
              break;
            }
          }
        }
        ll M = 1e9+9;
        ll c = 1;
        ll d = 1;
        for(int i=0; i<a; i++){
          c = c*3;
          c = c%M;
        }
        for(int i=0; i<b; i++){
          d = d*2;
          d = d%M;
        }
        // cout<<a<<" "<<b<<endl;
        // cout<<c<<" "<<d<<endl;
        ans = c*d;
        ans = ans%M;
        return ans;
      } else {
        sort(inputSeq, inputSeq+n);
        vector<pair<ll, ll>> v;
        ll pp = big_count;
        ll temp = n+1;
        for(int i=0; i<n; i++){
          ll a = inputSeq[i];
          if(a>n){
            v.push_back({a-temp, pp});
            pp--;
            temp = a+1;
          }
        }
        // for(int i=0; i<v.size(); i++){
        //   cout << v[i].first << " " << v[i].second << endl;
        // }

        ll M = 1e9+9;
        ll ans = 1;
        for(int i=0; i<v.size(); i++){
          ll a = v[i].first;
          ll b = v[i].second;
          for(int i=0; i<a; i++){
            ans = (ans*b)%M;
            ans = ans%M;
          }
          ans = ans%M;
        }
        ans = ans%M;
        
        return ans;
        
      }
    }
  }
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:194:12: warning: unused variable 'ans' [-Wunused-variable]
  194 |         ll ans = 0;
      |            ^~~
gondola.cpp:265:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  265 |         for(int i=0; i<v.size(); i++){
      |                      ~^~~~~~~~~
gondola.cpp:169:8: warning: unused variable 'mn' [-Wunused-variable]
  169 |     ll mn = 300000;
      |        ^~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:114:10: warning: 'mnind' may be used uninitialized in this function [-Wmaybe-uninitialized]
  114 |       ll mnind;
      |          ^~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:213:12: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]
  213 |         ll a, b;
      |            ^
gondola.cpp:213:15: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
  213 |         ll a, b;
      |               ^
gondola.cpp:195:12: warning: 'a' may be used uninitialized in this function [-Wmaybe-uninitialized]
  195 |         ll a;
      |            ^

Subtask #1
5.0 / 5.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 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 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 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 8 ms 2140 KB Output is correct
7 Correct 19 ms 3672 KB Output is correct
8 Correct 14 ms 3932 KB Output is correct
9 Correct 5 ms 1372 KB Output is correct
10 Correct 23 ms 4440 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 8 ms 2140 KB Output is correct
7 Correct 18 ms 3672 KB Output is correct
8 Correct 17 ms 3928 KB Output is correct
9 Correct 5 ms 1372 KB Output is correct
10 Correct 17 ms 4536 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 2136 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 22 ms 4804 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4692 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4468 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4440 KB Output is correct
11 Correct 6 ms 2652 KB Output is correct
12 Correct 6 ms 2792 KB Output is correct
13 Correct 9 ms 7260 KB Output is correct
14 Correct 6 ms 2652 KB Output is correct
15 Correct 15 ms 9980 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #9
0 / 15.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 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 26 ms 5108 KB Output is correct
10 Correct 20 ms 4568 KB Output is correct
11 Correct 8 ms 2016 KB Output is correct
12 Correct 9 ms 2444 KB Output is correct
13 Incorrect 3 ms 860 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 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 372 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 25 ms 5204 KB Output is correct
10 Correct 20 ms 4568 KB Output is correct
11 Correct 8 ms 2016 KB Output is correct
12 Correct 9 ms 2268 KB Output is correct
13 Incorrect 3 ms 860 KB Output isn't correct
14 Halted 0 ms 0 KB -