Submission #6901884


Source Code Expand

Copy
# -*- coding: utf-8 -*-

import sys
from heapq import heappush, heappop

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

class MinCostFlow:
    INF = 10**18

    def __init__(self, N):
        self.N = N
        self.G = [[] for i in range(N)]

    def add_edge(self, fr, to, cap, cost):
        G = self.G
        G[fr].append([to, cap, cost, len(G[to])])
        G[to].append([fr, 0, -cost, len(G[fr])-1])

    def flow(self, s, t, f):
        N = self.N; G = self.G
        INF = MinCostFlow.INF

        res = 0
        H = [0]*N
        prv_v = [0]*N
        prv_e = [0]*N

        while f:
            dist = [INF]*N
            dist[s] = 0
            que = [(0, s)]

            while que:
                c, v = heappop(que)
                if dist[v] < c:
                    continue
                for i, (w, cap, cost, _) in enumerate(G[v]):
                    if cap > 0 and dist[w] > dist[v] + cost + H[v] - H[w]:
                        dist[w] = r = dist[v] + cost + H[v] - H[w]
                        prv_v[w] = v; prv_e[w] = i
                        heappush(que, (r, w))
            if dist[t] == INF:
                return -1

            for i in range(N):
                H[i] += dist[i]

            d = f; v = t
            while v != s:
                d = min(d, G[prv_v[v]][prv_e[v]][1])
                v = prv_v[v]
            f -= d
            res += d * H[t]
            v = t
            while v != s:
                e = G[prv_v[v]][prv_e[v]]
                e[1] -= d
                G[v][e[3]][1] += d
                v = prv_v[v]
        return res

R, G, B = MAP()
N = R + G + B

# 最小費用流
mcf = MinCostFlow(1006)
# 始点からRGBの移動前
mcf.add_edge(1001, 1002, R, 0)
mcf.add_edge(1001, 1003, G, 0)
mcf.add_edge(1001, 1004, B, 0)

# 0~1000の頂点番号は座標位置と一致させてある
for v in range(1001):
    # R => 各座標
    mcf.add_edge(1002, v, 1, abs(400-v))
    # G => 各座標
    mcf.add_edge(1003, v, 1, abs(500-v))
    # B => 各座標
    mcf.add_edge(1004, v, 1, abs(600-v))
    # 各座標 => 終点
    mcf.add_edge(v, 1005, 1, 0)

print(mcf.flow(1001, 1005, N))

Submission Info

Submission Time
Task D - マーブル
User Coki628
Language PyPy3 (2.4.0)
Score 0
Code Size 2712 Byte
Status
Exec Time 1506 ms
Memory 78948 KB

Test Cases

Set Name Score / Max Score Test Cases
sub1 0 / 10 sample_01_ABC.txt, test_ABC_01.txt, test_ABC_02.txt, test_ABC_03.txt, test_ABC_04.txt, test_ABC_05.txt, test_ABC_06.txt, test_ABC_07.txt, test_ABC_08.txt, test_ABC_09.txt, test_ABC_10.txt, test_ABC_11.txt, test_ABC_12.txt, test_ABC_13.txt, test_ABC_14.txt, test_ABC_15.txt, test_ABC_16.txt, test_ABC_17.txt, test_ABC_18.txt, test_ABC_19.txt, test_ABC_20.txt, test_ABC_21.txt, test_ABC_22.txt, test_ABC_23.txt, test_ABC_24.txt, test_ABC_25.txt, test_ABC_26.txt, test_ABC_27.txt, test_ABC_28.txt
sub2 0 / 30 sample_01_ABC.txt, sample_02_BC.txt, test_ABC_01.txt, test_ABC_02.txt, test_ABC_03.txt, test_ABC_04.txt, test_ABC_05.txt, test_ABC_06.txt, test_ABC_07.txt, test_ABC_08.txt, test_ABC_09.txt, test_ABC_10.txt, test_ABC_11.txt, test_ABC_12.txt, test_ABC_13.txt, test_ABC_14.txt, test_ABC_15.txt, test_ABC_16.txt, test_ABC_17.txt, test_ABC_18.txt, test_ABC_19.txt, test_ABC_20.txt, test_ABC_21.txt, test_ABC_22.txt, test_ABC_23.txt, test_ABC_24.txt, test_ABC_25.txt, test_ABC_26.txt, test_ABC_27.txt, test_ABC_28.txt, test_BC_29.txt, test_BC_30.txt, test_BC_31.txt, test_BC_32.txt, test_BC_33.txt, test_BC_34.txt, test_BC_35.txt, test_BC_36.txt, test_BC_37.txt, test_BC_38.txt, test_BC_39.txt, test_BC_40.txt, test_BC_41.txt, test_BC_42.txt, test_BC_43.txt, test_BC_44.txt, test_BC_45.txt, test_BC_46.txt, test_BC_47.txt, test_BC_48.txt, test_BC_49.txt, test_BC_50.txt, test_BC_51.txt, test_BC_52.txt, test_BC_53.txt, test_BC_54.txt, test_BC_55.txt
All 0 / 60 sample_01_ABC.txt, sample_02_BC.txt, sample_03_C.txt, test_ABC_01.txt, test_ABC_02.txt, test_ABC_03.txt, test_ABC_04.txt, test_ABC_05.txt, test_ABC_06.txt, test_ABC_07.txt, test_ABC_08.txt, test_ABC_09.txt, test_ABC_10.txt, test_ABC_11.txt, test_ABC_12.txt, test_ABC_13.txt, test_ABC_14.txt, test_ABC_15.txt, test_ABC_16.txt, test_ABC_17.txt, test_ABC_18.txt, test_ABC_19.txt, test_ABC_20.txt, test_ABC_21.txt, test_ABC_22.txt, test_ABC_23.txt, test_ABC_24.txt, test_ABC_25.txt, test_ABC_26.txt, test_ABC_27.txt, test_ABC_28.txt, test_BC_29.txt, test_BC_30.txt, test_BC_31.txt, test_BC_32.txt, test_BC_33.txt, test_BC_34.txt, test_BC_35.txt, test_BC_36.txt, test_BC_37.txt, test_BC_38.txt, test_BC_39.txt, test_BC_40.txt, test_BC_41.txt, test_BC_42.txt, test_BC_43.txt, test_BC_44.txt, test_BC_45.txt, test_BC_46.txt, test_BC_47.txt, test_BC_48.txt, test_BC_49.txt, test_BC_50.txt, test_BC_51.txt, test_BC_52.txt, test_BC_53.txt, test_BC_54.txt, test_BC_55.txt, test_C_56.txt, test_C_57.txt, test_C_58.txt, test_C_59.txt, test_C_60.txt, test_C_61.txt, test_C_62.txt, test_C_63.txt, test_C_64.txt, test_C_65.txt, test_C_66.txt, test_C_67.txt, test_C_68.txt, test_C_69.txt, test_C_70.txt, test_C_71.txt, test_C_72.txt, test_C_73.txt, test_C_74.txt, test_C_75.txt, test_C_76.txt, test_C_77.txt, test_C_78.txt, test_C_79.txt, test_C_80.txt, test_C_81.txt, test_C_82.txt
Case Name Status Exec Time Memory
sample_01_ABC.txt 364 ms 58332 KB
sample_02_BC.txt 422 ms 59740 KB
sample_03_C.txt 1303 ms 76124 KB
test_ABC_01.txt 361 ms 57692 KB
test_ABC_02.txt 362 ms 58332 KB
test_ABC_03.txt 363 ms 57820 KB
test_ABC_04.txt 368 ms 57692 KB
test_ABC_05.txt 359 ms 57436 KB
test_ABC_06.txt 365 ms 58076 KB
test_ABC_07.txt 363 ms 57820 KB
test_ABC_08.txt 357 ms 57820 KB
test_ABC_09.txt 360 ms 58076 KB
test_ABC_10.txt 359 ms 57692 KB
test_ABC_11.txt 365 ms 58332 KB
test_ABC_12.txt 354 ms 58076 KB
test_ABC_13.txt 359 ms 57820 KB
test_ABC_14.txt 363 ms 57564 KB
test_ABC_15.txt 362 ms 58076 KB
test_ABC_16.txt 358 ms 58204 KB
test_ABC_17.txt 364 ms 57692 KB
test_ABC_18.txt 361 ms 57692 KB
test_ABC_19.txt 369 ms 58332 KB
test_ABC_20.txt 364 ms 58076 KB
test_ABC_21.txt 334 ms 54876 KB
test_ABC_22.txt 357 ms 57692 KB
test_ABC_23.txt 352 ms 56540 KB
test_ABC_24.txt 352 ms 57308 KB
test_ABC_25.txt 370 ms 57820 KB
test_ABC_26.txt 367 ms 58204 KB
test_ABC_27.txt 366 ms 58332 KB
test_ABC_28.txt 390 ms 58332 KB
test_BC_29.txt 415 ms 59228 KB
test_BC_30.txt 397 ms 59228 KB
test_BC_31.txt 439 ms 59996 KB
test_BC_32.txt 432 ms 59868 KB
test_BC_33.txt 477 ms 60380 KB
test_BC_34.txt 466 ms 60764 KB
test_BC_35.txt 424 ms 60124 KB
test_BC_36.txt 449 ms 59996 KB
test_BC_37.txt 437 ms 60124 KB
test_BC_38.txt 436 ms 59740 KB
test_BC_39.txt 420 ms 59740 KB
test_BC_40.txt 472 ms 60764 KB
test_BC_41.txt 470 ms 60784 KB
test_BC_42.txt 506 ms 61020 KB
test_BC_43.txt 428 ms 60124 KB
test_BC_44.txt 415 ms 59740 KB
test_BC_45.txt 425 ms 59740 KB
test_BC_46.txt 472 ms 60252 KB
test_BC_47.txt 439 ms 59996 KB
test_BC_48.txt 481 ms 60764 KB
test_BC_49.txt 464 ms 59996 KB
test_BC_50.txt 463 ms 60636 KB
test_BC_51.txt 482 ms 61020 KB
test_BC_52.txt 398 ms 59100 KB
test_BC_53.txt 400 ms 59228 KB
test_BC_54.txt 419 ms 58844 KB
test_BC_55.txt 538 ms 61916 KB
test_C_56.txt 737 ms 66780 KB
test_C_57.txt 1033 ms 72028 KB
test_C_58.txt 1124 ms 73052 KB
test_C_59.txt 997 ms 69980 KB
test_C_60.txt 659 ms 65628 KB
test_C_61.txt 891 ms 68444 KB
test_C_62.txt 834 ms 67292 KB
test_C_63.txt 898 ms 68316 KB
test_C_64.txt 822 ms 67292 KB
test_C_65.txt 941 ms 70236 KB
test_C_66.txt 927 ms 68956 KB
test_C_67.txt 960 ms 71132 KB
test_C_68.txt 714 ms 66140 KB
test_C_69.txt 792 ms 66396 KB
test_C_70.txt 864 ms 68316 KB
test_C_71.txt 1030 ms 72156 KB
test_C_72.txt 1301 ms 76764 KB
test_C_73.txt 1066 ms 71644 KB
test_C_74.txt 1025 ms 71772 KB
test_C_75.txt 1009 ms 71200 KB
test_C_76.txt 1056 ms 72924 KB
test_C_77.txt 1074 ms 71516 KB
test_C_78.txt 1146 ms 72796 KB
test_C_79.txt 699 ms 65372 KB
test_C_80.txt 741 ms 66012 KB
test_C_81.txt 803 ms 66780 KB
test_C_82.txt 1506 ms 78948 KB