제출 #415837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
415837		LouayFarah	Gondola (IOI14_gondola)	C++14	15 / 100	15 ms	972 KiB

gondola

#include "bits/stdc++.h"
#include "gondola.h"
using namespace std;
 
#define pb push_back
 
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return 1;
}
int countReplacement(int n, int inputSeq[])
{
  return 1;
}
 
vector<int> book;
vector<int> r;
int valid(int n, int inputSeq[])
{
    if(n==1)
        return 1;
    book.assign(n+1, 0);
    for(int i = 0; i<n; i++)
    {
        if(inputSeq[i]>n)
        {
            if(i==0)
            {
                if(inputSeq[n-1]==n)
                    inputSeq[i] = 1;
                else if(inputSeq[n-1]<n)
                    inputSeq[i] = inputSeq[n-1] + 1;
            }
            else
            {
                if(inputSeq[i-1]==n)
                    inputSeq[i] = 1;
                else if(inputSeq[i-1]<n)
                    inputSeq[i] = inputSeq[i-1] + 1;
            }
            continue;
        }
        book[inputSeq[i]]++;
        if(book[inputSeq[i]]>1)
        {
            return 0;
        }
    }

    int counter = 0;
    for(int i = 0; i<n; i++)
    {
        if(inputSeq[i]==1)
        {
            counter = i;
            break;
        }
    }

    int curr = 1;
    for(int k = 0; k<n; k++)
    {
        if(inputSeq[counter]!=curr)
            return 0;
        counter++;
        counter%=n;
        curr++;
    }

    return 1;
}

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