Submission #878460

#	Time	Username	Problem	Language	Result	Execution time	Memory
878460		JakobZorz	곤돌라 (IOI14_gondola)	C++14	35 / 100	12 ms	4464 KiB

gondola

#include"gondola.h"
#include<iostream>
#include<unordered_set>
using namespace std;

int valid(int n,int inputSeq[]){
    unordered_set<int>s(inputSeq,inputSeq+n);
    if(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;
        
        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;
}

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

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

Compilation message (stderr)

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:8:16: warning: comparison of integer expressions of different signedness: 'std::unordered_set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    8 |     if(s.size()!=n)
      |        ~~~~~~~~^~~

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