oj.uz

답안 #308409

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
308409 2020-10-01T05:45:17 Z talant117408 곤돌라 (IOI14_gondola) C++17
100 / 100
 85 ms 6160 KB 
#include "gondola.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const ll mod = 1e9+9;

ll mult(ll a, ll b){
    a = ((a%mod)+mod)%mod;
    b = ((b%mod)+mod)%mod;
    return (a*b)%mod;
}

ll binpow(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int valid(int n, int s[]){
    int in = -1, flag = 1, i;
    map <int, int> vis;
    
    for(i = 0; i < n; i++){
        if(vis[s[i]]){ 
            flag--; 
            break; 
        }
        vis[s[i]]++;
        
        if(in == -1 && s[i] <= n){ 
            in = s[i]; 
        }
        else if(s[i] <= n && in != s[i]){ 
            flag--; 
            break; 
        }
        
        in = (in == -1 ? in : (in+1 > n ? 1 : in+1));
    }
    
    return flag;
}

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

int replacement(int n, int gon[], int repl[]){
    int i, num = 0;
    
    vector <int> prev(n);
    iota(all(prev), 1);
    int in = -1, j;
    for(i = 0; i < n; i++){
        if(in == -1 && gon[i] <= n){
            in = gon[i];
            j = i;
            break;
        }
    }
    if(in != -1){
        for(i = j; i < n; i++){
            prev[i] = in;
            in = (in == n ? 1 : in+1);
        }
        for(i = 0; i < j; i++){
            prev[i] = in;
            in = (in == n ? 1 : in+1);
        }
    }
    
    vector <pii> bigger;
    for(i = 0; i < n; i++){
        if(gon[i] > n){
            bigger.pb({gon[i], i});
        }
    }
    
    int op = n;
    sort(all(bigger));
    
    for(auto to : bigger){
        for(j = op; j < to.first; j++){
            repl[num] = prev[to.second];
            num++;
            prev[to.second] = j+1;
        }
        op = to.first;
    }
    
    return num;
}

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

int countReplacement(int n, int gon[]){
    ll res = 1;
    if(!valid(n, gon)){
        return 0;
    }
    
    vector <int> bigger;
    for(int i = 0; i < n; i++){
        if(gon[i] > n){
            bigger.pb(gon[i]);
        }
    }
    sort(all(bigger));
    
    int prev = n;
    for(auto to : bigger){
        auto it = ub(all(bigger), prev)-bigger.begin();
        ll diff = to-prev-1;
        res = mult(res, binpow(ll(sz(bigger)-it), diff));
        prev = to;
    }
    
    if(sz(bigger) == n) res = mult(res, n);
    
    return res;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 16 ms 2176 KB Output is correct
7 Correct 14 ms 640 KB Output is correct
8 Correct 32 ms 3968 KB Output is correct
9 Correct 9 ms 1536 KB Output is correct
10 Correct 37 ms 4732 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 16 ms 2176 KB Output is correct
7 Correct 13 ms 640 KB Output is correct
8 Correct 33 ms 3960 KB Output is correct
9 Correct 9 ms 1536 KB Output is correct
10 Correct 38 ms 4600 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 14 ms 708 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 12 ms 896 KB Output is correct
12 Correct 13 ms 1056 KB Output is correct
13 Correct 18 ms 1288 KB Output is correct
14 Correct 11 ms 896 KB Output is correct
15 Correct 27 ms 2288 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 57 ms 4088 KB Output is correct
10 Correct 45 ms 3456 KB Output is correct
11 Correct 16 ms 1408 KB Output is correct
12 Correct 20 ms 1664 KB Output is correct
13 Correct 5 ms 768 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 58 ms 4216 KB Output is correct
10 Correct 43 ms 3448 KB Output is correct
11 Correct 16 ms 1408 KB Output is correct
12 Correct 20 ms 1664 KB Output is correct
13 Correct 5 ms 640 KB Output is correct
14 Correct 71 ms 4600 KB Output is correct
15 Correct 85 ms 6160 KB Output is correct
16 Correct 13 ms 1408 KB Output is correct
17 Correct 51 ms 4216 KB Output is correct
18 Correct 28 ms 2432 KB Output is correct