oj.uz

Submission #485431

# Submission time Handle Problem Language Result Execution time Memory
485431 2021-11-07T18:11:01 Z blue Best Place (NOI17_bestplace) C++17
100 / 100
 108 ms 3000 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    int N;
    cin >> N;

    vector<int> x(N), y(N);
    for(int i = 0; i < N; i++) cin >> x[i] >> y[i];

    sort(x.begin(), x.end());
    sort(y.begin(), y.end());

    cout << x[N/2] << ' ' << y[N/2] << '\n';
}

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 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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 972 KB Output is correct
2 Correct 64 ms 2340 KB Output is correct
3 Correct 61 ms 2200 KB Output is correct
4 Correct 55 ms 2212 KB Output is correct
5 Correct 58 ms 2224 KB Output is correct
6 Correct 61 ms 2212 KB Output is correct
7 Correct 57 ms 2116 KB Output is correct
8 Correct 60 ms 2212 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 1 ms 256 KB Output is correct
5 Correct 1 ms 204 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 204 KB Output is correct
2 Correct 1 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 2 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 1068 KB Output is correct
2 Correct 106 ms 2968 KB Output is correct
3 Correct 84 ms 2980 KB Output is correct
4 Correct 68 ms 2244 KB Output is correct
5 Correct 108 ms 2964 KB Output is correct
6 Correct 89 ms 2984 KB Output is correct
7 Correct 87 ms 2984 KB Output is correct
8 Correct 91 ms 3000 KB Output is correct