oj.uz

Submission #931730

# Submission time Handle Problem Language Result Execution time Memory
931730 2024-02-22T10:14:52 Z accord Best Place (NOI17_bestplace) C++14
100 / 100
 89 ms 3240 KB 
#include <bits/stdc++.h>
using namespace std;
    
int main() {
  	int n; cin >> n;
   	int x[n], y[n];
   	for(int i = 0; i < n; i++) cin >> x[i] >> y[i];
   	sort(x, x+n); 
    sort(y, y+n);
   	cout << x[(int)floor(n/2)] << " " << y[(int)floor(n/2)] << "\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 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 600 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 1 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 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

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 1116 KB Output is correct
2 Correct 48 ms 2236 KB Output is correct
3 Correct 45 ms 2216 KB Output is correct
4 Correct 43 ms 2356 KB Output is correct
5 Correct 47 ms 2204 KB Output is correct
6 Correct 55 ms 2132 KB Output is correct
7 Correct 56 ms 2128 KB Output is correct
8 Correct 45 ms 2128 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 812 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 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 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 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 80 ms 1116 KB Output is correct
2 Correct 79 ms 2896 KB Output is correct
3 Correct 58 ms 3240 KB Output is correct
4 Correct 66 ms 2232 KB Output is correct
5 Correct 71 ms 3108 KB Output is correct
6 Correct 75 ms 3092 KB Output is correct
7 Correct 69 ms 3124 KB Output is correct
8 Correct 89 ms 2968 KB Output is correct