Algorithm_Problem_Solution/10812.py at master · kimch0612/Algorithm_Problem_Solution · GitHub

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
N, M = map(int, input().split())
basket = [0] * N
o = 1

for i in range(0, N):
    basket[i] = o
    o += 1

for __ in range(0, M):
    o = 0
    i, j, k = map(int, input().split())
    basket_temp = [0] * int(j-i+1)
    basket_begin = [0] * int()

# for __ in range(0, M):
#     o = 0
#     i, j, k = map(int, input().split())
#     basket_temp = [0] * int(j-i+1)
#     basket_begin = [0] * int(k-4)
#     basket_end = [0] * int(j-k+1)
#     for _ in range(0, int(j-i+1)):
#         basket_temp[_] = basket[i+_-1]
#     for _ in range(0, int(k-4)):
#         basket_begin[_] = basket_temp[_]
#     for _ in range(0, j-k+1):
#         basket_end [_] = basket_temp[k+_-1]
#     # for _ in range(0, j-k+1):
#     #     basket[o] = basket_end[_]
#     #     o += 1
#     # for _ in range(0, int(k-2)):
#     #     basket[o] = basket_begin[_]
#     #     o += 1
#     # basket[o] = int(k-1)

print(*basket)
print(*basket_temp)
print(*basket_begin)
print(*basket_end)
print(*basket)