oj.uz

Submission #478004

# Submission time Handle Problem Language Result Execution time Memory
478004 2021-10-05T03:23:08 Z sumit_kk10 Best Place (NOI17_bestplace) C++17
100 / 100
 39 ms 3028 KB 
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;

int main(){
	fast;
	int n;
	cin >> n;
	int x[n], y[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 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2128 KB Output is correct
2 Correct 24 ms 2224 KB Output is correct
3 Correct 24 ms 2256 KB Output is correct
4 Correct 23 ms 2232 KB Output is correct
5 Correct 23 ms 2264 KB Output is correct
6 Correct 27 ms 2152 KB Output is correct
7 Correct 28 ms 2104 KB Output is correct
8 Correct 26 ms 2244 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 3024 KB Output is correct
2 Correct 39 ms 2980 KB Output is correct
3 Correct 26 ms 3000 KB Output is correct
4 Correct 35 ms 2256 KB Output is correct
5 Correct 36 ms 3004 KB Output is correct
6 Correct 39 ms 2996 KB Output is correct
7 Correct 36 ms 3004 KB Output is correct
8 Correct 38 ms 3028 KB Output is correct