Submission #39714

#	Time	Username	Problem	Language	Result	Execution time	Memory
39714		funcsr	곤돌라 (IOI14_gondola)	C++14	20 / 100	16 ms	3848 KiB

gondola

#include "gondola.h"
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()

int A[100000];
int cnt[250000];
int valid(int N, int inputSeq[]) {
  rep(i, N) A[i] = inputSeq[i]-1;
  rep(i, N) cnt[A[i]]++;
  rep(i, 250000) if (cnt[i] > 1) return 0;
  int base = -1;
  rep(i, N) if (A[i] < N) base = (A[i]-i+N)%N;
  if (base == -1) return 1;
  rep(i, N) if (A[i] < N && (i+base)%N != A[i]) return 0;
  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