#48818 (Python3) No.177 制作進行の宮森あおいです！

• 問題: No.177 制作進行の宮森あおいです！
• ユーザー: しらっ亭
• 提出日時: 2015-09-11 03:24:18
• 言語: Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1)
• 結果: AC
• 実行時間: 32 ms / 2,000 ms
• コード長: 2,650 bytes
• コンパイル時間: 173 ms
• コンパイル使用メモリ: 12,800 KB
• 実行使用メモリ: 11,392 KB
• 最終ジャッジ日時: 2024-07-19 05:14:59
• 合計ジャッジ時間: 1,453 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
sample	AC * 3
other	AC * 13

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
class Edge:
    def __init__(self, to, cap, rev):
        self.to = to
        self.cap = cap
        self.rev = rev
class Dinic:
    def __init__(self, V):
        self.V = V
        self.size = [0] * V
        """:type : list[int]"""
        self.level = []
        """:type : list[int]"""
        self.iterator = []
        """:type : list[int]"""
        self.G = [[] for i in range(V)]
        """:type : list[list[Edge]]"""
    def add_edge(self, _from, to, cap):
        self.G[_from].append(Edge(to, cap, self.size[to]))
        self.G[to].append(Edge(_from, 0, self.size[_from]))
        self.size[_from] += 1
        self.size[to] += 1
    def bfs(self, s):
        from collections import deque
        level = [-1 for i in range(self.V)]
        level[s] = 0
        q = deque([s])
        while q:
            v = q.popleft()
            for u in self.G[v]:
                if u.cap > 0 > level[u.to]:
                    level[u.to] = level[v] + 1
                    q.append(u.to)
        return level
    def dfs(self, v, t, f):
        if v == t: return f
        for i in range(self.iterator[v], self.size[v]):
            self.iterator[v] = i
            edge = self.G[v][i]
            if edge.cap > 0 and self.level[v] < self.level[edge.to]:
                d = self.dfs(edge.to, t, f if f < edge.cap else edge.cap)
                if d > 0:
                    self.G[v][i].cap -= d
                    self.G[edge.to][edge.rev].cap += d
                    return d
        return 0
    def max_flow(self, s, t):
        flow = 0
        while True:
            self.level = self.bfs(s)
            if self.level[t] < 0:
                return flow
            self.iterator = [0 for i in range(self.V)]
            while True:
                f = self.dfs(s, t, float('inf'))
                if f == 0:
                    break
                flow += f
def solve():
    inf = float('inf')
    W = int(input())
    N = int(input())
    J = list(map(int, input().split()))
    M = int(input())
    C = list(map(int, input().split()))
    xs = []
    for i in range(M):
        q = list(map(int, input().split()))
        for k in q[1:]:
            xs.append((k - 1, i))
    dinic = Dinic(2 + N + M)
    xs = set(xs)
    for n in range(N):
        for m in range(M):
            if (n, m) not in xs:
                dinic.add_edge(2 + n, 2 + N + m, inf)
    for n in range(N):
        dinic.add_edge(0, 2 + n, J[n])
    for m in range(M):
        dinic.add_edge(2 + N + m, 1, C[m])
    mf = dinic.max_flow(0, 1)
    print('SHIROBAKO' if mf >= W else 'BANSAKUTSUKITA')
if __name__ == '__main__':
    solve()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX