제출 #16360

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
16360		atomzeno	곤돌라 (IOI14_gondola)	C++98	25 / 100	17 ms	7332 KiB

gondola

#include "gondola.h"
int d[250001],check[250001];
int puting[250001],l,indi[250001],indian[250001],ind;
int valid(int n, int inputSeq[]){
    int i,cnt=0,ind;
    for(i=0;i<=250000;i++){
        check[i]=0;
    }
    for(i=0;i<n;i++){
        if(inputSeq[i]<=n){
            cnt=1;
            ind=(inputSeq[i]-1-i)+n;
            ind%=n;
            break;
        }
    }
    for(i=0;i<n;i++){
        check[inputSeq[i]]++;
        if(check[inputSeq[i]]>=2){return 0;}
    }
    if(cnt==0){return 1;}
    for(i=0;i<n;i++){
        d[(ind+i)%n]=inputSeq[i];
    }
    for(i=0;i<n;i++){
        if(d[i]<=n&&d[i]!=(i+1)){
            return 0;
        }
    }
    return 1;
}
int replacement(int n, int gondolaSeq[], int replacementSeq[]){
    l=0;
    int o=-1,i,op=0;
    ind=0;
    for(i=0;i<n;i++){
        if(gondolaSeq[i]<=n){
            ind=(gondolaSeq[i]-1-i)+n;
            ind%=n;
            op=1;
            break;
        }
    }
    if(op==1){
        for(i=0;i<n;i++){
            d[(ind+i)%n]=gondolaSeq[i];
        }
        for(i=0;i<=250000;i++){
            check[i]=0;
        }
        for(i=0;i<n;i++){
            check[d[i]]++;
            o=o>d[i]?o:d[i];
            indi[d[i]]=1;
            indian[d[i]]=i;
        }
        for(i=o;i>n;i--){
            if(indi[i]==0){continue;}
            if(indi[i-1]!=0){
                puting[l]=indian[i]+1;
                l++;
            }
            if(indi[i-1]==0){
                puting[l]=i-1;
                indi[i-1]=1;
                indian[i-1]=indian[i];
                l++;
            }
        }
        for(i=0;i<l;i++){
            replacementSeq[i]=puting[i];
        }
        return l;
    }
    else{
        int h=1;
        for(i=o;i>n;i--){
            if(indi[i]==0){continue;}
            if(indi[i-1]!=0){
                puting[l]=h++;
                l++;
            }
            if(indi[i-1]==0){
                puting[l]=i-1;
                indi[i-1]=1;
                l++;
            }
        }
        for(i=0;i<l;i++){
            replacementSeq[i]=puting[i];
        }

        return l;
    }
}

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

int countReplacement(int n, int inputSeq[]){
    return -3;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10