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
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
#include <stdio.h>
#include <initializer_list>

#define scan(args...) [&]{ return scanf(args); }();

long long gcd(long long a, long long b)
{
    while (b != 0)
    {
        long long c = a % b;
        a = b;
        b = c;
    }
    return a;
}

long long nww(long long a, long long b)
{
    return a / gcd(a, b) * b;
}

struct fraction
{
    long long nom;
    long long den;
    
    fraction() { }
    
    fraction(long long a)
    { nom = a; den = 1; }
    
    void simplify()
    {
        long long g = gcd(nom, den);
        
        nom /= g;
        den /= g;
    }
};

fraction operator+(fraction a, fraction b)
{
    fraction result;
    
    result.nom = a.nom * b.den + b.nom * a.den;
    result.den = a.den * b.den;
    
    result.simplify();
    
    return result;
}

fraction operator-(fraction a, fraction b)
{
    fraction result;
    
    result.nom = a.nom * b.den - b.nom * a.den;
    result.den = a.den * b.den;
    
    result.simplify();
    
    return result;
}

fraction operator/(fraction a, long long b)
{
    fraction result;
    
    result.nom = a.nom;
    result.den = a.den * b;
    
    result.simplify();
    
    return result;
}

fraction operator*(fraction a, long long b)
{
    fraction result;
    
    result.nom = a.nom * b;
    result.den = a.den;
    
    result.simplify();
    
    return result;
}

bool is_integer(fraction a)
{
    return a.den == 1;
}

int to_int(fraction a)
{
    return (int) (a.nom / a.den);
}

bool operator<(fraction a, fraction b)
{
    return a.nom * b.den < b.nom * a. den;
    long long aip = a.nom / a.den;
    long long bip = b.nom / b.den;
    
    if (aip != bip) return aip < bip;
    
    return (a.nom % a.den) < (b.nom % b.den);
}

bool operator==(fraction a, fraction b)
{
    return (a.nom == b.nom) && (a.den == b.den);
}

void print_fraction(fraction a)
{
    printf("%lld / %lld\n", a.nom, a.den);
}

void print_float(fraction a)
{
    printf("%.15lf\n", (double)a.nom / a.den);
}

enum t
{
    breaks,
    overtake_down,
    overtake_up
};

const int max_size = 2e5;

int L;
int v[4];
char lines[3][max_size+1];
int next_car[3][max_size+1];
int next_overtake[3][max_size+1];

int main()
{
    scan("%d", &L);
    
    for (int i = 0; i < 4; i++) scan("%d", &v[i]);
    for (int i = 0; i < 3; i++) scan("%s", lines[i]);
    
    lines[2][0] = '.'; // Usuwamy Karola :(
    
    for (int j = 0; j < 3; j++)
    {
        next_car[j][L] = -1;
        next_overtake[j][L] = -1;
        for (int i = L-1; i >= 0; i--)
        {
            if (lines[j][i] == '#') next_car[j][i] = i;
            else next_car[j][i] = next_car[j][i+1];
            
            if (lines[j][i] == '#' && lines[j][i+1] != '#')
                next_overtake[j][i] = i+1; 
            else
                next_overtake[j][i] = next_overtake[j][i+1];
        }
    }
    
    int predkosc_karola[3];
    fraction polozenie_karola[3] = {0, 0, 0};
    fraction T = 0;
    
    for (int i = 0; i < 3; i++)
        if (lines[i][1] == '.')
            predkosc_karola[i] = v[0];
        else
            predkosc_karola[i] = v[i+1];
    
    while (true)
    {
        fraction next_event = 1000000000;
        t event_type;
        int event_line;
        

        
        /* overtake down */
        for (int i = 0; i < 2; i++)
        {
            fraction pozycja_karola = polozenie_karola[i] - T * v[i+2];
            if (to_int(pozycja_karola) < L)
            {
                int nastepny_samochod = next_overtake[i+1][to_int(pozycja_karola)];
                
                if (nastepny_samochod != -1)
                {
                    fraction delta_czas = (nastepny_samochod - pozycja_karola) / (predkosc_karola[i] - v[i+2]);
/*printf("%d\n", nastepny_samochod);
print_float(pozycja_karola);
printf("%d - %d\n", predkosc_karola[i], v[i+2]);

print_float(delta_czas);*/

                    if (delta_czas < next_event)
                    {
                        next_event = delta_czas;
                        event_type = overtake_down;
                        event_line = i;
                    }
                }
            }
        }
        
        /* overtake up */
        for (int i = 1; i < 3; i++)
        {
            if (predkosc_karola[i] == v[0])
            {
                fraction pozycja_karola = polozenie_karola[i] - T * v[i];
                if (to_int(pozycja_karola) < L)
                {
                    int nastepny_samochod = next_overtake[i-1][to_int(pozycja_karola)];
                    
                    if (nastepny_samochod != -1)
                    {
                        fraction delta_czas = (nastepny_samochod - pozycja_karola) / (predkosc_karola[i] - v[i]);
                        
                        if (delta_czas < next_event)
                        {
                            next_event = delta_czas;
                            event_type = overtake_up;
                            event_line = i;
                        }
                    }
                }
            }
        }
        
        /* breaks */
        for (int i = 0; i < 3; i++)
        {
            if (predkosc_karola[i] == v[0])
            {
                fraction pozycja_karola = polozenie_karola[i] - T * v[i+1];
                
                if (to_int(pozycja_karola) < L)
                {
                    int nastepny_samochod = next_car[i][to_int(pozycja_karola)] - 1;
                    
                    if (nastepny_samochod != -2)
                    {
                        fraction delta_czas = (nastepny_samochod - pozycja_karola) / (predkosc_karola[i] - v[i+1]);
//printf("%d :", i);
//print_float(delta_czas);
                        if (delta_czas < next_event)
                        {
                            next_event = delta_czas;
                            event_type = breaks;
                            event_line = i;
                        }
                    }
                }
            }
        }
        
        if (next_event == fraction(1000000000))
        {
            print_float(T);
            return 0;
        }

//if (event_type != breaks)
/*{
print_fraction(next_event);
printf("%d %d\n\n", int(event_type), event_line);
}*/
        
        T = T + next_event;
        for (int i = 0; i < 3; i++)
            polozenie_karola[i] = polozenie_karola[i] + next_event * predkosc_karola[i];
        
        if (event_type == breaks)
        {
            predkosc_karola[event_line] = v[event_line+1];
        }
        else if (event_type == overtake_down)
        {
            if (polozenie_karola[event_line+1] < polozenie_karola[event_line])
            {
                polozenie_karola[event_line+1] = polozenie_karola[event_line];
                /*if (lines[event_line+1][to_int(polozenie_karola[event_line] - T * v[event_line+2]) + 1] == '#')
                    predkosc_karola[event_line+1] = v[0];
                else
                    predkosc_karola[event_line+1] = v[event_line+2];*/
                predkosc_karola[event_line+1] = v[0];
                
                // Double overtake!
                if (event_line == 0 && polozenie_karola[2] < polozenie_karola[0])
                {
                    fraction pos = polozenie_karola[0] - T * v[3];
                    int ipos = to_int(pos);
                    
                    if (ipos >= L || lines[2][ipos] == '.')
                    {
                        if (is_integer(pos) || (ipos+1 >= L || lines[2][ipos+1] == '.'))
                        {
                            polozenie_karola[2] = polozenie_karola[0];
                            predkosc_karola[2] = v[0];
//printf("double overtake!\n");
                        }
                    }
                }
            }
        }
        else if (event_type == overtake_up)
        {
            if (polozenie_karola[event_line-1] < polozenie_karola[event_line])
            {
                polozenie_karola[event_line-1] = polozenie_karola[event_line];
                /*if (lines[event_line+1][to_int(polozenie_karola[event_line] - T * v[event_line+2]) + 1] == '#')
                    predkosc_karola[event_line+1] = v[0];
                else
                    predkosc_karola[event_line+1] = v[event_line+2];*/
                predkosc_karola[event_line-1] = v[0];
                
                // Double overtake!
                if (event_line == 2 && polozenie_karola[0] < polozenie_karola[2])
                {
                    fraction pos = polozenie_karola[2] - T * v[1];
                    int ipos = to_int(pos);
                    
                    if (ipos >= L || lines[0][ipos] == '.')
                    {
                        if (is_integer(pos) || (ipos+1 >= L || lines[0][ipos+1] == '.'))
                        {
                            polozenie_karola[0] = polozenie_karola[2];
                            predkosc_karola[0] = v[0];
//printf("double overtake!\n");
                        }
                    }
                }
            }
        }

    }

    return 0;
}