oj.uz

Submission #824202

# Submission time Handle Problem Language Result Execution time Memory
824202 2023-08-13T17:55:01 Z chaithra07 Best Place (NOI17_bestplace) Python 3
100 / 100
 234 ms 13188 KB 
n=int(input())
lx=[]
ly=[]
for i in range(n):
    x,y=map(int,input().split())
    lx.append(x)
    ly.append(y)
lx.sort()
ly.sort()
print(lx[n//2],ly[n//2],end=" ")

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2824 KB Output is correct
2 Correct 10 ms 2820 KB Output is correct
3 Correct 10 ms 2760 KB Output is correct
4 Correct 10 ms 2740 KB Output is correct
5 Correct 10 ms 2828 KB Output is correct
6 Correct 14 ms 2736 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2832 KB Output is correct
2 Correct 12 ms 2852 KB Output is correct
3 Correct 12 ms 2776 KB Output is correct
4 Correct 12 ms 2824 KB Output is correct
5 Correct 12 ms 2904 KB Output is correct
6 Correct 15 ms 2832 KB Output is correct
7 Correct 12 ms 2776 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 8716 KB Output is correct
2 Correct 183 ms 9236 KB Output is correct
3 Correct 197 ms 9216 KB Output is correct
4 Correct 172 ms 8996 KB Output is correct
5 Correct 183 ms 9220 KB Output is correct
6 Correct 173 ms 9124 KB Output is correct
7 Correct 182 ms 9160 KB Output is correct
8 Correct 178 ms 9184 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2832 KB Output is correct
2 Correct 10 ms 2812 KB Output is correct
3 Correct 10 ms 2832 KB Output is correct
4 Correct 11 ms 2748 KB Output is correct
5 Correct 10 ms 2776 KB Output is correct
6 Correct 11 ms 2804 KB Output is correct
7 Correct 14 ms 2828 KB Output is correct
8 Correct 11 ms 2800 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2872 KB Output is correct
2 Correct 12 ms 2876 KB Output is correct
3 Correct 12 ms 2904 KB Output is correct
4 Correct 12 ms 2844 KB Output is correct
5 Correct 15 ms 2944 KB Output is correct
6 Correct 15 ms 2840 KB Output is correct
7 Correct 12 ms 2936 KB Output is correct
8 Correct 12 ms 2868 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 13116 KB Output is correct
2 Correct 219 ms 13172 KB Output is correct
3 Correct 184 ms 13020 KB Output is correct
4 Correct 234 ms 12416 KB Output is correct
5 Correct 213 ms 13168 KB Output is correct
6 Correct 204 ms 13124 KB Output is correct
7 Correct 207 ms 13136 KB Output is correct
8 Correct 201 ms 13188 KB Output is correct