oj.uz

Submission #781028

# Submission time Handle Problem Language Result Execution time Memory
781028 2023-07-12T15:59:07 Z ymm Best Place (NOI17_bestplace) C++17
100 / 100
 33 ms 3308 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	int n;
	cin >> n;
	vector<int> X, Y;
	Loop (i,0,n) {
		int x, y;
		cin >> x >> y;
		X.push_back(x);
		Y.push_back(y);
	}
	sort(X.begin(), X.end());
	sort(Y.begin(), Y.end());
	cout << X[X.size()/2] << ' ' << Y[Y.size()/2] << '\n';
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2344 KB Output is correct
2 Correct 19 ms 2384 KB Output is correct
3 Correct 24 ms 2420 KB Output is correct
4 Correct 19 ms 2400 KB Output is correct
5 Correct 18 ms 2376 KB Output is correct
6 Correct 19 ms 2392 KB Output is correct
7 Correct 20 ms 2364 KB Output is correct
8 Correct 19 ms 2384 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 3168 KB Output is correct
2 Correct 28 ms 3196 KB Output is correct
3 Correct 20 ms 3264 KB Output is correct
4 Correct 26 ms 2500 KB Output is correct
5 Correct 32 ms 3308 KB Output is correct
6 Correct 28 ms 3188 KB Output is correct
7 Correct 33 ms 3200 KB Output is correct
8 Correct 31 ms 3268 KB Output is correct