|
| 1 | +import os |
| 2 | +import sys |
| 3 | + |
| 4 | +sys.stdin = open( |
| 5 | + os.path.join("/", *__file__.split("/")[:-1], "sample_input.txt"), "r" |
| 6 | +) |
| 7 | + |
| 8 | +# https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV597vbqAH0DFAVl |
| 9 | + |
| 10 | + |
| 11 | +DR = [-1, 1, 0, 0] |
| 12 | +DC = [0, 0, -1, 1] |
| 13 | + |
| 14 | + |
| 15 | +class Cluster: |
| 16 | + def __init__(self, r: int, c: int, n: int, d: int): |
| 17 | + self.loc = (r, c) |
| 18 | + self.n = n |
| 19 | + self.d = d - 1 |
| 20 | + |
| 21 | + def __iadd__(self, other): |
| 22 | + self.n += other.n |
| 23 | + return self |
| 24 | + |
| 25 | + def __repr__(self): |
| 26 | + return str(self.n) |
| 27 | + |
| 28 | + |
| 29 | +def is_boundary(r: int, c: int): |
| 30 | + return r == 0 or r == m - 1 or c == 0 or c == m - 1 |
| 31 | + |
| 32 | + |
| 33 | +def step(): |
| 34 | + cluster_map = [[0 for _ in range(m)] for _ in range(m)] |
| 35 | + for _id in sorted( |
| 36 | + list(clusters.keys()), key=lambda _id: clusters[_id].n, reverse=True |
| 37 | + ): |
| 38 | + cluster = clusters[_id] |
| 39 | + |
| 40 | + r, c = cluster.loc |
| 41 | + _r, _c = r + DR[cluster.d], c + DC[cluster.d] |
| 42 | + |
| 43 | + if is_boundary(_r, _c): |
| 44 | + cluster.n //= 2 |
| 45 | + cluster.d ^= 1 |
| 46 | + |
| 47 | + if cluster_map[_r][_c]: |
| 48 | + clusters[cluster_map[_r][_c]] += cluster |
| 49 | + clusters.pop(_id) |
| 50 | + continue |
| 51 | + |
| 52 | + if not cluster.n: |
| 53 | + clusters.pop(_id) |
| 54 | + continue |
| 55 | + |
| 56 | + cluster.loc = (_r, _c) |
| 57 | + cluster_map[_r][_c] = _id |
| 58 | + |
| 59 | + |
| 60 | +for t in range(1, int(input()) + 1): |
| 61 | + m, n, k = map(int, input().split()) |
| 62 | + clusters = { |
| 63 | + _id: Cluster(*map(int, input().split())) for _id in range(1, k + 1) |
| 64 | + } |
| 65 | + for _ in range(n): |
| 66 | + step() |
| 67 | + |
| 68 | + print(f"#{t} {sum(cluster.n for cluster in clusters.values())}") |
0 commit comments