Submission #1264860

#	Time	Username	Problem	Language	Result	Execution time	Memory
1264860		ortsac	Gondola (IOI14_gondola)	C++17	20 / 100	24 ms	4932 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

int valid(int n, int inputSeq[]) {
  deque<int> v(n);
  for (int i = 0; i < n; i++) v[i] = inputSeq[i];
  set<int> s;
  for (auto u : v) s.insert(u);
  if (((int) s.size()) < n) return 0;
  int x = *min_element(v.begin(), v.end());
  if (x > n) return 1;
  while (v.front() != x) {
    v.push_front(v.back());
    v.pop_back();
  }
  int curr = x;
  for (int i = 1; i < n; i++) {
    if (v[i] > n) continue;
    if (v[i] != (x + i)) 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