PythonでJOI難易度4を埋める - Qiita

a, b = map(int,input().split()) n = int(input()) c = [list(map(int,input().split())) for _ in range(n)] def solver(s,t,cons): m = [[0] * s for _ in range(t)] #上で説明したlist for i in range(s): #横の端は1で固定 for con in cons: if con[0] == i + 1 and con[1] == 1: #工事中の交差点が端にあった場合の処理 break else: m[0][i] = 1 continue break for i in range(t): #同様に縦も for con in cons: if con[0] == 1 and con[1] == i + 1: break else