oj.uz

Submission #922310

# Submission time Handle Problem Language Result Execution time Memory
922310 2024-02-05T11:54:13 Z pcc Best Place (NOI17_bestplace) C++14
100 / 100
 31 ms 3932 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>


int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n;
	cin>>n;
	ll 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];
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2896 KB Output is correct
2 Correct 19 ms 3160 KB Output is correct
3 Correct 19 ms 3148 KB Output is correct
4 Correct 17 ms 3160 KB Output is correct
5 Correct 17 ms 3164 KB Output is correct
6 Correct 19 ms 3024 KB Output is correct
7 Correct 19 ms 2908 KB Output is correct
8 Correct 21 ms 3160 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 3932 KB Output is correct
2 Correct 28 ms 3920 KB Output is correct
3 Correct 19 ms 3928 KB Output is correct
4 Correct 30 ms 3160 KB Output is correct
5 Correct 31 ms 3932 KB Output is correct
6 Correct 28 ms 3932 KB Output is correct
7 Correct 29 ms 3924 KB Output is correct
8 Correct 28 ms 3928 KB Output is correct