oj.uz

Submission #533402

# Submission time Handle Problem Language Result Execution time Memory
533402 2022-03-05T23:31:45 Z christinelynn Best Place (NOI17_bestplace) C++17
100 / 100
 94 ms 3256 KB 
#include<bits/stdc++.h>
using namespace std;

int main(){
    int n; cin >> n;
    vector<int> x, y;
    for(int i = 0; i < n; i++){
        int a, b; cin >> a >> b;
        x.push_back(a);
        y.push_back(b);
    }
    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 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 1 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 292 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 2232 KB Output is correct
2 Correct 67 ms 2392 KB Output is correct
3 Correct 65 ms 2436 KB Output is correct
4 Correct 59 ms 2356 KB Output is correct
5 Correct 60 ms 2360 KB Output is correct
6 Correct 65 ms 2444 KB Output is correct
7 Correct 66 ms 2328 KB Output is correct
8 Correct 83 ms 2360 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 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 304 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 304 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 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 3208 KB Output is correct
2 Correct 85 ms 3188 KB Output is correct
3 Correct 81 ms 3220 KB Output is correct
4 Correct 89 ms 2472 KB Output is correct
5 Correct 90 ms 3204 KB Output is correct
6 Correct 91 ms 3236 KB Output is correct
7 Correct 85 ms 3096 KB Output is correct
8 Correct 90 ms 3256 KB Output is correct