Submission #1282573

#	Time	Username	Problem	Language	Result	Execution time	Memory
1282573		repmann	Gondola (IOI14_gondola)	C++20	20 / 100	24 ms	5468 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
int N;
int A[200000];
int valid(int n, int a[])
{
  N = n;
  set <int> SET;
  for(int i = 0; i < N; i++) if(!SET.insert(a[i]).second) return 0;
  for(int i = 0; i < N; i++) A[i] = A[i + N] = a[i];
  int index = 0;
  for(int i = 1; i < N; i++) if(A[i] < A[index]) index = i;
  if(A[index] > N) return 1;
  for(int i = index; i < (index + N); i++)
  {
    if((A[i] <= N) && (A[index] != (A[i] - (i - index)))) return 0;
  }
  return 1;
}
int replacement(int n, int a[], int O[])
{
  return 0;
}
int countReplacement(int n, int a[])
{
  return 0;
}
//int main()
//{
//  int n;
//  cin >> n;
//  int a[n];
//  for(int i = 0; i < n; i++) cin >> a[i];
//  cout << valid(n, a) << '\n';
//}

• 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