제출 #292221

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

gondola

#include "gondola.h"
//#include "grader.cpp"

#include <set>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int MAXN = 1e5 + 5;

namespace Valid
{
    bool seen[MAXN];
    bool sortedL[MAXN], sortedR[MAXN];

    bool check(int n, int a[], int relevant)
    {
        int maxVal = 0;
        for(int i = 0;i<n;i++)
        {
            maxVal = max(maxVal, a[i]);
            sortedL[i] = sortedR[i] = false;
        }

        for(int i = 0;i<=maxVal;i++)
        {
            seen[i] = false;
        }

        for(int i = 0;i<n;i++)
        {
            if(seen[ a[i] ]==true) return false;
            seen[ a[i] ] = true;
        }

        sortedL[0] = true;
        for(int i = 1;i<n;i++)
        {
            if(a[i]>relevant) sortedL[i] = sortedL[i-1];
            else sortedL[i] = (sortedL[i-1]&(a[i-1]<a[i]));
        }

        sortedR[n-1] = true;
        for(int i = n-2;i>=0;i--)
        {
            if(a[i]>relevant) sortedR[i] = sortedR[i+1];
            else sortedR[i] = (sortedR[i+1]&(a[i]<a[i+1]));
        }

        if(sortedL[n-1]==true) return true;
        for(int i = 0;i<n-1;i++)
        {
            if(sortedL[i]==true && sortedR[i+1]==true)
            {
                if(a[i]>relevant || a[i+1]>relevant)
                {
                    if((a[i]>relevant && seen[n]==false) && (a[i+1]>relevant && seen[1]==false))
                    {
                        return true;
                    }
                }
                else
                {
                    if(a[i]==n && a[i+1]==1)
                    {
                        return true;
                    }
                }
            }
        }

        return false;
    }
};

int valid(int n, int inputSeq[])
{
  return Valid::check(n, inputSeq, n);
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

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

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

• 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: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10