oj.uz

Submission #169198

# Submission time Handle Problem Language Result Execution time Memory
169198 2019-12-18T21:51:02 Z DavidDamian Gondola (IOI14_gondola) C++11
100 / 100
 87 ms 7156 KB 
#include "gondola.h"
#include<vector>
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
///Permutations
///Binary Exponentiation
///Determine whether a sequence is a gondola sequence, a possible replacement sequence and the number of replacement sequences
map<int,int> used;
int valid(int n, int inputSeq[])
{
    int corresponding=1;
    int id_less_n=0;
    for(int i=0;i<n;i++){
        if(inputSeq[i]<=n){
            id_less_n=i;
            corresponding=inputSeq[i];
            break;
        }
    }
    for(int i=id_less_n;i<n+id_less_n;i++){
        if(used[ inputSeq[i%n] ]) return 0;
        used[ inputSeq[i%n] ]=1;
        if(inputSeq[i%n]>n){
            corresponding=(corresponding%n)+1;
            continue;
        }
        if(inputSeq[i%n]!=corresponding){
            return 0;
        }
        corresponding=(corresponding%n)+1;
    }
    return 1;
}

typedef pair<int,int> pii;
//First is equal to the actual gondola
//Second is equal to the original gondola
bool byActual(pii a,pii b)
{
    return a.first<b.first;
}
vector<pii> broken;
int corresponding=1;
int id_less_n=0;
void getBrokenGondolas(int n,int gondolaSeq[]) ///Return a vector with broken gondolas in in increasing order
{
    for(int i=0;i<n;i++){
        if(gondolaSeq[i]<=n){
            id_less_n=i;
            corresponding=gondolaSeq[i];
            break;
        }
    }
    for(int i=id_less_n;i<n+id_less_n;i++){
        if(gondolaSeq[i%n]>n) broken.push_back(pii(gondolaSeq[i%n],corresponding));
        corresponding=(corresponding%n)+1;
    }
    sort(broken.begin(),broken.end(),byActual);
}
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    getBrokenGondolas(n,gondolaSeq);
    int L=0;
    int act=n+1;
    for(pii x: broken){
        replacementSeq[L++]=x.second; //We add the original
        while(act<x.first){
            replacementSeq[L++]=act++; //Adds the intermediate gondolas
        }
        act++; //We update act since it is equal to the number of replaced gondola
    }
    return L;
}
typedef long long int ll;
ll mod=1000000009;
ll exponentiation(ll x,ll e)
{
    if(e==0) return (ll)1;
    ll product=exponentiation(x,e/2);
    product=(product*product)%mod;
    if(e%2==1) product=(product*x)%mod;
    return product;
}
int countReplacement(int n, int inputSeq[])
{
    if(!valid(n,inputSeq)) return 0;
    ll total=1;
    getBrokenGondolas(n,inputSeq);
    ll act=n+1;
    ll N=broken.size();
    for(ll i=0;i<N-1;i++){
        ll x=broken[i].first;
        ll k=x-act; //This is the number of numbers that have N-i choices
        total=(total*exponentiation((ll)(N-i),k))%mod; //So we compute permutation with repetitions, of choices ((N-i)^k)
        act=x+1;
    }
    if(corresponding==1 && inputSeq[0]!=1) total=(total*n)%mod; //There are not original gondolas
    //So we can do n rotations
    return total;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 19 ms 2168 KB Output is correct
7 Correct 13 ms 632 KB Output is correct
8 Correct 34 ms 3960 KB Output is correct
9 Correct 11 ms 1528 KB Output is correct
10 Correct 47 ms 4576 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 19 ms 2168 KB Output is correct
7 Correct 13 ms 632 KB Output is correct
8 Correct 34 ms 3960 KB Output is correct
9 Correct 12 ms 1528 KB Output is correct
10 Correct 46 ms 4600 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 7 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 14 ms 632 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 12 ms 632 KB Output is correct
12 Correct 14 ms 636 KB Output is correct
13 Correct 18 ms 1524 KB Output is correct
14 Correct 12 ms 632 KB Output is correct
15 Correct 23 ms 2420 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 67 ms 4688 KB Output is correct
10 Correct 53 ms 4088 KB Output is correct
11 Correct 21 ms 1784 KB Output is correct
12 Correct 23 ms 2168 KB Output is correct
13 Correct 6 ms 760 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 62 ms 4696 KB Output is correct
10 Correct 46 ms 4088 KB Output is correct
11 Correct 19 ms 1784 KB Output is correct
12 Correct 23 ms 2168 KB Output is correct
13 Correct 6 ms 760 KB Output is correct
14 Correct 77 ms 6516 KB Output is correct
15 Correct 87 ms 7156 KB Output is correct
16 Correct 16 ms 1784 KB Output is correct
17 Correct 59 ms 4832 KB Output is correct
18 Correct 32 ms 3316 KB Output is correct