Submission #1199868

#	Time	Username	Problem	Language	Result	Execution time	Memory
1199868		ofoz	Inspections (NOI23_inspections)	Pypy 3	29 / 100	2086 ms	673464 KiB

Main

from sys import stdout, setrecursionlimit
from math import ceil, floor, sqrt, comb
from collections import deque

def higher(a: list[int], b: list[int]):
    assert len(a) == len(b)
    for i in range(len(a)):
        if b[i] > a[i]: return 0

    return 1

def solve():
    n, m, q = map(int, input().split(" "))
    t = [0] * n
    cur = 1
    gaps = []
    for _ in range(m):
        a, b = map(int, input().split(" "))
        a -= 1
        b -= 1
        for i in range(a, b+1):
            
            if t[i] != 0: gaps.append(cur - t[i] - 1)
            t[i] = cur
            cur += 1

    cnt = dict()
    for x in gaps: cnt[x] = cnt.get(x, 0) + 1

    higher = [0] * (cur+1)
    higher[0] = len(gaps)
    for i in range(1, cur+1):
        higher[i] = higher[i-1] - cnt.get(i-1, 0)
    s = list(map(int, input().split(" ")))
    for x in s:
        print(higher[min(x, cur)], end = " ")




solve()
 

Compilation message (stdout)

Compiling 'Main.py'...

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

=======

• Subtask 1: 11 / 11
• Subtask 2: 18 / 18
• Subtask 3: 0 / 22
• Subtask 4: 0 / 26
• Subtask 5: 0 / 23