Submission #140174

#	Time	Username	Problem	Language	Result	Execution time	Memory
140174		ggoh	곤돌라 (IOI14_gondola)	C++14	25 / 100	15 ms	1656 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>

int ch[250005],i;
int valid(int n, int inputSeq[])
{
    int ST=-1,st,C=1;
    for(i=0;i<n;i++)ch[i]=0;
    for(i=0;i<n;i++)
    {
      if(ch[inputSeq[i]]==1){C=0;break;}
      ch[inputSeq[i]]=1;
    }
    for(i=0;i<n;i++)
    {
        if(inputSeq[i]<=n)
        {
            st=i-inputSeq[i]+1;st=(st+n)%n;
            if(ST==-1)ST=st;
            else if(ST!=st){C=0;break;}
        }
    }
    return C;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    int ST=-1,m=-1,ba,sz=0;
    for(i=1;i<=250000;i++)ch[i]=-1;
    for(i=0;i<n;i++)
    {
        m=std::max(gondolaSeq[i],m);
        ch[gondolaSeq[i]]=i;
        if(gondolaSeq[i]<=n)ST=(i-gondolaSeq[i]+1+n)%n;
    }
    if(ST==-1)ST=0;
    ba=n;
    for(i=n+1;i<=m;i++)
    {
        if(ch[i]>=0)
        {
            replacementSeq[sz++]=(ch[i]-ST+n)%n+1;
            for(int j=ba;j<i;j++)
            {
                replacementSeq[sz++]=j;
            }
            ba=i;
        }
    }
    return m-n;
}

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

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