Submission #69620

#	Time	Username	Problem	Language	Result	Execution time	Memory
69620		MANcity	Gondola (IOI14_gondola)	C++14	0 / 100	3 ms	672 KiB

gondola

#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<cstring>
#include<vector>
#include "gondola.h"
using namespace std;
#define for1(i,n) for(int i=1;i<=(int)n;i++)
#define for0(i,n) for(int i=0;i<=(int)n;i++)
#define forn(i,n) for(int i=n;i>=1;i--)
#define fo(i,x,y) for(int i=x;i<=(int)y;i++)
#define fr(i,x,y) for(int i=x;i>=(int)y;i--)
#define pb push_back
#define mp make_pair
#define LL long long
const LL Mod=1000*1000*1000+7;
int is_lessn[250002];
int num[250002];
int valid(int n, int inputSeq[])
{
    for0(i,n-1)
        num[inputSeq[i]]++;
    for1(i,250002)
        if(num[i]>=2)
            return 0;
    for0(i,n-1)
    {
        if(inputSeq[i]<=n)
        {
            int N=inputSeq[i];
            fo(j,i+1,n-1)
            {
                N++;
                if(N>n)
                    N-=n;
                if(inputSeq[j]<=n && inputSeq[j]!=N)
                    return 0;
            }
            fo(j,0,i-1)
            {
                N++;
                if(N>n)
                    N-=n;
                if(inputSeq[j]<=n && inputSeq[j]!=N)
                    return 0;
            }
            return 1;
        }
    }
    return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
    vector<pair<int,int> > V;
    for0(i,n-1)
    {
        if(gondolaSeq[i]<=n)
        {
            int N=gondolaSeq[i];
            V.push_back({gondolaSeq[i],N});
            fo(j,i+1,n-1)
            {
                N++;
                if(N>n)
                    N-=n;
                V.push_back({gondolaSeq[j],N});
            }
            fo(j,0,i-1)
            {
                N++;
                if(N>n)
                    N-=n;
                V.push_back({gondolaSeq[j],N});
            }
        }
    }
        sort(V.begin(),V.end());
        int q=n+1;
        int num=-1;
        for0(i,V.size()-1)
        {
            if(V[i].first!=V[i].second)
            {
                num++;
                replacementSeq[num]=V[i].second;
                q++;
                fo(j,q-1,V[i].first-1)
                {
                    num++;
                    replacementSeq[num]=j;
                }
                q=V[i].first+1;
            }
        }
        return (num+1);
}

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}
/*
4 5
8 12 2 10 11
*/

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 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