제출 #705373

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
705373		ToroTN	곤돌라 (IOI14_gondola)	C++14	55 / 100	17 ms	3020 KiB

gondola

#include<bits/stdc++.h>
using namespace std;
#include "gondola.h"
//#include "grader.cpp"
#define X first 
#define Y second
#define pb push_back
#define ll long long
int a[100005],b[100005];
int valid(int n, int inputSeq[])
{
    int type=1,pos[250005];
    for(int i=0;i<n;i++)
    {
        a[i+1]=inputSeq[i];
    }
    for(int i=1;i<=n;i++)pos[a[i]]=i;
    for(int i=1;i<n;i++)
    {
        if(!(pos[i]==n&&pos[i+1]==1)&&!(pos[i]+1==pos[i+1]))
        {
            type=0;
        }
    }
    return type;
}   

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

int replacement(int n, int gondolaSeq[], int peteza[])
{
    for(int i=0;i<n;i++)
    {
        a[i+1]=gondolaSeq[i];
    }
    int mx=0,origin[100005];
    for(int i=1;i<=n;i++)mx=max(mx,a[i]),origin[i]=i;
    for(int i=1;i<=n;i++)
    {
        if(a[i]<=n)
        {
            for(int j=i;j<i+n;j++)
            {
                if(j<=n)
                {
                    if(a[i]+j-i<=n)
                    {
                        origin[j]=a[i]+j-i;
                    }else
                    {
                        origin[j]=a[i]+j-i-n;
                    }
                }else
                {
                    if(a[i]+j-i<=n)
                    {
                        origin[j-n]=a[i]+j-i;
                    }else
                    {
                        origin[j-n]=a[i]+j-i-n;
                    }
                }
            }
            break;
        }
    }
    int it=-1;
    vector<pair<int,int> > v;
    v.pb({-1e9,-1e9});
    for(int i=1;i<=n;i++)v.pb({a[i],origin[i]});
    sort(v.begin(),v.end());
    for(int i=1;i<=n;i++)
    {
        if(v[i].X>n)
        {
            ++it;
            peteza[it]=v[i].Y;
            if(v[i-1].X>n)
            {
                for(int j=v[i-1].X+1;j<v[i].X;j++)
                {
                    ++it;
                    peteza[it]=j;
                }
            }else
            {
                for(int j=n+1;j<v[i].X;j++)
                {
                    ++it;
                    peteza[it]=j;
                }
            }
        }
    }
    return mx-n;
}

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

int countReplacement(int n, int inputSeq[])
{
    for(int i=0;i<n;i++)
    {
        a[i+1]=inputSeq[i];
    }
    return 0;
}

• 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