-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathccc11j4.cpp
78 lines (76 loc) · 1.9 KB
/
ccc11j4.cpp
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
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<vector<bool>> aa (1000, vector<bool>(500, false));
aa[400][500] = 1;
aa[399][500] = 1;
aa[398][500] = 1;
aa[398][501] = 1;
aa[398][502] = 1;
aa[398][503] = 1;
aa[397][503] = 1;
aa[396][503] = 1;
aa[396][504] = 1;
aa[396][505] = 1;
aa[397][505] = 1;
aa[398][505] = 1;
aa[398][506] = 1;
aa[398][507] = 1;
aa[397][507] = 1;
aa[396][507] = 1;
aa[395][507] = 1;
aa[394][507] = 1;
aa[394][506] = 1;
aa[394][505] = 1;
aa[394][504] = 1;
aa[394][503] = 1;
aa[394][502] = 1;
aa[394][501] = 1;
aa[394][500] = 1;
aa[394][499] = 1;
aa[395][499] = 1;
aa[396][499] = 1;
int a, pX = 396, pY = 499;
bool dan = false;
char c;
scanf(" %c%i", &c, &a);
while (c != 'q')
{
switch (c)
{
case 'd':
for (int x = 1; x <= a; aa[pX-x][pY] = true, x++)
if (aa[pX-x][pY])
dan = true;
pX -= a;
break;
case 'u':
for (int x = 1; x <= a; aa[pX+x][pY] = true, x++)
if (aa[pX+x][pY])
dan = true;
pX += a;
break;
case 'l':
for (int x = 1; x <= a; aa[pX][pY-x] = true, x++)
if (aa[pX][pY-x])
dan = true;
pY -= a;
break;
case 'r':
for (int x = 1; x <= a; aa[pX][pY+x] = true, x++)
if (aa[pX][pY+x])
dan = true;
pY += a;
break;
}
if (dan)
goto DANGER;
printf("%i %i safe\n", pY-500, pX-401);
scanf(" %c%i", &c, &a);
}
return 0;
DANGER:
printf("%i %i DANGER\n", pY-500, pX-401);
return 0;
}