在线评测:
http://codevs.cn/problem/4510/
整体思路:
枚举一的位置,然后模拟就行了
失误之处:
数据<39,然后,我就把记录上一个点的数组开到了39,orz,,然后只过了4个点,分明是39*39好么,,,
体会心得:
空间辣么多,数组开大点,,
AC代码:
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int n,mp[50][50],wx[2500],wy[2500],nn;
bool js;
void check(int x,int y)
{
memset(mp,0,sizeof(mp));
mp[x][y] = 1;
wx[1] = x;
wy[1] = y;
for
(int i = 2;i <= nn;i++)
{
if
(wx[i-1] == 1 && wy[i-1] != n)
{
int tx = n;
int ty = wy[i - 1] + 1;
if
(mp[tx][ty])
return
;
wx[i] = tx;
wy[i] = ty;
mp[tx][ty] = i;
}
else
if
(wx[i-1] != 1 && wy[i-1] == n)
{
int tx = wx[i - 1] - 1;
int ty = 1;
if
(mp[tx][ty])
return
;
wx[i] = tx;
wy[i] = ty;
mp[tx][ty] = i;
}
else
if
(wx[i-1] == 1 && wy[i - 1] == n)
{
int tx = wx[i - 1] + 1;
int ty = n;
if
(mp[tx][ty])
return
;
wx[i] = tx;
wy[i] = ty;
mp[tx][ty] = i;
}
else
{
if
(wx[i-1] != 1 && wy[i-1] != n)
{
if
(!mp[wx[i-1]-1][wy[i-1]+1])
{
mp[wx[i-1]-1][wy[i-1]+1] = i;
wx[i] = wx[i-1]-1;
wy[i] = wy[i-1]+1;
}
else
{
if
(mp[wx[i-1]+1][wy[i-1]])
{
return
;
}
else
{
mp[wx[i-1]+1][wy[i-1]] = i;
wx[i] = wx[i-1]+1;
wy[i] = wy[i-1];
}
}
}
}
}
for
(int i = 1;i <= n;i++)
{
for
(int j = 1;j <= n;j++)
printf(
"%d "
,mp[i][j]);
printf(
"\n"
);
}
js =
true
;
}
int main()
{
scanf(
"%d"
,&n);
nn = n * n;
for
(int i = 1;i <= n;i++)
{
for
(int j = 1;j <= n;j++)
{
check(i,j);
if
(js)
return
0;
}
}
return
0;
}
|