oj.uz

Submission #503067

# Submission time Handle Problem Language Result Execution time Memory
503067 2022-01-07T05:17:18 Z devomega07 Best Place (NOI17_bestplace) C++14
100 / 100
 33 ms 3784 KB 
#include "bits/stdc++.h"
#define all(x) x.begin(),x.end()
#define int long long
//#define OSET
using namespace std;

#ifdef OSET
#include "C:\MinGW\lib\gcc\mingw32\6.3.0\include\c++\ext\pb_ds\assoc_container.hpp"
#include "C:\MinGW\lib\gcc\mingw32\6.3.0\include\c++\ext\pb_ds\tree_policy.hpp"
using namespace __gnu_pbds;
template<typename T>
using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif

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

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 316 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 316 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 0 ms 204 KB Output is correct
3 Correct 0 ms 308 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 316 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 2872 KB Output is correct
2 Correct 22 ms 3004 KB Output is correct
3 Correct 22 ms 2984 KB Output is correct
4 Correct 18 ms 3012 KB Output is correct
5 Correct 19 ms 2988 KB Output is correct
6 Correct 21 ms 3000 KB Output is correct
7 Correct 23 ms 2880 KB Output is correct
8 Correct 22 ms 2988 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 316 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 312 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 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 332 KB Output is correct
3 Correct 1 ms 324 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 324 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 32 ms 3768 KB Output is correct
2 Correct 32 ms 3756 KB Output is correct
3 Correct 22 ms 3768 KB Output is correct
4 Correct 33 ms 3012 KB Output is correct
5 Correct 32 ms 3780 KB Output is correct
6 Correct 32 ms 3784 KB Output is correct
7 Correct 32 ms 3760 KB Output is correct
8 Correct 32 ms 3768 KB Output is correct