oj.uz

Submission #949024

# Submission time Handle Problem Language Result Execution time Memory
949024 2024-03-18T19:52:19 Z anotherPROgrammer Best Place (NOI17_bestplace) C++14
100 / 100
 77 ms 3524 KB 
#include <bits/stdc++.h>

using namespace std;

int main(){
    int n;
    cin >> n;
    int x =0;
    int y = 0;
    vector<int> xi;
    vector<int> yi;
    for(int i = 0;i<n;i++){
        int a;
        int b;
        cin >> a>>b;
        xi.push_back(a);
        yi.push_back(b);
    }
    sort(xi.begin(),xi.end());
    sort(yi.begin(),yi.end());

    if (n%2 == 0){

        x = round((xi[n/2 - 1] + xi[n/2])/2.0);
        y = round((yi[n/2 - 1] + yi[n/2])/2.0);

    }
    else{
        x = xi[n/2];
        y = yi[n/2];
    }


    
    cout << x<<" "<<y<<endl;

}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1232 KB Output is correct
2 Correct 45 ms 2528 KB Output is correct
3 Correct 46 ms 2504 KB Output is correct
4 Correct 41 ms 2504 KB Output is correct
5 Correct 55 ms 2500 KB Output is correct
6 Correct 57 ms 2592 KB Output is correct
7 Correct 50 ms 2500 KB Output is correct
8 Correct 46 ms 2504 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 436 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 1224 KB Output is correct
2 Correct 66 ms 3524 KB Output is correct
3 Correct 58 ms 3340 KB Output is correct
4 Correct 54 ms 2948 KB Output is correct
5 Correct 66 ms 3268 KB Output is correct
6 Correct 66 ms 3268 KB Output is correct
7 Correct 66 ms 3268 KB Output is correct
8 Correct 77 ms 3200 KB Output is correct