oj.uz

Submission #340043

# Submission time Handle Problem Language Result Execution time Memory
340043 2020-12-26T16:09:09 Z bigDuck Gondola (IOI14_gondola) C++14
100 / 100
 36 ms 6124 KB 
#include "gondola.h"

#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount

ll mod=((ll)1000000000)+9;


map<int, int> cnt_valid;
int valid(int n, int inputSeq[])
{
     int i,j;
  for(i=0;i<n;i++)if(inputSeq[i]<=n)break;
  if(i<n)for(j=0;j<n;j++)if(inputSeq[j]<=n&&(inputSeq[j]+i)%n!=(inputSeq[i]+j)%n)return 0;
  std::sort(inputSeq,inputSeq+n);
  for(i=1;i<n;i++)if(inputSeq[i-1]==inputSeq[i])return 0;
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int pt=0, crd=0;
    for(int i=0; i<n; i++){
        if(gondolaSeq[i]<=n){
            pt=gondolaSeq[i], crd=i; break;
        }
    }

    int initial[100010];

    if(pt==0){
        for(int i=0; i<n; i++){
            initial[i]=i+1;
        }
    }
    else{
        for(int i=crd-pt+1, cnt=1; cnt<=n; i++){
            i+=n;
            i%=n;
            initial[i]=cnt;
            cnt++;
        }
    }

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

    if(s.empty()){
        return 0;
    }
    int cnt=n+1;
    for(auto it=s.begin(); it!=s.end(); it++){
        while(cnt<(it->ft) ){
            replacementSeq[cnt-n-1]=initial[it->sc]; initial[it->sc]=cnt; cnt++;
        }
        replacementSeq[cnt-n-1]=initial[it->sc]; initial[it->sc]=cnt;
        cnt++;
    }
    return cnt-1-n;
}

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


ll exp(ll x, ll e){

if(e==0){
    return 1;
}
if(e==1){
    return x%mod;
}
return (exp(x, e%2)*(exp( (x*x)%mod, e/2) ) )%mod ;

}



int countReplacement(int n, int inputSeq[])
{
    ll p=n;
  if(valid(n, inputSeq)==0){
    return 0;
  }
  multiset<ll> s;
  for(int i=0; i<n; i++){
    if(inputSeq[i]>n){s.insert({inputSeq[i]});}
    else{
        p--;
    }
  }


  ll ac=n+1;
  ll res=1;
  if( p==n ){
        res=n;
  }
    for(auto it=s.begin(); it!=s.end(); it++){
        res=(res*( exp(p, ((*it)-1)-ac+1 ) ) )%mod; ac=(*it)+1; p--;
    }
    return res;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 11 ms 876 KB Output is correct
7 Correct 11 ms 1132 KB Output is correct
8 Correct 12 ms 1004 KB Output is correct
9 Correct 7 ms 492 KB Output is correct
10 Correct 18 ms 1132 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 10 ms 748 KB Output is correct
7 Correct 11 ms 1132 KB Output is correct
8 Correct 12 ms 1004 KB Output is correct
9 Correct 5 ms 492 KB Output is correct
10 Correct 18 ms 1132 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 5 ms 748 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 11 ms 1132 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 10 ms 1388 KB Output is correct
12 Correct 12 ms 1492 KB Output is correct
13 Correct 24 ms 2924 KB Output is correct
14 Correct 10 ms 1388 KB Output is correct
15 Correct 28 ms 3180 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 380 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 23 ms 3820 KB Output is correct
10 Correct 18 ms 2944 KB Output is correct
11 Correct 8 ms 1644 KB Output is correct
12 Correct 10 ms 1900 KB Output is correct
13 Correct 3 ms 748 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 23 ms 3820 KB Output is correct
10 Correct 18 ms 2924 KB Output is correct
11 Correct 8 ms 1644 KB Output is correct
12 Correct 12 ms 1900 KB Output is correct
13 Correct 3 ms 748 KB Output is correct
14 Correct 32 ms 5356 KB Output is correct
15 Correct 36 ms 6124 KB Output is correct
16 Correct 7 ms 1388 KB Output is correct
17 Correct 23 ms 4204 KB Output is correct
18 Correct 14 ms 2540 KB Output is correct