Submission #1144866

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144866		x93bd0	Gondola (IOI14_gondola)	C++20	10 / 100	5 ms	584 KiB

gondola

#include "gondola.h"
#include <stdio.h>

int valid(int n, int inputSeq[])
{
  int x;
  for (x = 0; x < n; x++) {
    if (inputSeq[x] <= n)
      break;
  }

  if (x == n) return 1;
  for (int i = 0; i < n; i++) {
    int idx = i < inputSeq[x] ? (x + n - (inputSeq[x] - (i + 1))) : x + ((i + 1) - inputSeq[x]);
    int v = inputSeq[idx % n];
    if (v > n || v == (i + 1)) continue;
    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: 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