-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path20056.c
148 lines (129 loc) · 2.45 KB
/
20056.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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
#include <stdio.h>
#include <string.h>
#define NMAX 51
int N, M, K;
typedef struct
{
int r, c, m, s , d;
} Fireball;
Fireball fire[10000];
typedef struct
{
int m, s, d, odd, even, count;
} Map;
Map map[NMAX][NMAX];
int dx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
int temp, time;
void initialize()
{
memset(map, 0, sizeof(map));
}
void aftermove()
{
int i, j, k;
time = 0;
for(i=0; i<N; i++)
for(j=0; j<N; j++)
if(time == temp) // no more
return;
else if(map[i][j].count == 1)
{
//Fireball temp = {i, j, map[i][j].m, map[i][j].s, map[i][j].d};
//fire[M++] = temp;
fire[M].r = i;
fire[M].c = j;
fire[M].m = map[i][j].m;
fire[M].s = map[i][j].s;
fire[M++].d = map[i][j].d;
time++;
}
else if(map[i][j].count > 1)
{
if(map[i][j].m / 5 == 0)
continue;
else if(map[i][j].odd && map[i][j].even) // both 1
for(k=1; k<=7; k += 2)
{
//Fireball temp = {i, j, map[i][j].m/5, map[i][j].s/map[i][j].count, k};
//fire[M++] = temp;
fire[M].r = i;
fire[M].c = j;
fire[M].m = map[i][j].m / 5;
fire[M].s = map[i][j].s / map[i][j].count;
fire[M++].d = k;
}
else
{
for(k=0; k<=6; k += 2)
{
//Fireball temp = {i, j, map[i][j].m/5, map[i][j].s/map[i][j].count, k};
//fire[M++] = temp;
fire[M].r = i;
fire[M].c = j;
fire[M].m = map[i][j].m / 5;
fire[M].s = map[i][j].s / map[i][j].count;
fire[M++].d = k;
}
}
time++;
}
}
void move()
{
temp = M;
while(0 < M)
{
int go = fire[--M].s % N;
int x = fire[M].r + dx[fire[M].d] * go;
int y = fire[M].c + dy[fire[M].d] * go;
if(x >= N)
x -= N;
else if(x < 0)
x += N;
if(y >= N)
y -= N;
else if(y < 0)
y += N;
if(fire[M].d % 2 == 0) // even
map[x][y].even = 1;
else
map[x][y].odd = 1;
map[x][y].count++;
map[x][y].m += fire[M].m;
map[x][y].s += fire[M].s;
map[x][y].d = fire[M].d;
}
/*
for(int i= 0; i<N; i++)
{
for(int j=0; j<N; j++)
printf("%d ", map[i][j].count);
printf("\n");
}
*/
}
void around()
{
move();
aftermove();
initialize();
}
int main(void)
{
int i;
int remain=0;
scanf("%d %d %d", &N, &M, &K);
for(i=0; i<M; i++)
{
scanf("%d %d %d %d %d", &fire[i].r, &fire[i].c, &fire[i].m, &fire[i].s, &fire[i].d);
fire[i].r--;
fire[i].c--;
}
for(i=0; i<K; i++)
around();
for(i=0; i<M; i++)
remain += fire[i].m;
printf("%d", remain);
return 0;
}