Submission #1277275

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277275		Johann	Gondola (IOI14_gondola)	C++20	20 / 100	10 ms	1348 KiB

gondola

#include "gondola.h"

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

void shift_inputSeq(int n, int inputSeq[])
{
  for (int i = 0; i < n; ++i)
    --(inputSeq[i]);
}

int valid(int n, int inputSeq[])
{
  shift_inputSeq(n, inputSeq);

  int fixPoint = -1;
  for (int i = 0; i < n; ++i)
  {
    if (inputSeq[i] < n)
    {
      int shift = (n + i - inputSeq[i]) % n;
      if (fixPoint == -1)
        fixPoint = shift;
      else if (fixPoint != shift)
        return 0;
    }
  }

  sort(inputSeq, inputSeq + n);
  for (int i = 0; i < n - 1; ++i)
    if (inputSeq[i] == inputSeq[i + 1])
      return 0;

  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