50200. Chess
難度：3.2/5 Used Time: 14:32
一樣想好dx[], dy[]再下手。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#include <stdio.h>
#include <stdlib.h>
int h, w;
int arr[512][512] = {0};
int dx_q[8] = {1, -1, 0, 0, 1, 1, -1, -1};
int dy_q[8] = {0, 0, 1, -1, 1, -1, 1, -1};
int is_valid(int x, int y){
return x >= 0 && y >= 0 && x < h && y < w;
}
void place(int x, int y, int s, int f){
arr[x][y] = 1;
for(int i = s; i < f; i++){
int dx = dx_q[i], dy = dy_q[i];
int now_x = x + dx, now_y = y + dy;
while(is_valid(now_x, now_y) && arr[now_x][now_y] == 0){
arr[now_x][now_y] = 1;
now_x += dx, now_y += dy;
}
}
}
void print_board(){
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
printf("%d%c", arr[i][j], (j == w - 1) ? '\n' : ' ');
}
}
}
int main(){
scanf("%d %d", &h, &w);
int t, y, x;
while(scanf("%d %d %d", &t, &y, &x) != EOF){
if(t == 0) arr[x][y] = 1;
if(t == 1) place(x, y, 0, 8);
if(t == 2) place(x, y, 4, 8);
if(t == 3) place(x ,y, 0, 4);
}
print_board();
}