Submission #2384345
Source Code Expand
def main(): """ nCr の最大化 2 <= n <= 10^5 全組合せでは間に合わない sortして必要なものを選ぶ 0 <= ai <= 10^9 実際に場合の数を求めていては間に合わない 階乗でO(N)は時間がかかる+数が大きくて処理時間が長い nCr = nPr / r! nが大きいほど大きい rが大きいほど大きい? nCr: 7C4 = 7C3 if r > n // 2 7C3: 7*6+5 / 3*2 7C2: 7*6 / 2 n-r が大きいほど大きい """ n = int(input()) *a, = map(int, input().split()) a = sorted(a) m = a[-1] m2 = m // 2 r, r_tmp = 0, 0 for _a in a: tmp = _a if _a > m2: tmp = m - _a if tmp > r_tmp: r = _a r_tmp = tmp print(m, r) if __name__ == '__main__': main()
Submission Info
Submission Time | |
---|---|
Task | D - Binomial Coefficients |
User | ksomemo |
Language | Python (3.4.3) |
Score | 400 |
Code Size | 940 Byte |
Status | AC |
Exec Time | 88 ms |
Memory | 14424 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt |
All | even0.txt, even1.txt, float.txt, odd0.txt, odd1.txt, rnd_0.txt, rnd_1.txt, rnd_2.txt, rnd_3.txt, rnd_4.txt, rnd_5.txt, rnd_6.txt, rnd_7.txt, rnd_8.txt, rnd_9.txt, sample1.txt, sample2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
even0.txt | AC | 86 ms | 13656 KB |
even1.txt | AC | 86 ms | 14424 KB |
float.txt | AC | 88 ms | 14052 KB |
odd0.txt | AC | 87 ms | 13660 KB |
odd1.txt | AC | 86 ms | 14424 KB |
rnd_0.txt | AC | 79 ms | 12976 KB |
rnd_1.txt | AC | 71 ms | 12132 KB |
rnd_2.txt | AC | 77 ms | 12756 KB |
rnd_3.txt | AC | 72 ms | 12056 KB |
rnd_4.txt | AC | 64 ms | 10860 KB |
rnd_5.txt | AC | 85 ms | 13972 KB |
rnd_6.txt | AC | 70 ms | 11892 KB |
rnd_7.txt | AC | 68 ms | 11660 KB |
rnd_8.txt | AC | 78 ms | 12644 KB |
rnd_9.txt | AC | 75 ms | 12472 KB |
sample1.txt | AC | 17 ms | 3060 KB |
sample2.txt | AC | 17 ms | 3060 KB |