Submission #1323382

#	Time	Username	Problem	Language	Result	Execution time	Memory
1323382		hynmj	Gondola (IOI14_gondola)	C++20	0 / 100	0 ms	332 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int valid(int n, int a[])
{
  set<int> s;
  for (int i = 0; i < n; i++)
  {
    a[i]--;
    s.insert(a[i]);
  }
  if (s.size() != n)
    return 0;
  int j = 0;
  bool ok = 1;
  for (int i = 0; i < n; i++)
  {
    if (a[i] < n)
    {
      ok = 0;
      j = (i - a[i] + n) % n;
      break;
    }
  }
  if (ok)
    return 1;
  for (int k = 0; k < n; k++, j++)
  {
    if (a[j] < n && a[j] != k)
    {
      return 0;
    }
  }
  return 1;
}

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

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

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

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

• Subtask 1: 0 / 5
• Subtask 2: 0 / 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