Submission #2119755


Source Code Expand

n,q=map(int,input().split())
s=[list(map(int,input().split())) for i in range(q)]
a=[]
for i in range(n):
    a.append(0)
l,r,t=[],[],[]
for i in range(q):
    l.append(s[i][0])
    r.append(s[i][1])
    t.append(s[i][2])
for i in range(q):
    b=[]
    for j in range(r[i]-l[i]+1):
        b.append(t[i])
    a[l[i]-1:r[i]]=b
for i in range(n):
    print(a[i])

Submission Info

Submission Time
Task B - 編集
User Hiss
Language Python (3.4.3)
Score 100
Code Size 377 Byte
Status AC
Exec Time 18 ms
Memory 3064 KB

Judge Result

Set Name sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 24
Set Name Test Cases
sample sample01.txt, sample02.txt
All 00.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, sample01.txt, sample02.txt, sample01.txt, sample02.txt
Case Name Status Exec Time Memory
00.txt AC 17 ms 3064 KB
01.txt AC 17 ms 3064 KB
02.txt AC 18 ms 3064 KB
03.txt AC 17 ms 3064 KB
04.txt AC 17 ms 3064 KB
05.txt AC 18 ms 3064 KB
06.txt AC 17 ms 3064 KB
07.txt AC 17 ms 3064 KB
08.txt AC 18 ms 3064 KB
09.txt AC 17 ms 3064 KB
10.txt AC 18 ms 3064 KB
11.txt AC 18 ms 3064 KB
12.txt AC 18 ms 3064 KB
13.txt AC 18 ms 3064 KB
14.txt AC 18 ms 3064 KB
15.txt AC 18 ms 3064 KB
16.txt AC 18 ms 3064 KB
17.txt AC 18 ms 3064 KB
18.txt AC 18 ms 3064 KB
19.txt AC 18 ms 3064 KB
sample01.txt AC 17 ms 3064 KB
sample02.txt AC 17 ms 3064 KB