Submission #866651

#	Time	Username	Problem	Language	Result	Execution time	Memory
866651		Onur_Ilgaz	Gondola (IOI14_gondola)	C++17	20 / 100	30 ms	5204 KiB

gondola

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

int valid(int n, int arr[])
{
  int ind = 0, mn = inf;
  set <int> st;
  for(int i = 0; i < n; i++) {
    if(arr[i] < mn) ind = i, mn = arr[i];
    if(st.count(arr[i])) return 0;
    st.insert(arr[i]);
  }
  int now = mn + 1;
  // cout<<ind<<" "<<now<<" ";
  for(int i = (ind + 1) % n; i % n != ind; i = (i + 1) % n, now++) {
    if(arr[i] <= n and arr[i] != now) {
        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