Submission #918313

#	Time	Username	Problem	Language	Result	Execution time	Memory
918313		contest_alt	Gondola (IOI14_gondola)	C++17	20 / 100	11 ms	1372 KiB

gondola

#include "gondola.h"

#include <algorithm>
#include <vector>

int valid( int n, int inputSeq[] ) {
  int shift_min = n, shift_max = -1;

  std::vector<int> vals( n );
  
  for( int i = 0 ; i < n ; i++ ){
    if( inputSeq[i] > n )
      continue;

    if( inputSeq[i] <= 0 )
      return false;

    vals[i] = inputSeq[i];

    int shift = (inputSeq[i] - 1 + n - i) % n;

    shift_min = std::min( shift_min, shift );
    shift_max = std::max( shift_max, shift );
  }

  std::sort( vals.begin(), vals.end() );
  for( int i = 1 ; i < n ; i++ )
    if( vals[i - 1] == vals[i] )
      return false;

  if( shift_max < 0 )
    return true;
  
  return shift_min == shift_max;
}

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

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