Submission #131339

#	Time	Username	Problem	Language	Result	Execution time	Memory
131339		Mahdi_Jfri	Gondola (IOI14_gondola)	C++14	10 / 100	14 ms	632 KiB

gondola

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

using namespace std;

#define ll long long
#define pb push_back

const int maxn = 1e5 + 20;

int valid(int n, int a[])
{
	for(int i = 0; i < n; i++)
	{
		a[i]--;
		if(a[i] < 0)
			return 0;
	}

	int f = 1;
	for(int i = 0; i < n; i++)
		if(a[i] < n)
			f &= (a[(i + 1) % n] > n || a[(i + 1) % n] == (a[i] + 1) % n);

	return f;
}

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

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