SHOW:
|
|
- or go back to the newest paste.
1 | n = int(input()) | |
2 | e = [int(i) for i in input().split()] | |
3 | - | q1 = [] |
3 | + | |
4 | - | for i in range(n): |
4 | + | dop = 'c' * e[1] |
5 | - | w = [int(i) for i in input().split()] |
5 | + | q.append(dop) |
6 | - | if w[0] == w[2] and w[1] == w[3]: |
6 | + | otvet= [] |
7 | - | n -= 1 |
7 | + | for i in range(e[0]): |
8 | - | else: |
8 | + | w = 'c' |
9 | - | q.append(w) |
9 | + | inp = input() |
10 | - | if n == 0: |
10 | + | w += inp |
11 | - | print(24 * 60) |
11 | + | w += 'c' |
12 | - | else: |
12 | + | q.append(w) |
13 | - | proverka = 0 |
13 | + | otvet.append(inp) |
14 | - | for j in q: |
14 | + | o = 0 |
15 | - | if j[0] > j[2]: |
15 | + | q.append(dop) |
16 | - | proverka = 1 |
16 | + | for i in range(e[0]): |
17 | - | if proverka == 1: |
17 | + | for j in range(e[1]): |
18 | - | for i in range(n): |
18 | + | if q[i][j] == '.' and o == 0: |
19 | - | if q[i][0] > q[i][2]: |
19 | + | if q[i][j - 1] == 'A': |
20 | - | dop_peremen = q[i][:] |
20 | + | q[i].replace(q[i][j], 'A') |
21 | - | dop_peremen[0] = 0 |
21 | + | for x in range(1, e[0] + 1, 1): |
22 | - | dop_peremen[1] = 0 |
22 | + | dop1 = [] |
23 | - | q1.append(dop_peremen) |
23 | + | for y in range(1, e[1] + 2, 1): |
24 | - | q[i][2] = 24 |
24 | + | if q[x][y] != 'c': |
25 | - | q[i][3] = 0 |
25 | + | dop1.append(q[x][y]) |
26 | - | else: |
26 | + | print(*dop1) |
27 | - | q1.append(q[i]) |
27 | + | o = 1 |
28 | - | nachalo = -1 |
28 | + | elif q[i][j + 1] == 'A': |
29 | - | konec = 24 * 60 + 1 |
29 | + | q[i].replace(q[i][j], 'A') |
30 | - | for i in range(n): |
30 | + | for x in range(1, e[0] + 1, 1): |
31 | - | if (q[i][0] * 60 + q[i][1]) >= nachalo: |
31 | + | dop1 = [] |
32 | - | nachalo = q[i][0] * 60 + q[i][1] |
32 | + | for y in range(1, e[1] + 2, 1): |
33 | - | if (q[i][2] * 60 + q[i][3]) <= konec: |
33 | + | if q[x][y] != 'c': |
34 | - | konec = q[i][2] * 60 + q[i][3] |
34 | + | dop1.append(q[x][y]) |
35 | - | o = konec - nachalo |
35 | + | print(*dop1) |
36 | - | if proverka == 0: |
36 | + | o = 1 |
37 | - | if o > 0: |
37 | + | elif q[i + 1][j] == 'A': |
38 | - | print(o) |
38 | + | q[i].replace(q[i][j], 'A') |
39 | - | else: |
39 | + | for x in range(1, e[0] + 1, 1): |
40 | - | print(0) |
40 | + | dop1 = [] |
41 | - | else: |
41 | + | for y in range(1, e[1] + 2, 1): |
42 | - | if o < 0: |
42 | + | if q[x][y] != 'c': |
43 | - | o = 0 |
43 | + | dop1.append(q[x][y]) |
44 | - | nachalo = q1[0][0] * 60 + q1[0][1] |
44 | + | print(*dop1) |
45 | - | konec = q1[0][2] * 60 + q1[0][3] |
45 | + | o = 1 |
46 | - | for i in range(n): |
46 | + | elif q[i - 1][j] == 'A': |
47 | - | if (q1[i][0] * 60 + q1[i][1]) > nachalo: |
47 | + | q[i].replace(q[i][j], 'A') |
48 | - | nachalo = q1[i][0] * 60 + q1[i][1] |
48 | + | for x in range(1, e[0] + 1, 1): |
49 | - | if (q1[i][2] * 60 + q1[i][3]) < konec: |
49 | + | dop1 = [] |
50 | - | konec = q1[i][2] * 60 + q1[i][3] |
50 | + | for y in range(1, e[1] + 2, 1): |
51 | - | o1 = konec - nachalo |
51 | + | if q[x][y] != 'c': |
52 | - | if o1 > 0: |
52 | + | dop1.append(q[x][y]) |
53 | - | print(o + o1) |
53 | + | print(*dop1) |
54 | - | else: |
54 | + | o = 1 |
55 | - | print(o) |
55 | + | if o == 0: |
56 | for i in otvet: | |
57 | print(i) |