oj.uz

Submission #487987

# Submission time Handle Problem Language Result Execution time Memory
487987 2021-11-17T10:59:06 Z accord Best Place (NOI17_bestplace) C++14
100 / 100
 36 ms 1876 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
#define INF(t) numeric_limits<t>::max()

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0); cerr.tie(0);

	ll n; cin >> n;
	ll x[n], y[n];
	for(ll i = 0; i < n; i++) cin >> x[i] >> y[i];
	sort(x, x+n); sort(y, y+n);
	cout << x[(int)floor(n/2)] << " " << y[(int)floor(n/2)] << "\n";

}

Subtask #1
3.0 / 3.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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1868 KB Output is correct
2 Correct 20 ms 1868 KB Output is correct
3 Correct 24 ms 1868 KB Output is correct
4 Correct 17 ms 1868 KB Output is correct
5 Correct 19 ms 1872 KB Output is correct
6 Correct 20 ms 1876 KB Output is correct
7 Correct 22 ms 1872 KB Output is correct
8 Correct 21 ms 1868 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 1 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 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 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 0 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 36 ms 1740 KB Output is correct
2 Correct 32 ms 1868 KB Output is correct
3 Correct 22 ms 1868 KB Output is correct
4 Correct 27 ms 1868 KB Output is correct
5 Correct 31 ms 1868 KB Output is correct
6 Correct 32 ms 1868 KB Output is correct
7 Correct 31 ms 1868 KB Output is correct
8 Correct 30 ms 1872 KB Output is correct