oj.uz

Submission #745221

# Submission time Handle Problem Language Result Execution time Memory
745221 2023-05-19T15:04:50 Z rainboy Best Place (NOI17_bestplace) C
100 / 100
 66 ms 3000 KB 
#include <stdio.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 main() {
	static int xx[N], yy[N];
	int n, i;

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d%d", &xx[i], &yy[i]);
	sort(xx, 0, n);
	sort(yy, 0, n);
	printf("%d %d\n", xx[n / 2], yy[n / 2]);
	return 0;
}

Compilation message

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

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 228 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 1 ms 224 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 224 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 224 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 2 ms 224 KB Output is correct
4 Correct 1 ms 224 KB Output is correct
5 Correct 1 ms 224 KB Output is correct
6 Correct 1 ms 224 KB Output is correct
7 Correct 1 ms 296 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2056 KB Output is correct
2 Correct 32 ms 2116 KB Output is correct
3 Correct 34 ms 2136 KB Output is correct
4 Correct 30 ms 2152 KB Output is correct
5 Correct 28 ms 2176 KB Output is correct
6 Correct 50 ms 2100 KB Output is correct
7 Correct 34 ms 2080 KB Output is correct
8 Correct 47 ms 2148 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 288 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 216 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 1 ms 216 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 316 KB Output is correct
2 Correct 1 ms 216 KB Output is correct
3 Correct 1 ms 300 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 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 300 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 2940 KB Output is correct
2 Correct 55 ms 2976 KB Output is correct
3 Correct 33 ms 2912 KB Output is correct
4 Correct 62 ms 2272 KB Output is correct
5 Correct 64 ms 2876 KB Output is correct
6 Correct 66 ms 3000 KB Output is correct
7 Correct 66 ms 2964 KB Output is correct
8 Correct 51 ms 2980 KB Output is correct