oj.uz

Submission #487676

# Submission time Handle Problem Language Result Execution time Memory
487676 2021-11-16T11:39:38 Z desmond_willow Best Place (NOI17_bestplace) C++17
100 / 100
 100 ms 1060 KB 
#include <bits/stdc++.h>

using namespace std;

int main () {
	uint n; cin >> n;
	uint x[n], y[n];
	for (uint i = 0; i < n; i++) cin >> x[i] >> y[i];
	sort(x, x+n); sort(y, y+n);
	if (n % 2 != 0) printf("%d %d\n", x[n/2], y[n/2]);
	else printf ("%d %d\n", (x[(n/2)-1] + x[n/2])/2, (y[(n/2)-1] + y[n/2])/2);
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 972 KB Output is correct
2 Correct 59 ms 1040 KB Output is correct
3 Correct 68 ms 1048 KB Output is correct
4 Correct 69 ms 1056 KB Output is correct
5 Correct 58 ms 1048 KB Output is correct
6 Correct 61 ms 972 KB Output is correct
7 Correct 62 ms 972 KB Output is correct
8 Correct 63 ms 1044 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 292 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 972 KB Output is correct
2 Correct 86 ms 1060 KB Output is correct
3 Correct 81 ms 1040 KB Output is correct
4 Correct 76 ms 1044 KB Output is correct
5 Correct 88 ms 972 KB Output is correct
6 Correct 89 ms 972 KB Output is correct
7 Correct 87 ms 1052 KB Output is correct
8 Correct 87 ms 1060 KB Output is correct