Submission #1025349

#	Time	Username	Problem	Language	Result	Execution time	Memory
1025349		HappyCapybara	Gondola (IOI14_gondola)	C++17	10 / 100	7 ms	1212 KiB

gondola

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

int valid(int n, int inputSeq[]){
  int x = -1;
  for (int i=0; i<n; i++){
    if (inputSeq[i] <= n){
      if (x != -1 && x != inputSeq[i]) return 0;
      if (x == -1) x = inputSeq[i];
    }
    if (x != -1) x = (x % n) + 1;
  }
  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: 0 / 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