Submission #1146203

#	Time	Username	Problem	Language	Result	Execution time	Memory
1146203		julia_08	Gondola (IOI14_gondola)	C++20	20 / 100	6 ms	1348 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 3e5 + 10;

int marc[MAXN];

int id(int x, int n){
  if(x == -1) return n - 1;
  if(x == n) return 0;
  return x;
}

int valid(int n, int inputSeq[]){

  int pos_1 = -1;

  for(int i=0; i<n; i++){
    if(inputSeq[i] == 1) pos_1 = i;
    marc[inputSeq[i]] = 0;
  }

  for(int i=0; i<n; i++){
    marc[inputSeq[i]] ++;
    if(marc[inputSeq[i]] > 1) return 0;
  }

  int cur_pos = id(pos_1 + 1, n);

  while(cur_pos != pos_1){
    if(inputSeq[cur_pos] <= n && inputSeq[id(cur_pos - 1, n)] <= n && inputSeq[cur_pos] != inputSeq[id(cur_pos - 1, n)] + 1) return 0;
    cur_pos = id(cur_pos + 1, n);
  }

  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