oj.uz

Submission #731786

# Submission time Handle Problem Language Result Execution time Memory
731786 2023-04-28T01:23:16 Z maeola Best Place (NOI17_bestplace) C++17
100 / 100
 35 ms 1428 KB 
// trans rights
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using base = complex<double>;

int main(int argc, const char *argv[])
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    cin >> N;
    vector<int> xs, ys;
    for (int i = 0; i < N; i++)
    {
        int x, y;
        cin >> x >> y;
        xs.push_back(x);
        ys.push_back(y);
    }
    sort(xs.begin(), xs.end());
    sort(ys.begin(), ys.end());
    cout << xs[N/2] << ' ' << ys[N/2];
    return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1216 KB Output is correct
2 Correct 22 ms 1260 KB Output is correct
3 Correct 22 ms 1300 KB Output is correct
4 Correct 19 ms 1232 KB Output is correct
5 Correct 25 ms 1392 KB Output is correct
6 Correct 22 ms 1232 KB Output is correct
7 Correct 22 ms 1232 KB Output is correct
8 Correct 21 ms 1232 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 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 35 ms 1428 KB Output is correct
2 Correct 31 ms 1320 KB Output is correct
3 Correct 26 ms 1252 KB Output is correct
4 Correct 31 ms 1332 KB Output is correct
5 Correct 33 ms 1232 KB Output is correct
6 Correct 32 ms 1232 KB Output is correct
7 Correct 32 ms 1284 KB Output is correct
8 Correct 32 ms 1268 KB Output is correct