Submission #7668

#	Time	Username	Problem	Language	Result	Execution time	Memory
7668		dohyun0324	Gondola (IOI14_gondola)	C++98	25 / 100	16 ms	3820 KiB

gondola

#include "gondola.h"
int ch[100010],visit[250010];
int valid(int n, int inputSeq[])
{
    int i,k=0;
    for(i=0;i<n;i++)
    {
        if(visit[inputSeq[i]]==1) return 0;
        visit[inputSeq[i]]=1;
        if(inputSeq[i]<=n) ch[inputSeq[i]]=i+1;
    }
    for(i=1;i<=n;i++)
    {
        if(ch[i]!=0 && k==0)
        {
            k=ch[i];
            continue;
        }
        if(k!=0)
        {
            k++;
            if(k>n) k=1;
        }
        if(ch[i]!=0 && k!=ch[i]) return 0;
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int i,big=0,k=0,w=0;
    for(i=0;i<n;i++)
    {
        ch[gondolaSeq[i]]=1;
        if(big<gondolaSeq[i]) big=gondolaSeq[i];
    }
    for(i=1;i<=big;i++)
    {
        if(ch[i]==0) replacementSeq[w++]=i;
    }
    return w;
}

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

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