Submission #476224

#	Time	Username	Problem	Language	Result	Execution time	Memory
476224		rainboy	Cipele (COCI18_cipele)	C11	90 / 90	78 ms	2832 KiB

cipele

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

#define N	100000
#define M	100000
#define INF	0x3f3f3f3f

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 solve(int *aa, int n, int *bb, int m, int d) {
	int i, j;

	for (i = 0, j = 0; i < n; i++, j++) {
		while (j < m && aa[i] - bb[j] > d)
			j++;
		if (j == m || bb[j] - aa[i] > d)
			return 0;
	}
	return 1;
}

int main() {
	static int aa[N], bb[M], tt[N];
	int n, m, i, j, lower, upper, tmp;

	scanf("%d%d", &n, &m);
	for (i = 0; i < n; i++)
		scanf("%d", &aa[i]);
	for (j = 0; j < m; j++)
		scanf("%d", &bb[j]);
	if (n > m) {
		memcpy(tt, aa, n * sizeof *aa), memcpy(aa, bb, m * sizeof *bb), memcpy(bb, tt, n * sizeof *tt);
		tmp = n, n = m, m = tmp;
	}
	sort(aa, 0, n);
	sort(bb, 0, m);
	lower = -1, upper = INF;
	while (upper - lower > 1) {
		int d = (lower + upper) / 2;

		if (solve(aa, n, bb, m, d))
			upper = d;
		else
			lower = d;
	}
	printf("%d\n", upper);
	return 0;
}

Compilation message (stderr)

cipele.c: In function 'main':
cipele.c:49:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   49 |  scanf("%d%d", &n, &m);
      |  ^~~~~~~~~~~~~~~~~~~~~
cipele.c:51:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |   scanf("%d", &aa[i]);
      |   ^~~~~~~~~~~~~~~~~~~
cipele.c:53:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |   scanf("%d", &bb[j]);
      |   ^~~~~~~~~~~~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 9 / 9
• Subtask 8: 9 / 9
• Subtask 9: 9 / 9
• Subtask 10: 9 / 9