oj.uz

Submission #480934

# Submission time Handle Problem Language Result Execution time Memory
480934 2021-10-18T20:39:39 Z saarthak Best Place (NOI17_bestplace) C++14
100 / 100
 46 ms 3792 KB 
#include <bits/stdc++.h>
using namespace std;

#define io ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define PB push_back
#define RS resize
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define ITR(i, n) for(int i = 0; i < n; i++)
#define M 1000000007

typedef int_fast32_t fint;
typedef int_fast64_t fint64;
typedef vector<fint> vi;
typedef vector<vector<fint>> vvi;
typedef pair<fint, fint> pi;
typedef vector<pair<fint, fint>> vpi;
typedef map<fint, fint> imap;
typedef long long ll;


void solve() {
	fint n;
	cin >> n;
	vi x(n), y(n);
	ITR(i, n)
		cin >> x[i] >> y[i];
	sort(x.B, x.E);
	sort(y.B, y.E);
	cout << x[n/2] << " " << y[n/2] << "\n";
}

int main() {
	io
	
	solve();
	
	return 0;
}

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 1868 KB Output is correct
2 Correct 34 ms 1868 KB Output is correct
3 Correct 28 ms 3020 KB Output is correct
4 Correct 20 ms 3032 KB Output is correct
5 Correct 28 ms 3020 KB Output is correct
6 Correct 26 ms 3020 KB Output is correct
7 Correct 28 ms 2904 KB Output is correct
8 Correct 33 ms 3024 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 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 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 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 42 ms 1884 KB Output is correct
2 Correct 46 ms 3776 KB Output is correct
3 Correct 39 ms 3788 KB Output is correct
4 Correct 38 ms 3112 KB Output is correct
5 Correct 39 ms 3788 KB Output is correct
6 Correct 40 ms 3784 KB Output is correct
7 Correct 38 ms 3788 KB Output is correct
8 Correct 37 ms 3792 KB Output is correct