#927862 (PyPy3) No.2536 同値性と充足可能性

• 問題: No.2536 同値性と充足可能性
• ユーザー: yupooh
• 提出日時: 2023-11-10 22:32:34
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 613 ms / 2,000 ms
• コード長: 2,536 bytes
• コンパイル時間: 325 ms
• コンパイル使用メモリ: 82,852 KB
• 実行使用メモリ: 134,528 KB
• 最終ジャッジ日時: 2024-09-26 01:54:47
• 合計ジャッジ時間: 6,776 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

ファイルパターン	結果
other	AC * 31

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
import sys
input = sys.stdin.readline
n,m=map(int,input().split())
adj=[set() for _ in range(n)]
adj2=[set() for _ in range(n)]
from collections import defaultdict,deque
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
    def size(self, x):
        return -self.parents[self.find(x)]
    def same(self, x, y):
        return self.find(x) == self.find(y)
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
    def group_count(self):
        return len(self.roots())
    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members
    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
uf=UnionFind(n)
for _ in range(m):
  l=list(map(str,input().split()))
  a=int(l[0])-1
  b=int(l[2])-1
  if l[1]=="<==>":
    adj[a].add(b)
    adj[b].add(a)
  else:
    adj2[a].add(b)
    adj2[b].add(a)
  uf.union(a,b)
for i in range(n):
  for j in adj[i]:
    if j in adj2[i]:
      print("No")
      exit()
dist = [-1]*n
for i in range(n):
  if dist[i]!=-1:
    continue
  que = deque([i])
  dist[i] = 0
  while que:
    v = que.popleft()
    e = dist[v]
    for w in adj[v]:
      if dist[w] > -1:
        if dist[w]==1-e:
          print("No")
          exit()
      else:
        dist[w] = e
        que.append(w)
    for w in adj2[v]:
      if dist[w] > -1:
        if dist[w]==e:
          print("No")
          exit()
      else:
        dist[w] = 1-e
        que.append(w)  
ans=[]
for l in list(uf.all_group_members().values()):
  zero=[]
  one=[]
  for i in l:
    if dist[i]==0:
      zero.append(i+1)
    else:
      one.append(i+1)
  if len(zero)>=len(one):
    ans+=zero
  else:
    ans+=one
if len(ans)>=(n+1)//2:
  print("Yes")
  print(len(ans))
  ans.sort()
  print(*ans)
else:
  print("No")
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX