Submission #65884657

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
h,w,n=map(int,input().split())
from sortedcontainers import SortedSet
X=[SortedSet() for _ in range(w)]
Y=[SortedSet() for _ in range(h)]
for _ in range(n):
    x,y=map(int,input().split())
    x-=1
    y-=1
    X[y].add(x)
    Y[x].add(y)
for _ in range(int(input())):
    q,xy=map(int,input().split())
    q-=1
    xy-=1
    if q:
        print(len(X[xy]))
        for yy in X[xy]:
            Y[yy].discard(xy)
        X[xy]=SortedSet()
    else:
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

h,w,n=map(int,input().split())
from sortedcontainers import SortedSet
X=[SortedSet() for _ in range(w)]
Y=[SortedSet() for _ in range(h)]

for _ in range(n):
    x,y=map(int,input().split())
    x-=1
    y-=1
    X[y].add(x)
    Y[x].add(y)
for _ in range(int(input())):
    q,xy=map(int,input().split())
    q-=1
    xy-=1
    if q:
        print(len(X[xy]))
        for yy in X[xy]:
            Y[yy].discard(xy)
        X[xy]=SortedSet()
    else:
        print(len(Y[xy]))
        for yy in Y[xy]:
            X[yy].discard(xy)
        Y[xy]=SortedSet()

Submission Info

Judge Result