답안 #962671

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
962671 2024-04-14T06:38:41 Z hirayuu_oj 곤돌라 (IOI14_gondola) C++17
100 / 100
43 ms 6012 KB
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) x.begin(),x.end()
using ll=long long;
const ll MOD=1000000009;

ll safe_mod(ll n,ll p){
    n%=p;
    if(n<0)n+=p;
    return n;
}
int valid(int n, int inputSeq[]){
    int fix=MOD;
    rep(i,n){
        if(inputSeq[i]<=n){
            if(fix==MOD)fix=safe_mod(i-inputSeq[i],n);
            else{
                if(fix!=safe_mod(i-inputSeq[i],n)){
                    return 0;
                }
            }
        }
    }
    set<int> ser;
    rep(i,n){
        if(ser.count(inputSeq[i]))return 0;
        ser.insert(inputSeq[i]);
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    int cnt=0;
    vector<int> repl(300000,-1);
    rep(i,n){
        repl[gondolaSeq[i]]=i;
    }
    int fix=0;
    vector<bool> inc(n,0);
    rep(i,n){
        if(gondolaSeq[i]<=n){
            fix=safe_mod(i-gondolaSeq[i],n);
            inc[i]=1;
        }
    }
    vector<int> gdls(n);
    rep(i,n){
        gdls[i]=safe_mod(i-fix,n);
        if(gdls[i]==0)gdls[i]=n;
    }
    int gdl=n+1;
    int pos=0;
    while(pos<n&&inc[pos])pos++;
    while(true){
        if(pos==n)break;
        if(repl[gdl]==-1){
            replacementSeq[cnt]=gdls[pos];
            gdls[pos]=gdl;
        }
        else{
            replacementSeq[cnt]=gdls[repl[gdl]];
            gdls[repl[gdl]]=gdl;
            inc[repl[gdl]]=1;
        }
        cnt++;
        gdl++;
        while(pos<n&&inc[pos])pos++;
    }
    return cnt;
}

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

ll pow_mod(ll n,ll x){
    if(x==0)return 1;
    ll ret=pow_mod(n,x/2);
    ret=safe_mod(ret*ret,MOD);
    if(x&1)ret=safe_mod(ret*n, MOD);
    return ret;
}
int countReplacement(int n, int inputSeq[]){
    if(!valid(n,inputSeq)){
        return 0;
    }
    vector<int> broken;
    ll ans=n;
    int can=n;
    rep(i,n){
        if(inputSeq[i]<=n){
            ans=1;
            can--;
        }
        else{
            broken.push_back(inputSeq[i]);
        }
    }
    sort(all(broken));
    int now=n;
    for(int i:broken){
        ans=safe_mod(ans*pow_mod(can, i-now-1), MOD);
        can--;
        now=i;
    }
    return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 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 348 KB Output is correct
# 결과 실행 시간 메모리 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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 10 ms 2280 KB Output is correct
7 Correct 7 ms 604 KB Output is correct
8 Correct 20 ms 3932 KB Output is correct
9 Correct 7 ms 1372 KB Output is correct
10 Correct 24 ms 4444 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 11 ms 2360 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 20 ms 3848 KB Output is correct
9 Correct 6 ms 1600 KB Output is correct
10 Correct 27 ms 4664 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 4 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 8 ms 600 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1624 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1372 KB Output is correct
2 Correct 1 ms 1372 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1624 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1624 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 2 ms 1628 KB Output is correct
10 Correct 1 ms 1624 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1368 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1372 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 1 ms 1372 KB Output is correct
6 Correct 1 ms 1372 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 1 ms 1628 KB Output is correct
9 Correct 1 ms 1628 KB Output is correct
10 Correct 2 ms 1628 KB Output is correct
11 Correct 7 ms 2140 KB Output is correct
12 Correct 8 ms 2140 KB Output is correct
13 Correct 10 ms 2140 KB Output is correct
14 Correct 7 ms 2032 KB Output is correct
15 Correct 19 ms 2396 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 30 ms 3932 KB Output is correct
10 Correct 24 ms 3416 KB Output is correct
11 Correct 10 ms 1368 KB Output is correct
12 Correct 11 ms 1628 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
# 결과 실행 시간 메모리 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 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 31 ms 3924 KB Output is correct
10 Correct 24 ms 3496 KB Output is correct
11 Correct 9 ms 1372 KB Output is correct
12 Correct 11 ms 1628 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 42 ms 4676 KB Output is correct
15 Correct 43 ms 6012 KB Output is correct
16 Correct 9 ms 1496 KB Output is correct
17 Correct 28 ms 4188 KB Output is correct
18 Correct 15 ms 2396 KB Output is correct