oj.uz

답안 #760869

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760869 2023-06-18T19:44:10 Z Khizri 곤돌라 (IOI14_gondola) C++17
90 / 100
 47 ms 10440 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+9)
const int mxn=2e5+5,mxn2=1e6+5;
int n,color[mxn],arr[mxn],sum[mxn2];
int valid(int n, int vr[])
{
    for(int i=0;i<n;i++){
        arr[i]=vr[i];
    }
    set<int>st;
    for(int i=0;i<n;i++){
        st.insert(arr[i]);
    }
    if(st.size()!=n) return 0;
    int k=n+1,idx=0;
    for(int i=0;i<n;i++){
        if(arr[i]>n) continue;
        if(arr[i]<k){
            k=arr[i];
            idx=i;
        }
    }
    for(int i=idx;i<n;i++){
        if(arr[i]>n){
            arr[i]=k;
        }
        if(arr[i]!=k) return 0;
        k++;
        k%=(n+1);
        if(k==0) k++;
    }
    for(int i=0;i<idx;i++){
        if(arr[i]>n){
            arr[i]=k;
        }
        if(arr[i]!=k) return 0;
        k++;
        k%=(n+1);
        if(k==0) k++;
    }
    return 1;
}

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

int replacement(int n, int arr[], int replacementSeq[])
{
    int k=0,mn=n+1,idx=0;
    for(int i=0;i<n;i++){
        if(arr[i]>k){
            k=arr[i];
        }
        if(arr[i]<mn){
            mn=arr[i];
            idx=i;
        }
    }
    if(mn>n){
        set<pii>st;
        for(int i=0;i<n;i++){
            st.insert({arr[i],i+1});
        }
        int cnt=0;
        int nxt=n;
        for(auto [l,id]:st){
            replacementSeq[cnt++]=id;
            nxt++;
            while(nxt<l){
                replacementSeq[cnt++]=nxt;
                nxt++;
            }
        }
        return cnt;
    }
    for(int i=idx;i<n;i++){
        if(arr[i]>n){
            color[i]=mn;
        }
        else{
            color[i]=arr[i];
        }
        mn++;
        mn%=(n+1);
        if(mn==0) mn++;
    }
    for(int i=0;i<idx;i++){
        if(arr[i]>n){
            color[i]=mn;
        }
        else{
            color[i]=arr[i];
        }
        mn++;
        mn%=(n+1);
        if(mn==0) mn++;
    }
    set<pii>st;
    for(int i=0;i<n;i++){
        if(color[i]<arr[i]){
            st.insert({arr[i],color[i]});
        }
    }
    int cnt=0;
    int nxt=n;
    for(auto [l,id]:st){
        replacementSeq[cnt++]=id;
        nxt++;
        while(nxt<l){
            replacementSeq[cnt++]=nxt;
            nxt++;
        }
    }
    return cnt;
}

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

int countReplacement(int n, int arr[])
{
    int k=valid(n,arr);
    if(k==0) return k;
    set<int>st;
    int mx=0,mn=n+1;
    for(int i=0;i<n;i++){
        st.insert(arr[i]);
        mx=max(arr[i],mx);
        mn=min(arr[i],mn);
        sum[arr[i]]=1;
    }
    for(int i=1;i<=251000;i++){
        sum[i]+=sum[i-1];
    }
    ll ans=1;
    for(int i=n+1;i<=mx;i++){
        if(st.count(i)) continue;
        ll cnt=0;
        cnt=sum[250500]-sum[i];
        ans=(ans*cnt)%MOD;
    }
    if(mn>n){
        ans=(ans*n)%MOD;
    }
    return ans;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:26:17: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   26 |     if(st.size()!=n) return 0;
      |        ~~~~~~~~~^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 2296 KB Output is correct
7 Correct 19 ms 3924 KB Output is correct
8 Correct 18 ms 4180 KB Output is correct
9 Correct 5 ms 1492 KB Output is correct
10 Correct 19 ms 4768 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 268 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 8 ms 2356 KB Output is correct
7 Correct 19 ms 3924 KB Output is correct
8 Correct 15 ms 4180 KB Output is correct
9 Correct 7 ms 1492 KB Output is correct
10 Correct 19 ms 4820 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 10 ms 2132 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 23 ms 4904 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 6 ms 852 KB Output is correct
12 Correct 7 ms 1000 KB Output is correct
13 Correct 15 ms 2656 KB Output is correct
14 Correct 6 ms 852 KB Output is correct
15 Correct 20 ms 2924 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1236 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 1 ms 1256 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 2 ms 1236 KB Output is correct
9 Correct 41 ms 5300 KB Output is correct
10 Correct 32 ms 4936 KB Output is correct
11 Correct 15 ms 2664 KB Output is correct
12 Correct 16 ms 2976 KB Output is correct
13 Correct 6 ms 1604 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1236 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1 ms 1284 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 47 ms 5292 KB Output is correct
10 Correct 32 ms 5008 KB Output is correct
11 Correct 14 ms 2568 KB Output is correct
12 Correct 16 ms 2900 KB Output is correct
13 Correct 6 ms 1620 KB Output is correct
14 Runtime error 29 ms 10440 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -