oj.uz

Submission #966008

# Submission time Handle Problem Language Result Execution time Memory
966008 2024-04-19T09:28:03 Z Zone_zonee Best Place (NOI17_bestplace) C++14
48 / 100
 79 ms 2376 KB 
#include <bits/stdc++.h>
using namespace std;

int main(){
    int n;
    cin>>n;
    vector<pair<int,int>> posi(n+1);
    for(int i=1;i<=n;i++){
        cin>>posi[i].first>>posi[i].second;
    }
    sort(posi.begin(),posi.end());
    if(n%2==0){
        cout<<(posi[n/2].first+posi[n/2+1].first)/2<<' '<<0;
    }else cout<<(posi[n/2+1].first)<<' '<<0;
    return 0;
}

Subtask #1
0 / 3.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 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

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 600 KB Output is correct
4 Correct 1 ms 432 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 38 ms 1116 KB Output is correct
2 Correct 45 ms 1204 KB Output is correct
3 Correct 45 ms 2128 KB Output is correct
4 Correct 41 ms 2376 KB Output is correct
5 Correct 45 ms 2364 KB Output is correct
6 Correct 46 ms 2140 KB Output is correct
7 Correct 45 ms 2132 KB Output is correct
8 Correct 45 ms 2132 KB Output is correct

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 79 ms 1116 KB Output isn't correct
2 Halted 0 ms 0 KB -