Submission #1345005

#	Time	Username	Problem	Language	Result	Execution time	Memory
1345005		hyyh	Gondola (IOI14_gondola)	C++20	20 / 100	20 ms	4548 KiB

gondola

#include "gondola.h"
#include <set>
#include <iostream>

using namespace std;

int valid(int n, int arr[])
{
  int should = -n-10;
  set<int> st;
  for(int i{};i < n;i++){
    should++;
    if(should == n+1) should = 1;
    //cout << should << endl;
    if(st.count(arr[i])) return 0;
    st.insert(arr[i]);
    if(arr[i] <= n){
      if(should <= 0) should = arr[i];
      else if(should != arr[i]) return 0;
    }
    else if(arr[i] <= 0) return 0;
    should = arr[i];
  }
  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