Submission #1360681

#	Time	Username	Problem	Language	Result	Execution time	Memory
1360681		nini_gvenetadze	Gondola (IOI14_gondola)	C++20	25 / 100	965 ms	756 KiB

gondola

#include<bits/stdc++.h>
using namespace std;
#include "gondola.h"
int valid(int n, int inputseq[])
{
    for(int i=0; i<n; i++)
    {
        for(int j=i+1; j<n; j++)
        {
            if(inputseq[i]==inputseq[j])
            {
                return 0;
            }
        }
    }

    int k=-1; 
    int c=-1; 
    for(int i=0; i<n; i++)
    {
        if(inputseq[i]<=n)
        {
            if(c==-1)
            {
                c=inputseq[i];
                k=i;
                continue;
            }

            if(inputseq[i]==1)
            {
                c=inputseq[i];
                k=i;
                continue;
            }

            if(inputseq[i]-c!=i-k)
            {
                return 0;
            }

            c=inputseq[i];
            k=i;
        }
    }

    return 1;
}

int replacement(int n, int gondolaseq[],  int replacementseq[])
{
    int a[2*n];
    int ans=0;
    for(int i=0; i<n; i++)
    {
        a[i]=gondolaseq[i];
        a[i+n]=gondolaseq[i];
    }
    vector<pair<int, int>> v;

    int ind=-1;

    for(int i=0; i<n; i++)
    {
        if(a[i]<=n)
        {
            ind=i;
            int x=a[i];
            for(int j=i; j<i+n; j++)
            {
                if(a[j]!=x)
                {
                    v.push_back({a[j], x});
                }
                x++;
                if(x>n) x=1;
            }
            break;
        }
    }
    if(ind==-1)
    {
        for(int i=0; i<n; i++)
        {
            replacementseq[i]=i+1;
        }
        return n;
    }
    sort(v.begin(), v.end());

    int k=n+1;
    for(int i=0; i<(int)v.size(); i++)
    {
        replacementseq[ans++]=v[i].second;
        while(k<v[i].first)
        {
        replacementseq[ans++]=k;
        k++;
        }
        if(k==v[i].first) k++;
    }
    return ans;
}







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

• 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