Submission #2384329
Source Code Expand
def main(): """ N=2*10^5 毎回sortは無理 sort済みにして計算量を落とす 元が偶数個なので中央値を考えてsortしたとき 中央付近には2つ,sort済み値が存在する m1<=m2 1つ除外したとき 除外したものがm1以下: 小さい方にずれるのでm2 除外したものがm2以上: 大きい方にずれるのでm1 """ N = int(input()) *X, = map(int, input().split()) X_sorted = sorted(X) mid = N // 2 m1 = X_sorted[mid-1] m2 = X_sorted[mid] for i in range(N): if X[i] <= m1: ans = m2 else: ans = m1 print(ans) if __name__ == '__main__': main()
Submission Info
Submission Time | |
---|---|
Task | C - Many Medians |
User | ksomemo |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 751 Byte |
Status | AC |
Exec Time | 278 ms |
Memory | 25564 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 11.txt, 12.txt, 2.txt, 3.txt, 4.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
1.txt | AC | 17 ms | 3060 KB |
10.txt | AC | 256 ms | 25564 KB |
11.txt | AC | 229 ms | 24064 KB |
12.txt | AC | 151 ms | 19076 KB |
2.txt | AC | 134 ms | 13796 KB |
3.txt | AC | 268 ms | 25228 KB |
4.txt | AC | 254 ms | 24036 KB |
5.txt | AC | 266 ms | 25220 KB |
6.txt | AC | 262 ms | 23824 KB |
7.txt | AC | 212 ms | 19440 KB |
8.txt | AC | 278 ms | 23824 KB |
9.txt | AC | 268 ms | 25152 KB |
sample1.txt | AC | 17 ms | 3060 KB |
sample2.txt | AC | 17 ms | 3060 KB |
sample3.txt | AC | 17 ms | 3060 KB |