oj.uz

Submission #916147

# Submission time Handle Problem Language Result Execution time Memory
916147 2024-01-25T11:37:08 Z 406 Best Place (NOI17_bestplace) C++17
100 / 100
 32 ms 4692 KB 
#include <bits/stdc++.h>
#define int int64_t
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)

using namespace std;
using ar = array<int, 2>;

const int64_t INF = 1ll << 60;
const int N = 2e5 + 5;
int X[N], Y[N], n;

signed main() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr); 
        cin >> n;
        FOR(i, 0, n) cin >> X[i] >> Y[i];
        sort(X, X + n);
        sort(Y, Y + n);
        cout << X[n / 2] << ' ' << Y[n / 2] << '\n';
        return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3676 KB Output is correct
2 Correct 19 ms 3928 KB Output is correct
3 Correct 19 ms 3932 KB Output is correct
4 Correct 14 ms 3924 KB Output is correct
5 Correct 17 ms 3928 KB Output is correct
6 Correct 19 ms 3932 KB Output is correct
7 Correct 19 ms 3676 KB Output is correct
8 Correct 18 ms 3812 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 4492 KB Output is correct
2 Correct 28 ms 4688 KB Output is correct
3 Correct 20 ms 4692 KB Output is correct
4 Correct 26 ms 3928 KB Output is correct
5 Correct 28 ms 4688 KB Output is correct
6 Correct 28 ms 4688 KB Output is correct
7 Correct 28 ms 4688 KB Output is correct
8 Correct 29 ms 4580 KB Output is correct