結果

問題 No.274 The Wall
ユーザー vwxyzvwxyz
提出日時 2023-05-17 10:14:06
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 98 ms / 2,000 ms
コード長 2,869 bytes
コンパイル時間 159 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 76,672 KB
最終ジャッジ日時 2024-05-08 21:52:19
合計ジャッジ時間 2,616 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
52,736 KB
testcase_01 AC 45 ms
58,112 KB
testcase_02 AC 47 ms
59,136 KB
testcase_03 AC 52 ms
62,336 KB
testcase_04 AC 38 ms
52,736 KB
testcase_05 AC 38 ms
52,736 KB
testcase_06 AC 39 ms
52,480 KB
testcase_07 AC 38 ms
52,224 KB
testcase_08 AC 40 ms
52,736 KB
testcase_09 AC 40 ms
52,736 KB
testcase_10 AC 53 ms
60,672 KB
testcase_11 AC 56 ms
64,000 KB
testcase_12 AC 72 ms
72,576 KB
testcase_13 AC 50 ms
61,056 KB
testcase_14 AC 68 ms
68,352 KB
testcase_15 AC 88 ms
76,672 KB
testcase_16 AC 60 ms
65,664 KB
testcase_17 AC 60 ms
65,536 KB
testcase_18 AC 59 ms
65,536 KB
testcase_19 AC 94 ms
76,544 KB
testcase_20 AC 90 ms
76,160 KB
testcase_21 AC 93 ms
76,672 KB
testcase_22 AC 60 ms
66,048 KB
testcase_23 AC 94 ms
76,288 KB
testcase_24 AC 98 ms
76,544 KB
testcase_25 AC 95 ms
76,288 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
readline=sys.stdin.readline

def SCC(N,edges):
    start = [0] * (N + 1)
    elist = [0] * len(edges)
    for e in edges:
        start[e[0] + 1] += 1
    for i in range(1, N + 1):
        start[i] += start[i - 1]
    counter = start[:]
    for e in edges:
        elist[counter[e[0]]] = e[1]
        counter[e[0]] += 1
    N = N
    now_ord = group_num = 0
    visited = []
    low = [0] * N
    order = [-1] * N
    ids = [0] * N
    parent = [-1] * N
    stack = []
    for i in range(N):
        if order[i] == -1:
            stack.append(i)
            stack.append(i)
            while stack:
                v = stack.pop()
                if order[v] == -1:
                    low[v] = order[v] = now_ord
                    now_ord += 1
                    visited.append(v)
                    for i in range(start[v], start[v + 1]):
                        to = elist[i]
                        if order[to] == -1:
                            stack.append(to)
                            stack.append(to)
                            parent[to] = v
                        else:
                            low[v] = min(low[v], order[to])
                else:
                    if low[v] == order[v]:
                        while True:
                            u = visited.pop()
                            order[u] = N
                            ids[u] = group_num
                            if u == v:
                                break
                        group_num += 1
                    if parent[v] != -1:
                        low[parent[v]] = min(low[parent[v]], low[v])
    for i, x in enumerate(ids):
        ids[i] = group_num - 1 - x
    groups = [[] for _ in range(group_num)]
    for i, x in enumerate(ids):
        groups[x].append(i)
    return groups

class TwoSAT:
    def __init__(self,N):
        self.N=N
        self.edges=[]

    def Add_Clause(self,i,f,j,g):
        assert 0<=i<self.N
        assert 0<=j<self.N
        self.edges.append((2*i+(0 if f else 1),2*j+(1 if g else 0)))
        self.edges.append((2*j+(0 if g else 1),2*i+(1 if f else 0)))

    def Satisfiable(self):
        scc=SCC(2*self.N,self.edges)
        idx=[None]*2*self.N
        for i,lst in enumerate(scc):
            for x in lst:
                idx[x]=i
        retu=[None]*self.N
        for i in range(self.N):
            if idx[2*i]==idx[2*i+1]:
                return None
            retu[i]=idx[2*i]<idx[2*i+1]
        return retu

N,M=map(int,readline().split())
LR=[]
for n in range(N):
    l,r=map(int,readline().split())
    r+=1
    l,r=min((l,r),(M-r,M-l))
    LR.append((l,r))
used=[False]*M
for l,r in sorted(LR):
    if any(used[i] for i in range(l,r)):
        l,r=M-r,M-l
    if any(used[i] for i in range(l,r)):
        print("NO")
        exit()
    for i in range(l,r):
        used[i]=True
print("YES")
0