# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165604 | boolodifjenula | Kocka (COCI18_kocka) | Cpython 3 | 1077 ms | 65540 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
n=int(input())
L=list(map(int,input().split()))
R=list(map(int,input().split()))
G=list(map(int,input().split()))
D=list(map(int,input().split()))
K=n*[n*[7]]
t=1
for i in range(n):
#print(K)
if L[i]==-1:
K[i]=n*[0]
else:
p=K[i][L[i]+1:]
K[i]=L[i]*[0]+[1]+p
for i in range(n):
#print(K)
if R[i]==-1:
if 1 in K[i]:
t=0
break
K[i]=n*[0]
else:
p=K[i][:n-R[i]-1]
if 1 in K[i][n-R[i]:]:
t=0
break
if K[i][n-R[i]-1]==0:
t=0
break
K[i]=p+[1]+R[i]*[0]
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |