Submission #1278821

#	Time	Username	Problem	Language	Result	Execution time	Memory
1278821		stanwaibbange	곤돌라 (IOI14_gondola)	C++20	20 / 100	10 ms	1348 KiB

gondola

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

#include "gondola.h"
const int INF = numeric_limits<int>::max() / 2;

int valid(int n, int inputSeq[])
{
  int minv = INF;
  int index = -1;
  for (int i = 0; i < n; ++i)
  {
    if (inputSeq[i] <= 0)
    {
      return 0;
    }
    if (inputSeq[i] <= n)
    {
      minv = inputSeq[i] - i;
      index = i;
      break;
    }
  }
  for (int i = index + 1; i < n; ++i)
  {
    if (inputSeq[i] <= 0)
    {
      return 0;
    }
    if (inputSeq[i] <= n)
    {
      if (inputSeq[i]%n != (minv + i)%n)
      {
        return 0;
      }
    }
  }
  sort(inputSeq,inputSeq+n);
  int last = -1;
  for (int i = 0; i < n; ++i)
  {
    if (inputSeq[i] == last) {
      return 0;
    }
    last = inputSeq[i];
  }
  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