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

• 問題: No.2536 同値性と充足可能性
• ユーザー: nikoro256
• 提出日時: 2023-11-10 22:31:58
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 443 ms / 2,000 ms
• コード長: 2,814 bytes
• コンパイル時間: 346 ms
• コンパイル使用メモリ: 82,164 KB
• 実行使用メモリ: 116,992 KB
• 最終ジャッジ日時: 2024-09-26 01:54:34
• 合計ジャッジ時間: 6,104 ms
• ジャッジサーバーID （参考情報）: judge5 / 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
120
121
122
from collections import defaultdict
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 members_count(self):
        dic=defaultdict(int)
        for i in range(self.n):
            dic[self.find(i)]+=1
        return dic
    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())
N,M=map(int,input().split())
uf=UnionFind(N)
no_flag=False
edge=[[] for _ in range(N)]
for _ in range(M):
    i,E,j=map(str,input().split())
    i=int(i)
    j=int(j)
    i-=1
    j-=1
    if E=='<==>':
        uf.union(i,j)
    else:
        edge[i].append(j)
        edge[j].append(i)
edge2=[[] for _ in range(N)]
for i in range(N):
    f1=uf.find(i)
    for e in edge[i]:
        f2=uf.find(e)
        if f1==f2:
            print('No')
            exit(0)
        else:
           edge2[f1].append(f2)
           edge2[f2].append(f1)
edge=edge2
from collections import deque
def bfs(s):
    dq=deque()
    dq.append([s,0])
    global dist
    while len(dq)!=0:
        p,h=dq.popleft()
        for e in edge[p]:
            if  dist[e]==-1:
                dq.append([e,h+1])
                dist[e]=1-dist[p]
                for d in dic[e]:
                    ans[1-dist[p]].append(d)
            elif dist[e]!=1-dist[p]:
                print('No')
                exit(0)
    return
roots=uf.roots()
dist=[-1 for _ in range(N)]
dic=uf.all_group_members()
ans=[[],[]]
for r in roots:
    if dist[r]==-1:
        dist[r]=1
        for d in dic[r]:
            ans[1].append(d)
        bfs(r)
print('Yes')
if len(ans[0])>len(ans[1]):
    print(len(ans[0]))
    print(*sorted([a+1 for a in ans[0]]))
else:
    print(len(ans[1]))
    print(*sorted([a+1 for a in ans[1]]))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX