結果

問題 No.3207 Digital Font
コンテスト
ユーザー lif4635
提出日時 2025-07-18 23:03:58
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 5,639 bytes
コンパイル時間 370 ms
コンパイル使用メモリ 82,728 KB
実行使用メモリ 196,396 KB
最終ジャッジ日時 2025-07-18 23:04:58
合計ジャッジ時間 41,663 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 23 WA * 15
権限があれば一括ダウンロードができます

ソースコード

diff # 

# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b = map(int, input().split())
        a += index
        b += index
        edge[a].add(b)
        if not dir:
            edge[b].add(a)
    return edge

def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b,c = map(int, input().split())
        a += index
        b += index
        edge[a].add((b,c))
        if not dir:
            edge[b].add((a,c))
    return edge

inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")
def acc(a:list[int]):
    sa = [0]*(len(a)+1)
    for i in range(len(a)):
        sa[i+1] = a[i] + sa[i]
    return sa

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right

mod = (1 << 61) - 1

class BIT:
    __slots__ = ["n", "data"]
    
    def __init__(self, n):
        self.n = n
        self.data = [0]*(n+1)
    
    def build(self, arr):
        for i,a in enumerate(arr):
            self.data[i+1] = a
        for i in range(1, self.n+1):
            if i + (i&-i) <= self.n:
                self.data[i + (i&-i)] += self.data[i] % mod
    
    def add(self, p, x):
        p += 1
        while p <= self.n:
            self.data[p] += x % mod
            p += p& -p
    
    def sum0(self, r):
        s = 0
        while r:
            s += self.data[r] % mod
            r -= r& -r
        return s % mod
    
    def sum(self, l, r):
        s = 0
        while r:
            s += self.data[r] % mod
            r -= r& -r
        while l:
            s -= self.data[l] % mod
            l -= l& -l
        return s % mod
    
    def get(self, p):
        return self.sum0(p+1) - self.sum0(p)

    def bisect_left(self, w):
        """
        not velify
        sum_{0 <= i < x} >= w となる 最小のx
        """
        if w <= 0: return 0
        x = 0
        r = 1 << self.n.bit_length()
        while r:
            if x + r <= self.n and self.data[x + r] < w:
                w -= self.data[x + r]
                x += r
            r >>= 1
        return x + 1
    
    def bisect_right(self, w):
        """
        sum_{0 <= i < x} <= w となる 最大のx
        """
        assert w >= 0
        x = 0
        r = 1 << self.n.bit_length()
        while r:
            if x + r <= self.n and self.data[x + r] <= w:
                w -= self.data[x + r]
                x += r
            r >>= 1
        return x

    def __str__(self):
        return str([self.get(i) for i in range(self.n)])

h, w = MI()

n = II()

from random import randint

b1 = 37 # 横
b2 = 61 # 縦

num = [randint(1, 36) for i in range(10)]

ib1 = pow(b1, -1, mod)
ib2 = pow(b2, -1, mod) 

hb = [1] * (h + 10)
ihb = [1] * (h + 10)
for i in range(h + 9):
    hb[i+1] = hb[i] * b1 % mod
    ihb[i+1] = ihb[i] * ib1 % mod

wb = [1] * (w + 10)
iwb = [1] * (w + 10)
for i in range(w + 9):
    wb[i+1] = wb[i] * b2 % mod
    iwb[i+1] = iwb[i] * ib2 % mod
    
# hash
# 区間のhashをつくってそれが一致するかどうか？
# 矩形hash？

a = [[] for i in range(h + 1)]
b = [[] for i in range(h + 1)]
for i in range(n):
    i, j, x = MI()
    i -= 1
    j -= 1
    a[i].append((j, x))
    if x == 6 or x == 9:
        b[h-1-i].append((w-1-j, 15-x))
    else:
        b[h-1-i].append((w-1-j, x))

q = II()
qa = [[] for i in range(h + 1)]
qb = [[] for i in range(h + 1)]
oa = [1] * q
ob = [1] * q
for i in range(q):
    l, d, r, u = MI()
    l -= 1
    d -= 1
    qa[l].append((i, -1, d, u))
    qa[r].append((i, 1, d, u))
    qb[h-r].append((i, -1, w-u, w-d))
    qb[h-l].append((i, 1, w-u, w-d))
    oa[i] = ihb[l] * iwb[d] % mod
    ob[i] = ihb[h-r] * iwb[w-u] % mod


def calc(a, qa, oa):
    bit = BIT(w + 1)
    ans = [0] * q
    for i in range(h + 1):
        for idx, f, d, u in qa[i]:
            p = bit.sum(d, u) # offsetがかかっている
            ans[idx] += f * p
        
        for j, x in a[i]: # この行に追加
            bit.add(j, num[x] * hb[i+1] % mod * wb[j+1] % mod)
        # print(bit)
    for i in range(q):
        ans[i] *= oa[i]
        ans[i] %= mod
    return ans


a1 = calc(a, qa, oa)
a2 = calc(b, qb, ob)

for i in range(q):
    yn(a1[i] % mod == a2[i] % mod)
0