Submission #1796790


Source Code Expand

T = input()
N = input()
A = map(int, raw_input().split())

M = input()
B = map(int, raw_input().split())

def solve2():
    count = 0
    for b in B:
        if count == M:
            break
        if (A[count] <= b ) and (b <= A[count] + N):
            count += 1
    return count == M
    
print ('yes' if solve2() else 'no')

Submission Info

Submission Time
Task A - おいしいたこ焼きの作り方
User pirukuru
Language Python (2.7.6)
Score 0
Code Size 347 Byte
Status RE
Exec Time 14 ms
Memory 2944 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
RE × 33
Set Name Test Cases
All rand0.txt, rand1.txt, rand10.txt, rand11.txt, rand12.txt, rand13.txt, rand14.txt, rand15.txt, rand16.txt, rand17.txt, rand18.txt, rand19.txt, rand2.txt, rand20.txt, rand21.txt, rand22.txt, rand23.txt, rand24.txt, rand25.txt, rand26.txt, rand27.txt, rand28.txt, rand29.txt, rand3.txt, rand4.txt, rand5.txt, rand6.txt, rand7.txt, rand8.txt, rand9.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
rand0.txt RE 14 ms 2944 KB
rand1.txt RE 11 ms 2568 KB
rand10.txt RE 11 ms 2568 KB
rand11.txt RE 11 ms 2568 KB
rand12.txt RE 11 ms 2568 KB
rand13.txt RE 11 ms 2568 KB
rand14.txt RE 11 ms 2568 KB
rand15.txt RE 11 ms 2568 KB
rand16.txt RE 11 ms 2568 KB
rand17.txt RE 11 ms 2568 KB
rand18.txt RE 11 ms 2568 KB
rand19.txt RE 11 ms 2568 KB
rand2.txt RE 11 ms 2568 KB
rand20.txt RE 11 ms 2568 KB
rand21.txt RE 11 ms 2568 KB
rand22.txt RE 11 ms 2568 KB
rand23.txt RE 11 ms 2568 KB
rand24.txt RE 11 ms 2568 KB
rand25.txt RE 11 ms 2568 KB
rand26.txt RE 11 ms 2568 KB
rand27.txt RE 11 ms 2568 KB
rand28.txt RE 11 ms 2568 KB
rand29.txt RE 11 ms 2568 KB
rand3.txt RE 11 ms 2568 KB
rand4.txt RE 11 ms 2568 KB
rand5.txt RE 11 ms 2568 KB
rand6.txt RE 11 ms 2568 KB
rand7.txt RE 11 ms 2568 KB
rand8.txt RE 11 ms 2568 KB
rand9.txt RE 11 ms 2568 KB
s1.txt RE 11 ms 2568 KB
s2.txt RE 11 ms 2568 KB
s3.txt RE 11 ms 2568 KB