oj.uz

Submission #826251

# Submission time Handle Problem Language Result Execution time Memory
826251 2023-08-15T11:33:24 Z rainboy Table Tennis (info1cup20_tabletennis) C
87 / 100
 3000 ms 2524 KB 
#include <stdio.h>

#define N	150000
#define K	400
#define M	((K + 1) * (K + 1))

int max(int a, int b) { return a > b ? a : b; }

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 main() {
	static int aa[N + K], ss[M], kk[M];
	static char used[N + K];
	int n, m, k, h, i, j, s, cnt;

	scanf("%d%d", &n, &k);
	for (i = 0; i < n + k; i++)
		scanf("%d", &aa[i]);
	m = 0;
	for (i = 0; i <= k; i++)
		for (j = n + k - 1; j > i && j >= n - 1; j--)
			ss[m++] = aa[i] + aa[j];
	sort(ss, 0, m);
	for (i = 0; i < n + k; i++)
		for (j = max(n - 1 - i, i + 1), h = 0; j < n + k && i + j <= n - 1 + k * 2; j++) {
			s = aa[i] + aa[j];
			while (h < m && ss[h] < s)
				h++;
			if (h < m && ss[h] == s)
				kk[h]++;
		}
	for (h = 0; h < m; h++)
		if (kk[h] >= n / 2) {
			for (i = 0, j = n + k - 1, cnt = 0; i < j && cnt < n / 2; i++) {
				while (i < j && aa[i] + aa[j] > ss[h])
					j--;
				if (i < j && aa[i] + aa[j] == ss[h])
					used[i] = used[j] = 1, cnt--;
			}
			for (i = 0; i < n + k; i++)
				if (used[i])
					printf("%d ", aa[i]);
			printf("\n");
			return 0;
		}
	return 0;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 596 KB Output is correct
2 Correct 24 ms 2416 KB Output is correct
3 Correct 26 ms 2500 KB Output is correct
4 Correct 23 ms 2488 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2392 KB Output is correct
2 Correct 23 ms 2452 KB Output is correct
3 Correct 24 ms 2524 KB Output is correct
4 Correct 23 ms 2388 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #7
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 59 ms 2476 KB Output is correct
3 Correct 31 ms 2380 KB Output is correct
4 Correct 36 ms 2440 KB Output is correct
5 Correct 37 ms 2380 KB Output is correct
6 Correct 50 ms 2508 KB Output is correct
7 Correct 46 ms 2508 KB Output is correct
8 Correct 36 ms 2380 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 980 KB Output is correct
2 Execution timed out 3069 ms 2024 KB Time limit exceeded
3 Halted 0 ms 0 KB -