oj.uz

Submission #402583

# Submission time Handle Problem Language Result Execution time Memory
402583 2021-05-12T02:13:01 Z penguinhacker Best Place (NOI17_bestplace) C++14
100 / 100
 50 ms 3032 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const int mxN=1e5;
int n, x[mxN], y[mxN];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	for (int i=0; i<n; ++i)
		cin >> x[i] >> y[i];
	sort(x, x+n);
	sort(y, y+n);
	cout << x[n/2] << " " << y[n/2];
	return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2068 KB Output is correct
2 Correct 29 ms 2140 KB Output is correct
3 Correct 29 ms 2216 KB Output is correct
4 Correct 23 ms 2248 KB Output is correct
5 Correct 29 ms 2292 KB Output is correct
6 Correct 29 ms 2124 KB Output is correct
7 Correct 29 ms 2116 KB Output is correct
8 Correct 28 ms 2156 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2900 KB Output is correct
2 Correct 43 ms 3020 KB Output is correct
3 Correct 30 ms 2940 KB Output is correct
4 Correct 38 ms 2244 KB Output is correct
5 Correct 42 ms 3004 KB Output is correct
6 Correct 41 ms 3032 KB Output is correct
7 Correct 50 ms 3012 KB Output is correct
8 Correct 41 ms 2944 KB Output is correct