Submission #23734

#	Time	Username	Problem	Language	Result	Execution time	Memory
23734		leejseo	사냥꾼 (KOI13_hunter)	Cpython 2	70 / 100	173 ms	13 KiB

hunter

def main():
    m, n, l = map(int, raw_input().split())
    s = map(int, raw_input().split())
    a = []
    for i in range (n) :
        h = map(int, raw_input().split())
        a.append(h[::])
    a.sort()
    s.sort()
    answer = 0
    j = 0
    for i in range (n) :
        while (j<m) and s[j] < a[i][0] :
            j+=1
        flag = False
        if (j > 0) and (a[i][0] - s[j-1] + a[i][1] <= l) : flag = True
        if (j < m) and (s[j] - a[i][0] + a[i][1] <= l) : flag = True
        if flag : answer += 1
    print answer
    return
main()

• Subtask 1: 10 / 10
• Subtask 2: 17 / 17
• Subtask 3: 21 / 21
• Subtask 4: 22 / 22
• Subtask 5: 0 / 30