oj.uz

Submission #965897

# Submission time Handle Problem Language Result Execution time Memory
965897 2024-04-19T07:47:59 Z North1304 Best Place (NOI17_bestplace) C++14
3 / 100
 28 ms 8536 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 1;
int x[N] , y[N];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int n; cin >> n;
    for(int i=1;i<=n;i++) cin >> x[i] >> y[i];
    sort(x+1, x+n+1);
    sort(y+1, y+n+1);
    cout << (x[1] + x[n]) / 2 << ' ' << (y[1] + y[n]) / 2;
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct

Subtask #2
0 / 20.0

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

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 7796 KB Output is correct
2 Incorrect 20 ms 7768 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 2392 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 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

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