제출 #1304135

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1304135		the_commando_x	곤돌라 (IOI14_gondola)	C++17	20 / 100	31 ms	4668 KiB

gondola

#include "gondola.h"

#include <bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[])
{
  set<int> seen;
  for (int i = 0; i < n; ++i)
    if (seen.count(inputSeq[i]))
      return 0;
    else
      seen.insert(inputSeq[i]);

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

  if (start != -1)
  {
    int base = inputSeq[start];
    for (int i = 0; i < n; ++i)
    {
      int expected = (base + i - start) % n;
      if (expected <= 0)
        expected += n;

      if (inputSeq[i] <= n && inputSeq[i] != expected)
        return 0;
    }
  }

  int nextReplacement = n + 1;
  for (int i = 0; i < n; ++i)
    if (inputSeq[i] > n)
      if (inputSeq[i] < nextReplacement)
        return 0;
      else
        nextReplacement = inputSeq[i] + 1;

  return 1;
}

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

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: 10 / 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