Submission #230325

#	Time	Username	Problem	Language	Result	Execution time	Memory
230325		jhtan	Gondola (IOI14_gondola)	C++14	25 / 100	23 ms	640 KiB

gondola

#include "gondola.h"

int valid(int n, int inputSeq[])
{
  // subtask 1 and 2 and 3, 20 points
  int r = 1;
  for(int i=1; i<n; i++) {
    if(inputSeq[i] == 1 && inputSeq[i-1] != n) {
      r = 0;
      break;
    }
    if(inputSeq[i] != 1 && inputSeq[i-1] + 1 != inputSeq[i]) {
      r = 0;
      break;
    }
  }

  if(inputSeq[0] != 1 && inputSeq[n-1] + 1 != inputSeq[0]) r = 0;

  return r;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  // subtask 4, 5 points
  int l = 0;
  for(int i=0; i<n; i++)
    if(gondolaSeq[i] > n) {
      l = 1;
      if(i == 0) {
        if(gondolaSeq[1] == 1) replacementSeq[0] = n;
        else replacementSeq[0] = gondolaSeq[1] - 1;
      } else {
        if(gondolaSeq[i-1] == n) replacementSeq[0] = 1;
        else replacementSeq[0] = gondolaSeq[i-1] + 1;
      }
      break;
    }

  return l;
}

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 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