結果

問題 No.5008 [Cherry Alpha] Discrete Pendulum with Air Resistance
ユーザー kyskys
提出日時 2022-10-14 23:26:07
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,887 ms / 2,000 ms
コード長 4,834 bytes
コンパイル時間 544 ms
実行使用メモリ 102,508 KB
スコア 0
最終ジャッジ日時 2022-10-14 23:28:42
合計ジャッジ時間 103,602 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge9
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,884 ms
100,372 KB
testcase_01 AC 1,877 ms
101,404 KB
testcase_02 AC 1,877 ms
101,380 KB
testcase_03 AC 1,880 ms
102,120 KB
testcase_04 AC 1,877 ms
99,984 KB
testcase_05 AC 1,873 ms
101,392 KB
testcase_06 AC 1,873 ms
101,532 KB
testcase_07 AC 1,878 ms
102,448 KB
testcase_08 AC 1,880 ms
101,176 KB
testcase_09 AC 1,885 ms
100,528 KB
testcase_10 AC 1,877 ms
100,840 KB
testcase_11 AC 1,880 ms
98,636 KB
testcase_12 AC 1,875 ms
100,668 KB
testcase_13 AC 1,877 ms
101,448 KB
testcase_14 AC 1,881 ms
101,488 KB
testcase_15 AC 1,877 ms
100,624 KB
testcase_16 AC 1,877 ms
99,032 KB
testcase_17 AC 1,877 ms
98,160 KB
testcase_18 AC 1,872 ms
101,732 KB
testcase_19 AC 1,876 ms
102,332 KB
testcase_20 AC 1,872 ms
98,876 KB
testcase_21 AC 1,873 ms
102,176 KB
testcase_22 AC 1,880 ms
100,012 KB
testcase_23 AC 1,881 ms
101,672 KB
testcase_24 AC 1,879 ms
100,340 KB
testcase_25 AC 1,883 ms
102,508 KB
testcase_26 AC 1,881 ms
100,916 KB
testcase_27 AC 1,880 ms
102,236 KB
testcase_28 AC 1,875 ms
100,140 KB
testcase_29 AC 1,874 ms
100,692 KB
testcase_30 AC 1,879 ms
100,760 KB
testcase_31 AC 1,881 ms
99,772 KB
testcase_32 AC 1,879 ms
101,288 KB
testcase_33 AC 1,886 ms
101,740 KB
testcase_34 AC 1,874 ms
102,292 KB
testcase_35 AC 1,878 ms
99,364 KB
testcase_36 AC 1,874 ms
101,876 KB
testcase_37 AC 1,879 ms
102,464 KB
testcase_38 AC 1,881 ms
102,092 KB
testcase_39 AC 1,880 ms
100,200 KB
testcase_40 AC 1,880 ms
100,512 KB
testcase_41 AC 1,879 ms
101,356 KB
testcase_42 AC 1,876 ms
101,464 KB
testcase_43 AC 1,887 ms
101,620 KB
testcase_44 AC 1,880 ms
100,572 KB
testcase_45 AC 1,879 ms
100,484 KB
testcase_46 AC 1,884 ms
102,056 KB
testcase_47 AC 1,880 ms
100,928 KB
testcase_48 AC 1,876 ms
101,864 KB
testcase_49 AC 1,880 ms
101,568 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

def main():
    from sys import stdin, setrecursionlimit
    # setrecursionlimit(1000000)
    input = stdin.readline
    def iinput(): return int(input())
    def sinput(): return input().rstrip()
    def i0input(): return int(input()) - 1
    def linput(): return list(input().split())
    def liinput(): return list(map(int, input().split()))
    def miinput(): return map(int, input().split())
    def li0input(): return list(map(lambda x: int(x) - 1, input().split()))
    def mi0input(): return map(lambda x: int(x) - 1, input().split())
    INF = 1000000000000000000
    MOD = 1000000007

    from itertools import combinations
    from math import sqrt

    def score():
        X = [[] for _ in [0] * K]
        Y = [[] for _ in [0] * K]
        for b, m, e in zip(Bs, Ms, Es):
            start = 2 * b
            diff = 2 * e
            end = 2 * m
            last = (b - m) // e
            thr = start * (last + 1) - last * (last + 1) // 2 * diff
            for i, t in enumerate(T):
                if t <= thr:
                    ok = MAXBE
                    ng = -1
                    while ng + 1 < ok:
                        ch = (ng + ok) // 2
                        if t < start * (ch + 1) - ch * (ch + 1) // 2 * diff:
                            ng = ch
                        else:
                            ok = ch
                    t -= start * ok - ok * (ok - 1) // 2 * diff
                    if ok % 2:
                        sgn = -1
                    else:
                        sgn = 1
                    if t <= (start - ok * diff) // 2:
                        X[i].append(sgn * t)
                    else:
                        X[i].append(sgn * (start - ok * diff - t))
                else:
                    t -= start * (last + 1) - last * (last + 1) // 2 * diff
                    ok = last + t // end
                    t %= end
                    if ok % 2:
                        sgn = -1
                    else:
                        sgn = 1
                    if t <= end // 2:
                        X[i].append(sgn * t)
                    else:
                        X[i].append(sgn * (end - t))
            for i, t in enumerate(U):
                if t <= thr:
                    ok = MAXBE
                    ng = -1
                    while ng + 1 < ok:
                        ch = (ng + ok) // 2
                        if t < start * (ch + 1) - ch * (ch + 1) // 2 * diff:
                            ng = ch
                        else:
                            ok = ch
                    t -= start * ok - ok * (ok - 1) // 2 * diff
                    if ok % 2:
                        sgn = -1
                    else:
                        sgn = 1
                    if t <= (start - ok * diff) // 2:
                        Y[i].append(sgn * t)
                    else:
                        Y[i].append(sgn * (start - ok * diff - t))
                else:
                    t -= start * (last + 1) - last * (last + 1) // 2 * diff
                    ok = last + t // end
                    t %= end
                    if ok % 2:
                        sgn = -1
                    else:
                        sgn = 1
                    if t <= end // 2:
                        Y[i].append(sgn * t)
                    else:
                        Y[i].append(sgn * (end - t))
        tmp1 = []
        for x in X:
            tmp1.append(0)
            for i in range(N):
                for j in range(i+1, N):
                    tmp1[-1] += abs(x[i] - x[j]) / (Bs[i] + Bs[j])
            tmp1[-1] *= 20000000 / N / (N - 1)
        tmp2 = []
        for x in Y:
            tmp2.append(0)
            for i in range(N):
                for j in range(i+1, N):
                    tmp2[-1] = max(tmp2[-1], abs(x[i] - x[j]))
            tmp2[-1] = 10000000 / sqrt(tmp2[-1] / 20 + 1)
        ans1 = sum(tmp1) / K
        ans2 = sum(tmp2) / K
        return ans1 * ans2

    from random import randint

    N, K = miinput()
    MAXBE = 10**9

    T = liinput()
    U = liinput()

    Bs = [randint(1, MAXBE) for _ in [0] * N]
    Ms = []
    for b in Bs:
        Ms.append(randint(1, b))
    
    Es = [randint(1, MAXBE) for _ in [0] * N]

    tmp_score = score()
    while time() - S < 1.8:
        idx = randint(0, N-1)
        newb = randint(1, MAXBE)
        newm = randint(1, newb)
        newe = randint(1, MAXBE)
        oldb = Bs[idx]
        oldm = Ms[idx]
        olde = Es[idx]
        Bs[idx], Ms[idx], Es[idx] = newb, newm, newe
        new_score = score()
        if new_score < tmp_score:
            Bs[idx], Ms[idx], Es[idx] = oldb, oldm, olde
        else:
            tmp_score = new_score

    for b, m, e in zip(Bs, Ms, Es):
        print(b, m, e)
    
from time import time
S = time()

main()
0