oj.uz

Submission #966002

# Submission time Handle Problem Language Result Execution time Memory
966002 2024-04-19T09:18:59 Z Zone_zonee Best Place (NOI17_bestplace) C++14
0 / 100
 62 ms 2372 KB 
#include <bits/stdc++.h>
using namespace std;

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

Subtask #1
0 / 3.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 1116 KB Output is correct
2 Incorrect 45 ms 2372 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

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