-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathP1563 玩具谜题.c
72 lines (66 loc) · 906 Bytes
/
P1563 玩具谜题.c
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
#include <stdio.h>
/*Black history*/
int careerr = 0;
int face[100001];
char career[100001][11];
int n, m;
int convert(int e)
{
if (e < 0)
{
e += (n);
return e;
}
else if (e > (n - 1))
{
e -= (n);
return e;
}
return e;
}
int x(int c, int d)
{
if (c == 0)
{
if (face[careerr] == 0)
{
careerr -= d;
}
else if (face[careerr] == 1)
{
careerr += d;
}
}
if (c == 1)
{
if (face[careerr] == 0)
{
careerr += d;
}
else if (face[careerr] == 1)
{
careerr -= d;
}
}
//printf("%d\n", careerr);
careerr = convert(careerr);
//printf("%d\n", careerr);
//printf("%c#\n", career[careerr]);
return careerr;
}
int main()
{
scanf("%d %d", &n, &m);
int i = 0;
for (int i = 0; i < n; i++)
{
scanf("%d %s", &face[i], &career[i]);
}
for (i = 0; i < m; i++)
{
int a, b;
scanf("%d %d", &a, &b);
careerr = x(a, b);
}
printf("%s", career[careerr]);
}