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
| #include <bits/stdc++.h>
bool maze[1025][1025];
void DC(int,int,int);
void solve(int,int,int);
void solve(int N,int X,int Y){
memset(maze, 0, sizeof(maze));
maze[X][Y] = 1;
DC(1,1,N);
}
void DC(int x,int y,int n){
if(n<=1)return;
int new_N = n/2,x_pos=0,y_pos=0;
for(int i=x;i<x+n;i++){
for(int j=y;j<y+n;j++){
if(maze[i][j] == 1){
x_pos = i;
y_pos = j;
break;
}
}
}
int pos;
if(x_pos>=x+new_N){
if(y_pos>=y+new_N)pos = 4;
else pos = 3;
}
else{
if(y_pos>=y+new_N)pos = 2;
else pos = 1;
}
int nx = x+new_N,ny = y+new_N;
switch (pos) {
case 1:
Report(nx, ny, nx-1, ny, nx, ny-1);
maze[nx][ny] = 1;
maze[nx-1][ny] = 1;
maze[nx][ny-1] = 1;
break;
case 2:
ny = ny-1;
Report(nx, ny, nx-1, ny, nx, ny+1);
maze[nx][ny] = 1;
maze[nx-1][ny] = 1;
maze[nx][ny+1] = 1;
break;
case 3:
nx = nx-1;
Report(nx, ny, nx+1, ny, nx, ny-1);
maze[nx][ny] = 1;
maze[nx+1][ny] = 1;
maze[nx][ny-1] = 1;
break;
case 4:
ny = ny-1;nx = nx-1;
Report(nx, ny, nx+1, ny, nx, ny+1);
maze[nx][ny] = 1;
maze[nx+1][ny] = 1;
maze[nx][ny+1] = 1;
break;
default:
break;
}
DC(x, y, new_N);
DC(x+new_N, y, new_N);
DC(x, y+new_N, new_N);
DC(x+new_N, y+new_N, new_N);
}
|