oj.uz

Submission #924059

# Submission time Handle Problem Language Result Execution time Memory
924059 2024-02-08T10:41:43 Z Danusan Best Place (NOI17_bestplace) PyPy 3
100 / 100
 208 ms 32116 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 18204 KB Output is correct
3 Correct 26 ms 18236 KB Output is correct
4 Correct 27 ms 18196 KB Output is correct
5 Correct 27 ms 18228 KB Output is correct
6 Correct 28 ms 18236 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 19248 KB Output is correct
2 Correct 48 ms 19088 KB Output is correct
3 Correct 46 ms 19256 KB Output is correct
4 Correct 46 ms 19212 KB Output is correct
5 Correct 47 ms 19252 KB Output is correct
6 Correct 46 ms 19248 KB Output is correct
7 Correct 46 ms 19256 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 28568 KB Output is correct
2 Correct 185 ms 29236 KB Output is correct
3 Correct 189 ms 29208 KB Output is correct
4 Correct 173 ms 30268 KB Output is correct
5 Correct 182 ms 29896 KB Output is correct
6 Correct 183 ms 30512 KB Output is correct
7 Correct 188 ms 30620 KB Output is correct
8 Correct 181 ms 30912 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 18228 KB Output is correct
2 Correct 29 ms 18376 KB Output is correct
3 Correct 30 ms 18236 KB Output is correct
4 Correct 29 ms 18360 KB Output is correct
5 Correct 30 ms 18228 KB Output is correct
6 Correct 28 ms 18228 KB Output is correct
7 Correct 29 ms 18236 KB Output is correct
8 Correct 32 ms 18296 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 19248 KB Output is correct
2 Correct 47 ms 19252 KB Output is correct
3 Correct 46 ms 19500 KB Output is correct
4 Correct 47 ms 19180 KB Output is correct
5 Correct 46 ms 19312 KB Output is correct
6 Correct 47 ms 19248 KB Output is correct
7 Correct 47 ms 19208 KB Output is correct
8 Correct 47 ms 19244 KB Output is correct

Subtask #6
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 29600 KB Output is correct
2 Correct 199 ms 29396 KB Output is correct
3 Correct 182 ms 31988 KB Output is correct
4 Correct 194 ms 31696 KB Output is correct
5 Correct 197 ms 31988 KB Output is correct
6 Correct 206 ms 32116 KB Output is correct
7 Correct 201 ms 32096 KB Output is correct
8 Correct 200 ms 31404 KB Output is correct