Submission #1166670

#	Time	Username	Problem	Language	Result	Execution time	Memory
1166670		HappyCapybara	Gondola (IOI14_gondola)	C++17	20 / 100	15 ms	5976 KiB

gondola

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

#define ll  long

int valid(int n, int inputSeq[]){
  vector<ll> v(n);
  ll ssf = (ll) pow(10, 10);
  int si;
  unordered_set<int> us;
  for (int i=0; i<n; i++){
    if (us.find(inputSeq[i]) != us.end()) return 0;
    us.insert(inputSeq[i]);
    if (inputSeq[i] < ssf){
      ssf = inputSeq[i];
      si = i;
    }
  }
  if (ssf > n) return 1;
  for (int i=0; i<n; i++){
    v[(ssf+i-1)%n] = inputSeq[(si+i)%n];
    if (v[i] <= n && v[i] != 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