oj.uz

Submission #965905

# Submission time Handle Problem Language Result Execution time Memory
965905 2024-04-19T07:49:07 Z North1304 Best Place (NOI17_bestplace) C++14
100 / 100
 33 ms 8540 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[(n+1)/2] << ' ' << y[(n+1)/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 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 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 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 6792 KB Output is correct
2 Correct 21 ms 7004 KB Output is correct
3 Correct 19 ms 7772 KB Output is correct
4 Correct 14 ms 7772 KB Output is correct
5 Correct 17 ms 7772 KB Output is correct
6 Correct 19 ms 7772 KB Output is correct
7 Correct 20 ms 7768 KB Output is correct
8 Correct 22 ms 8028 KB Output is correct

Subtask #4
13.0 / 13.0

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

Subtask #5
17.0 / 17.0

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

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 6792 KB Output is correct
2 Correct 29 ms 8540 KB Output is correct
3 Correct 19 ms 8536 KB Output is correct
4 Correct 25 ms 7760 KB Output is correct
5 Correct 28 ms 8536 KB Output is correct
6 Correct 31 ms 8536 KB Output is correct
7 Correct 33 ms 8528 KB Output is correct
8 Correct 32 ms 8532 KB Output is correct