oj.uz

Submission #892909

# Submission time Handle Problem Language Result Execution time Memory
892909 2023-12-26T07:05:53 Z votranngocvy Best Place (NOI17_bestplace) C++14
100 / 100
 29 ms 3936 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
const int N = 1e5 + 5;
int n,x[N],y[N];

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    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);
    int mid = (n + 1) / 2;
    cout << x[mid] << " " << y[mid] << "\n";
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 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 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 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 472 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 464 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2908 KB Output is correct
2 Correct 18 ms 3160 KB Output is correct
3 Correct 18 ms 3160 KB Output is correct
4 Correct 14 ms 3120 KB Output is correct
5 Correct 18 ms 3160 KB Output is correct
6 Correct 20 ms 3116 KB Output is correct
7 Correct 19 ms 2908 KB Output is correct
8 Correct 18 ms 3160 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 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 484 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 0 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
8 Correct 1 ms 348 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 3676 KB Output is correct
2 Correct 29 ms 3800 KB Output is correct
3 Correct 19 ms 3840 KB Output is correct
4 Correct 29 ms 3152 KB Output is correct
5 Correct 28 ms 3920 KB Output is correct
6 Correct 27 ms 3928 KB Output is correct
7 Correct 27 ms 3920 KB Output is correct
8 Correct 28 ms 3936 KB Output is correct