Submission #1364678

#	Time	Username	Problem	Language	Result	Execution time	Memory
1364678		zzzzzzzzzzzzzzz	Second Run (KAISTRUN26SPRING_A)	Pypy 3	100 / 100	301 ms	309828 KiB

Main

n,m=map(int,input().split())
li=[0]*(n+1)
li2=[-1]*(n+1)
for i in range(m):
    a,b,c,d,e=map(int,input().split())
    z=[a,b,c,d]
    if(min(li2[a],li2[b],li2[c],li2[d])>-1):continue
    else:
        s=li[a]+li[b]+li[c]+li[d]
        for j in z:
            if(li2[j]==-1):
                li[j]=(e-s)%4
                break
        for k in z:li2[k]=0
print(*li[1:])

Compilation message (stdout)

Compiling 'Main.py'...

=======
  adding: __main__.pyc (deflated 28%)

=======

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 40 / 40