Submission #1136114

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

gondola

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

int valid(int n, int inputSeq[])
{
  vector<bool> mrk(3e5, false);
  int pos_mini = 0;
  for (int i = 0; i < n; i++) {
    if (inputSeq[pos_mini] > inputSeq[i]) {
      pos_mini = i;
    }
    if (mrk[inputSeq[i]]) {
      return 0;
    }
    mrk[inputSeq[i]] = true;
  }

  if (inputSeq[pos_mini] > n) {
    return true;
  }

  int pos = pos_mini;
  for (int x = 1; x <= n; x++) {
    if (inputSeq[pos] <= n && inputSeq[pos] != x) {
      return false;
    }
    pos++;
    if (pos >= n) pos = 0;
  }

  return true;
}

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

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