Submission #481176

#	Time	Username	Problem	Language	Result	Execution time	Memory
481176		rainboy	Drvca (COCI19_drvca)	C11	50 / 110	1089 ms	1612 KiB

drvca

#include <stdio.h>
#include <string.h>

#define N	100000

unsigned int X = 12345;

int rand_() {
	return (X *= 3) >> 1;
}

void sort(int *aa, int l, int r) {
	while (l < r) {
		int i = l, j = l, k = r, a = aa[l + rand_() % (r - l)], tmp;

		while (j < k)
			if (aa[j] == a)
				j++;
			else if (aa[j] < a) {
				tmp = aa[i], aa[i] = aa[j], aa[j] = tmp;
				i++, j++;
			} else {
				k--;
				tmp = aa[j], aa[j] = aa[k], aa[k] = tmp;
			}
		sort(aa, l, i);
		l = k;
	}
}

int check(int *aa, char *in, int n) {
	int i, a, b;

	a = -1, b = -1;
	for (i = 0; i < n; i++)
		if (!in[i]) {
			if (a != -1) {
				if (b != -1 && aa[i] - a != b)
					return 0;
				b = aa[i] - a;
			}
			a = aa[i];
		}
	return 1;
}

int solve(int *aa, int n, int a, int b) {
	static char in[N];
	int i, k;

	memset(in, 0, n * sizeof *in);
	k = 0;
	for (i = 0; i < n; i++)
		if (aa[i] == a) {
			in[i] = 1, a += b, k++;
			if (k < n && check(aa, in, n)) {
				printf("%d\n", k);
				for (i = 0; i < n; i++)
					if (in[i])
						printf("%d ", aa[i]);
				printf("\n");
				printf("%d\n", n - k);
				for (i = 0; i < n; i++)
					if (!in[i])
						printf("%d ", aa[i]);
				printf("\n");
				return 1;
			}
		}
	return 0;
}

int main() {
	static int aa[N];
	int n, i;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]);
	sort(aa, 0, n);
	if (!solve(aa, n, aa[0], aa[1] - aa[0]) && !solve(aa, n, aa[0], aa[2] - aa[0]) && !solve(aa, n, aa[1], aa[2] - aa[1])) {
		printf("-1\n");
		return 0;
	}
	return 0;
}

Compilation message (stderr)

drvca.c: In function 'main':
drvca.c:77:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |  scanf("%d", &n);
      |  ^~~~~~~~~~~~~~~
drvca.c:79:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |   scanf("%d", &aa[i]);
      |   ^~~~~~~~~~~~~~~~~~~

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 0 / 30
• Subtask 4: 0 / 30