oj.uz

Submission #531526

# Submission time Handle Problem Language Result Execution time Memory
531526 2022-03-01T01:59:14 Z makanhulia Best Place (NOI17_bestplace) C++17
100 / 100
 48 ms 1984 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
    cin.tie(0) -> ios_base::sync_with_stdio(0);

    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 1 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 316 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 312 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 316 KB Output is correct
3 Correct 1 ms 204 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 20 ms 1812 KB Output is correct
2 Correct 23 ms 1896 KB Output is correct
3 Correct 31 ms 1868 KB Output is correct
4 Correct 25 ms 1984 KB Output is correct
5 Correct 22 ms 1820 KB Output is correct
6 Correct 23 ms 1868 KB Output is correct
7 Correct 22 ms 1868 KB Output is correct
8 Correct 25 ms 1868 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 204 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 0 ms 204 KB Output is correct
8 Correct 1 ms 308 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 452 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 320 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 35 ms 1788 KB Output is correct
2 Correct 34 ms 1604 KB Output is correct
3 Correct 24 ms 1424 KB Output is correct
4 Correct 42 ms 1372 KB Output is correct
5 Correct 35 ms 1508 KB Output is correct
6 Correct 39 ms 1512 KB Output is correct
7 Correct 37 ms 1456 KB Output is correct
8 Correct 48 ms 1440 KB Output is correct