oj.uz

답안 #169183

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
169183 2019-12-18T19:26:07 Z DavidDamian 곤돌라 (IOI14_gondola) C++11
60 / 100
 48 ms 5112 KB 
#include "gondola.h"
#include<vector>
#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
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;
void getBrokenGondolas(int n,int gondolaSeq[])
{
    int corresponding=1;
    int id_less_n=0;
    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++;
        }
        act++; //We update act since it is equal to the number of replaced gondola
    }
    return L;
}
typedef long long int ll;
ll exponentiation(ll x,ll e)
{
    if(e==0) return (ll)1;
    if(e==1) return x;
    ll product=exponentiation(x,e/2);
    product=(product*product)%1000000007;
    if(e%2==1) product=(product*x)%1000000007;
    return product;
}
int countReplacement(int n, int inputSeq[])
{
    if(!valid(n,inputSeq)) return 0;
    ll total=1;
    getBrokenGondolas(n,inputSeq);
    int act=n+1;
    int N=broken.size();
    for(int i=0;i<N;i++){
        int x=broken[i].first;
        ll k=(ll)x-(ll)act; //This is the number of numbers that have N-i choices
        total=(total*exponentiation((ll)N-i,k))%1000000007; //So we compute permutation with repetitions, of choices ((N-i)^k)
        act=x+1;
    }
    return total;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 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 19 ms 2524 KB Output is correct
7 Correct 13 ms 1144 KB Output is correct
8 Correct 34 ms 4344 KB Output is correct
9 Correct 12 ms 1656 KB Output is correct
10 Correct 46 ms 5112 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 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 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 20 ms 2428 KB Output is correct
7 Correct 13 ms 1276 KB Output is correct
8 Correct 34 ms 4344 KB Output is correct
9 Correct 12 ms 1656 KB Output is correct
10 Correct 48 ms 4984 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 8 ms 760 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 14 ms 1144 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 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 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 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 420 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 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 404 KB Output is correct
11 Correct 12 ms 1052 KB Output is correct
12 Correct 13 ms 1272 KB Output is correct
13 Correct 18 ms 1780 KB Output is correct
14 Correct 12 ms 1144 KB Output is correct
15 Correct 23 ms 2548 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 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
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 400 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 Incorrect 2 ms 376 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 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 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 Halted 0 ms 0 KB -