Submission #576884

#	Time	Username	Problem	Language	Result	Execution time	Memory
576884		mosiashvililuka	Gondola (IOI14_gondola)	C++14	55 / 100	28 ms	3256 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,e,i,j,ii,jj,zx,xc,f[300009],fx[300009],pi,ee,WA;
int valid(int Nn, int inputSeq[])
{
    a=Nn;
    for(i=1; i<=a; i++) f[i]=inputSeq[i-1];
    set <int> SAE;
    for(i=1; i<=a; i++){
        if(f[i]<=a){
            c=f[i]-i+a*2;c%=a;
            SAE.insert(c);
        }
    }
    if(SAE.size()>=2) return 0;
    for(i=1; i<=a; i++){
        if(fx[f[i]]!=0) return 0;
        fx[f[i]]=1;
    }
    return 1;
}

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

int replacement(int Nn, int gondolaSeq[], int replacementSeq[])
{
    a=Nn;WA=1;
    for(i=1; i<=a; i++){
        f[i]=gondolaSeq[i-1];
    }
    for(i=1; i<=a; i++){
        if(f[i]>a){
            fx[f[i]]=i;
            if(e<f[i]){
                e=f[i];ee=i;
            }
        }else{
            WA=f[i]-i;
        }
    }
    for(i=1; i<=a; i++){
        f[i]=WA+i+a*3;f[i]%=a;
        if(f[i]==0) f[i]=a;
    }
    for(i=a+1; i<=e; i++){
        if(fx[i]==0){
            replacementSeq[pi]=/*ee*/f[ee];
            f[ee]=i;
        }else{
            c=fx[i];
            replacementSeq[pi]=/*fx[i]*/f[c];
        }
        pi++;
    }
    return pi;
}

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

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

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