oj.uz

Submission #545351

# Submission time Handle Problem Language Result Execution time Memory
545351 2022-04-04T10:29:33 Z Trisanu_Das Best Place (NOI17_bestplace) C++17
100 / 100
 96 ms 3024 KB 
#include <bits/stdc++.h>
using namespace std;
 
const int MAXN = 100000;
int N, X[MAXN], Y[MAXN];
 
int main(){
  cin >> N;
  for (int i = 0; i < N; ++i) {
  cin >> X[i] >> Y[i];
  }
  sort(X, X+N);
  sort(Y, Y+N);
  cout << X[N/2] << " " << Y[N/2] << endl;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 968 KB Output is correct
2 Correct 60 ms 1052 KB Output is correct
3 Correct 64 ms 1104 KB Output is correct
4 Correct 55 ms 1064 KB Output is correct
5 Correct 58 ms 952 KB Output is correct
6 Correct 59 ms 988 KB Output is correct
7 Correct 57 ms 968 KB Output is correct
8 Correct 61 ms 976 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 312 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 1068 KB Output is correct
2 Correct 96 ms 2956 KB Output is correct
3 Correct 80 ms 3024 KB Output is correct
4 Correct 67 ms 2184 KB Output is correct
5 Correct 92 ms 3000 KB Output is correct
6 Correct 95 ms 2936 KB Output is correct
7 Correct 89 ms 3000 KB Output is correct
8 Correct 91 ms 2944 KB Output is correct