Submission #547222

#	Time	Username	Problem	Language	Result	Execution time	Memory
547222		Hanksburger	Gondola (IOI14_gondola)	C++17	20 / 100	23 ms	1492 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
int sorted[100005];
int valid(int n, int a[])
{
	for (int i=0; i<n; i++)
		sorted[i]=a[i];
	sort(sorted, sorted+n);
	for (int i=1; i<n; i++)
		if (sorted[i-1]==sorted[i])
			return 0;
	for (int i=0; i<n; i++)
	{
		if (a[i]<=n)
		{
			for (int j=i+1; j<i+n; j++)
				if (a[j%n]<=n && a[j%n]!=(a[i]+j-i-1)%n+1)
					return 0;
			return 1;
		}
	}
	return 1;
}
int replacement(int n, int a[], int b[])
{
	
}
int countReplacement(int n, int a[])
{
	
}

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:28:1: warning: no return statement in function returning non-void [-Wreturn-type]
   28 | }
      | ^
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:32:1: warning: no return statement in function returning non-void [-Wreturn-type]
   32 | }
      | ^

• 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