oj.uz

Submission #924058

# Submission time Handle Problem Language Result Execution time Memory
924058 2024-02-08T10:41:10 Z Danusan Best Place (NOI17_bestplace) PyPy 3
3 / 100
 203 ms 31440 KB 
def median(list,num):
  list.sort()
  if num%2==0:
    return list[num//2]
  return (list[num//2]+list[(num//2)-1])//2

num=int(input())
x=[]
y=[]
for i in range(num):
  xn, yn = map(int, input().split())
  x.append(xn)
  y.append(yn)
print(median(x,num),median(y,num))

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 18228 KB Output is correct
2 Correct 27 ms 18188 KB Output is correct
3 Correct 27 ms 18228 KB Output is correct
4 Correct 27 ms 18396 KB Output is correct
5 Correct 27 ms 18236 KB Output is correct
6 Correct 31 ms 18168 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 19244 KB Output is correct
2 Incorrect 48 ms 19272 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 28572 KB Output is correct
2 Correct 184 ms 30704 KB Output is correct
3 Incorrect 183 ms 30508 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 18328 KB Output is correct
2 Incorrect 29 ms 18236 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 19248 KB Output is correct
2 Incorrect 46 ms 19224 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 29384 KB Output is correct
2 Incorrect 202 ms 31440 KB Output isn't correct
3 Halted 0 ms 0 KB -