oj.uz

Submission #482293

# Submission time Handle Problem Language Result Execution time Memory
482293 2021-10-24T03:21:40 Z ac2hu Best Place (NOI17_bestplace) C++14
100 / 100
 36 ms 3064 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int x[100001],y[100001];
void solve(){
	int n;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] << "\n";
}
signed main(){
	iostream::sync_with_stdio(false);cin.tie(NULL);
	int TTT = 1;
	//cin >> TTT;
	while(TTT--){
		solve();
	}
}

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 1 ms 204 KB Output is correct

Subtask #2
20.0 / 20.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 324 KB Output is correct
4 Correct 1 ms 384 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 15 ms 1100 KB Output is correct
2 Correct 21 ms 1104 KB Output is correct
3 Correct 21 ms 1740 KB Output is correct
4 Correct 16 ms 2252 KB Output is correct
5 Correct 26 ms 2192 KB Output is correct
6 Correct 21 ms 2180 KB Output is correct
7 Correct 22 ms 2124 KB Output is correct
8 Correct 22 ms 2212 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 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 1224 KB Output is correct
2 Correct 33 ms 2940 KB Output is correct
3 Correct 25 ms 3012 KB Output is correct
4 Correct 30 ms 2252 KB Output is correct
5 Correct 31 ms 3016 KB Output is correct
6 Correct 32 ms 2924 KB Output is correct
7 Correct 36 ms 2980 KB Output is correct
8 Correct 34 ms 3064 KB Output is correct