結果

問題 No.1715 Dinner 2
ユーザー tamato
提出日時 2021-10-22 23:04:11
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 243 ms / 2,000 ms
コード長 1,607 bytes
コンパイル時間 357 ms
コンパイル使用メモリ 82,420 KB
実行使用メモリ 76,252 KB
最終ジャッジ日時 2024-09-23 06:58:48
合計ジャッジ時間 5,216 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

mod = 1000000007
eps = 10 ** -9
def main():
    import sys
    input = sys.stdin.readline
    N, D = map(int, input().split())
    P = []
    Q = []
    for _ in range(N):
        p, q = map(int, input().split())
        P.append(p)
        Q.append(q)
    ok = -10 ** 9
    ng = 0
    mid = (ok + ng) // 2
    while ng - ok > 1:
        prev = -1
        cur = 0
        flg = 1
        for d in range(D-2):
            best = -10 ** 9
            best_i = []
            for i in range(N):
                if cur - P[i] < mid:
                    continue
                if i == prev:
                    continue
                cur_new = cur - P[i] + Q[i]
                if cur_new > best:
                    best_i = [i]
                    best = cur_new
                elif cur_new == best:
                    best_i.append(i)
            if not best_i:
                flg = 0
                break
            if len(best_i) > 1:
                prev = -1
            else:
                prev = best_i[0]
            cur = best
        flg2 = 0
        for i in range(N):
            if i == prev:
                continue
            if cur - P[i] < mid:
                continue
            cur_new_i = cur - P[i] + Q[i]
            for j in range(N):
                if j == i:
                    continue
                if cur_new_i - P[j] >= mid:
                    flg2 = 1
        if flg2 == 0:
            flg = 0
        if flg == 0:
            ng = mid
        else:
            ok = mid
        mid = (ok + ng) // 2
    print(ok)
if __name__ == '__main__':
    main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0