oj.uz

답안 #879445

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
879445 2023-11-27T12:55:07 Z JakobZorz 곤돌라 (IOI14_gondola) C++14
80 / 100
 32 ms 5316 KB 
#include"gondola.h"
#include<iostream>
#include<unordered_set>
#include<vector>
#include<algorithm>
using namespace std;

int valid(int n,int inputSeq[]){
    unordered_set<int>s(inputSeq,inputSeq+n);
    if((int)s.size()!=n){
        return 0;
    }
    
    int curr=-1;
    for(int i=0;i<2*n;i++){
        if(curr==-1&&inputSeq[i%n]<=n)
            curr=inputSeq[i%n];
        
        if(inputSeq[i%n]<=n&&curr!=inputSeq[i%n]){
            return 0;
        }
        
        if(curr!=-1){
            curr++;
            if(curr==n+1)
                curr=1;
        }
    }
    return 1;
}

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

int replacement(int n,int gondolaSeq[],int replacementSeq[]){
    int len=0;
    int mx=0;
    for(int i=0;i<n;i++)
        mx=max(mx,gondolaSeq[i]);
    len=mx-n;
    for(int i=0;i<len;i++)
        replacementSeq[i]=0;
    
    bool present=false;
    for(int i=0;i<n;i++)
        if(gondolaSeq[i]<=n)
            present=true;
    
    if(len==0)
        return 0;
    
    
    if(present){
        int curr=-1;
        for(int i=0;i<2*n;i++){
            if(curr==-1&&gondolaSeq[i%n]<=n)
                curr=gondolaSeq[i%n];
            
            if(i>=n&&gondolaSeq[i%n]<mx&&gondolaSeq[i%n]>n){
                replacementSeq[gondolaSeq[i%n]-n-1]=curr;
            }
            
            curr++;
            if(curr==n+1)
                curr=1;
        }
        
        curr=-1;
        for(int i=0;i<2*n;i++){
            if(curr==-1&&gondolaSeq[i%n]<=n)
                curr=gondolaSeq[i%n];
            
            if(i>=n&&gondolaSeq[i%n]==mx){
                for(int i=0;i<len;i++){
                    if(replacementSeq[i]==0){
                        replacementSeq[i]=curr;
                        curr=i+n+1;
                    }
                }
                break;
            }
            
            curr++;
            if(curr==n+1)
                curr=1;
        }
    }else{
        for(int i=0;i<n;i++){
            if(gondolaSeq[i]<mx&&gondolaSeq[i]>n){
                replacementSeq[gondolaSeq[i]-n-1]=i+1;
            }
        }
        for(int i=0;i<n;i++){
            if(gondolaSeq[i]==mx){
                int curr=i+1;
                for(int i=0;i<len;i++){
                    if(replacementSeq[i]==0){
                        replacementSeq[i]=curr;
                        curr=i+n+1;
                    }
                }
            }
        }
    }
    
    return len;
}

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

const int MOD=1e9+9;
typedef long long ll;

ll powm(ll base,ll exp){
    ll res=1;
    for(int i=0;i<=30;i++){
        if(exp&(1<<i)){
            res=res*base%MOD;
        }
        base=base*base%MOD;
    }
    return res;
}

int countReplacement(int n,int inputSeq[]){
    vector<int>arr;
    if(valid(n,inputSeq)==0)
        return 0;
    
    for(int i=0;i<n;i++)
        if(inputSeq[i]>n)
            arr.push_back(inputSeq[i]);
    sort(arr.begin(),arr.end());
    ll res=1;
    int prev=n;
    for(int i=0;i<(int)arr.size();i++){
        res=res*powm(arr.size()-i,arr[i]-prev-1)%MOD;
        prev=arr[i];
    }
    
    bool present=false;
    for(int i=0;i<n;i++)
        if(inputSeq[i]<=n)
            present=true;
    
    if(!present)
        res=res*n%MOD;
    
    return(int)res;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 5 ms 2140 KB Output is correct
7 Correct 10 ms 3932 KB Output is correct
8 Correct 10 ms 3828 KB Output is correct
9 Correct 3 ms 1372 KB Output is correct
10 Correct 11 ms 4308 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 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 444 KB Output is correct
5 Correct 0 ms 352 KB Output is correct
6 Correct 6 ms 2144 KB Output is correct
7 Correct 11 ms 3840 KB Output is correct
8 Correct 10 ms 4100 KB Output is correct
9 Correct 4 ms 1632 KB Output is correct
10 Correct 11 ms 4448 KB Output is correct
11 Correct 0 ms 352 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 5 ms 2140 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 12 ms 4704 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 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 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 6 ms 1116 KB Output is correct
12 Correct 9 ms 1336 KB Output is correct
13 Incorrect 10 ms 1372 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 444 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
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 344 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 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 21 ms 4060 KB Output is correct
10 Correct 17 ms 3420 KB Output is correct
11 Correct 7 ms 1368 KB Output is correct
12 Correct 9 ms 1588 KB Output is correct
13 Correct 3 ms 1012 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 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 356 KB Output is correct
5 Correct 0 ms 356 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 21 ms 3960 KB Output is correct
10 Correct 20 ms 3432 KB Output is correct
11 Correct 7 ms 1384 KB Output is correct
12 Correct 9 ms 1640 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 28 ms 4712 KB Output is correct
15 Correct 32 ms 5316 KB Output is correct
16 Correct 6 ms 1344 KB Output is correct
17 Correct 21 ms 3688 KB Output is correct
18 Correct 14 ms 2136 KB Output is correct