AtCoderの1問ドはまりしました
以下の問題にドはまりしました
というかまだ解けてない
ABC 047 B - Snuke's Coloring 2 (ABC Edit) (二次元配列を用意します)
https://atcoder.jp/contests/abc047/tasks/abc047_b
W, H, N = map(int, input().split()) a = [[1 for j in range(W)] for i in range(H)] # H #y=3 [1, 1, 1, 1, 1] #y=2 [1, 1, 1, 1, 1] #y=1 [1, 1, 1, 1, 1] #y=0 [1, 1, 1, 1, 1] #x= 0 1 2 3 4 W print(a) for i in range(N): x, y, z = map(int, input().split()) if z == 1: #print(x, y) #print("xx < x") for i in range(W-1): for j in range(H-1): if j < x - 1: print(i, j) a[i][j] = 0 elif z == 2: #print(x, y) #print("xx > x") for i in range(W-1): for j in range(H-1): if j > x - 1: print(i, j) a[i][j] = 0 elif z == 3: #print(x, y) #print("yy < y") for i in range(H-1): for j in range(W-1): print(j, i) if i > y -1 : print(j, i) a[j][i] = 0 else: #print(x, y) #print("yy > y") for i in range(H-1): for j in range(W-1): print(j, i) if i < y-1 : print(j, i) a[j][i] = 0 print(a) sum = 0 for i in range(W-1): for j in range(H-1): sum += a[i][j] print(sum)
y軸側がうまく動かなくて四苦八苦
もうちょっと粘ってみます
以上