AtCoder Beginner Contest 004

Submission #6901884

Source codeソースコード

# -*- 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

Task問題 D - マーブル
User nameユーザ名 Coki628
Created time投稿日時
Language言語 PyPy3 (2.4.0)
Status状態 MLE
Score得点 0
Source lengthソースコード長 2712 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
sample_01_ABC.txt MLE
sample_02_BC.txt MLE
sample_03_C.txt MLE
test_ABC_01.txt MLE
test_ABC_02.txt MLE
test_ABC_03.txt MLE
test_ABC_04.txt MLE
test_ABC_05.txt MLE
test_ABC_06.txt MLE
test_ABC_07.txt MLE
test_ABC_08.txt MLE
test_ABC_09.txt MLE
test_ABC_10.txt MLE
test_ABC_11.txt MLE
test_ABC_12.txt MLE
test_ABC_13.txt MLE
test_ABC_14.txt MLE
test_ABC_15.txt MLE
test_ABC_16.txt MLE
test_ABC_17.txt MLE
test_ABC_18.txt MLE
test_ABC_19.txt MLE
test_ABC_20.txt MLE
test_ABC_21.txt MLE
test_ABC_22.txt MLE
test_ABC_23.txt MLE
test_ABC_24.txt MLE
test_ABC_25.txt MLE
test_ABC_26.txt MLE
test_ABC_27.txt MLE
test_ABC_28.txt MLE
test_BC_29.txt MLE
test_BC_30.txt MLE
test_BC_31.txt MLE
test_BC_32.txt MLE
test_BC_33.txt MLE
test_BC_34.txt MLE
test_BC_35.txt MLE
test_BC_36.txt MLE
test_BC_37.txt MLE
test_BC_38.txt MLE
test_BC_39.txt MLE
test_BC_40.txt MLE
test_BC_41.txt MLE
test_BC_42.txt MLE
test_BC_43.txt MLE
test_BC_44.txt MLE
test_BC_45.txt MLE
test_BC_46.txt MLE
test_BC_47.txt MLE
test_BC_48.txt MLE
test_BC_49.txt MLE
test_BC_50.txt MLE
test_BC_51.txt MLE
test_BC_52.txt MLE
test_BC_53.txt MLE
test_BC_54.txt MLE
test_BC_55.txt MLE
test_C_56.txt MLE
test_C_57.txt MLE
test_C_58.txt MLE
test_C_59.txt MLE
test_C_60.txt MLE
test_C_61.txt MLE
test_C_62.txt MLE
test_C_63.txt MLE
test_C_64.txt MLE
test_C_65.txt MLE
test_C_66.txt MLE
test_C_67.txt MLE
test_C_68.txt MLE
test_C_69.txt MLE
test_C_70.txt MLE
test_C_71.txt MLE
test_C_72.txt MLE
test_C_73.txt MLE
test_C_74.txt MLE
test_C_75.txt MLE
test_C_76.txt MLE
test_C_77.txt MLE
test_C_78.txt MLE
test_C_79.txt MLE
test_C_80.txt MLE
test_C_81.txt MLE
test_C_82.txt MLE