結果

問題 No.274 The Wall
ユーザー prin_kemkemprin_kemkem
提出日時 2023-05-11 21:26:53
言語 PyPy3
(7.3.15)
結果
MLE  
実行時間 -
コード長 3,128 bytes
コンパイル時間 1,230 ms
コンパイル使用メモリ 86,796 KB
実行使用メモリ 610,548 KB
最終ジャッジ日時 2023-08-18 12:31:31
合計ジャッジ時間 7,278 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 189 ms
78,536 KB
testcase_01 AC 149 ms
78,544 KB
testcase_02 AC 150 ms
78,180 KB
testcase_03 AC 1,014 ms
330,868 KB
testcase_04 AC 190 ms
78,572 KB
testcase_05 AC 148 ms
78,460 KB
testcase_06 AC 147 ms
78,476 KB
testcase_07 AC 149 ms
78,596 KB
testcase_08 AC 148 ms
78,504 KB
testcase_09 AC 151 ms
78,160 KB
testcase_10 AC 152 ms
78,368 KB
testcase_11 MLE -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
testcase_22 -- -
testcase_23 -- -
testcase_24 -- -
testcase_25 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

from collections import defaultdict, deque, Counter
import copy
from itertools import combinations, permutations, product, accumulate, groupby
from heapq import heapify, heappop, heappush
import math
import bisect
from pprint import pprint
import sys
# sys.setrecursionlimit(700000)
input = lambda: sys.stdin.readline().rstrip('\n')
inf = float('inf')
mod1 = 10**9+7
mod2 = 998244353
def ceil_div(x, y): return -(-x//y)

#################################################

def sccd(adj):
    n = len(adj)
    been = [False]*n
    P = []
    for s in range(n):
        if been[s]: continue
        stack = [s]
        while stack:
            now = stack.pop()
            if now >= 0:
                if been[now]: continue
                been[now] = True
                stack.append(~now)
                for nxt in adj[now]:
                    if been[nxt]: continue
                    stack.append(nxt)
            else:
                P.append(~now)
    radj = [[] for _ in range(n)]
    for i, neighbor in enumerate(adj):
        for j in neighbor:
            radj[j].append(i)
    scc_prev = []
    scc_idx = [None]*n
    for s in reversed(P):
        if not been[s]: continue
        been[s] = False
        stack = [s]
        scc = []
        while stack:
            now = stack.pop()
            scc_idx[now] = (len(scc_prev), len(scc))
            scc.append(now)
            for nxt in radj[now]:
                if not been[nxt]: continue
                been[nxt] = False
                stack.append(nxt)
        scc_prev.append(scc)
    return scc_idx

class Two_SAT:
    def __init__(self, n) -> None:
        self.n = n
        self.adj = [[] for _ in range(2*n)]
    def add(self, x, y): # 否定したいときは~xを入れる
        if x >= 0 and y >= 0:
            self.adj[self.n+x].append(y)
            self.adj[self.n+y].append(x)
        elif x >= 0:
            y = ~y
            self.adj[self.n+x].append(self.n+y)
            self.adj[y].append(x)
        elif y >= 0:
            x = ~x
            self.adj[x].append(y)
            self.adj[self.n+y].append(self.n+x)
        else:
            x = ~x; y = ~y
            self.adj[x].append(self.n+y)
            self.adj[y].append(self.n+x)
    def solve(self):
        scc_idx = sccd(self.adj)
        ret = [False]*self.n
        for x in range(self.n):
            i, j = scc_idx[x][0], scc_idx[self.n+x][0]
            if i == j:
                return None
            ret[x] = i > j
        return ret

def is_intersect(li, ri, lj, rj):
    if li > lj: li, ri, lj, rj = ri, rj, li, lj
    return lj <= ri

N, M = map(int, input().split())
blocks = [tuple(map(int, input().split())) for _ in range(N)]
sat = Two_SAT(N)
for i in range(N):
    li, ri = blocks[i]
    for j in range(i+1, N):
        lj, rj = blocks[j]
        if is_intersect(li, ri, lj, rj): sat.add(~i, ~j)
        if is_intersect(li, ri, M-1-rj, M-1-lj): sat.add(~i, j)
        if is_intersect(M-1-ri, M-1-li, lj, rj): sat.add(i, ~j)
        if is_intersect(M-1-ri, M-1-li, M-1-rj, M-1-lj): sat.add(i, j)
del blocks
ans = sat.solve()
print("YNEOS"[ans is None::2])
0