#928390 (Python3) No.2536 同値性と充足可能性

• 問題: No.2536 同値性と充足可能性
• ユーザー: titia
• 提出日時: 2023-11-12 00:13:52
• 言語: Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1)
• 結果: AC
• 実行時間: 929 ms / 2,000 ms
• コード長: 2,203 bytes
• コンパイル時間: 130 ms
• コンパイル使用メモリ: 12,928 KB
• 実行使用メモリ: 56,356 KB
• 最終ジャッジ日時: 2024-09-26 02:57:04
• 合計ジャッジ時間: 8,185 ms
• ジャッジサーバーID （参考情報）: judge4 / 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
123
124
import sys
input = sys.stdin.readline
N,M=map(int,input().split())
E=[[] for i in range(N+1)]
E2=[[] for i in range(N+1)]
for i in range(M):
    S=input().split()
    x=int(S[0])
    y=int(S[-1])
    if len(S[1])==4:
        E[x].append(y)
        E[y].append(x)
    else:
        E2[x].append(y)
        E2[y].append(x)
# UnionFind
Group = [i for i in range(N+1)] # グループ分け
Nodes = [1]*(N+1) # 各グループのノードの数
def find(x):
    while Group[x] != x:
        x=Group[x]
    return x
def Union(x,y):
    if find(x) != find(y):
        if Nodes[find(x)] < Nodes[find(y)]:
            
            Nodes[find(y)] += Nodes[find(x)]
            Nodes[find(x)] = 0
            Group[find(x)] = find(y)
            
        else:
            Nodes[find(x)] += Nodes[find(y)]
            Nodes[find(y)] = 0
            Group[find(y)] = find(x)
for i in range(N+1):
    for to in E[i]:
        Union(i,to)
E3=[[] for i in range(N+1)]
for i in range(N+1):
    for to in E2[i]:
        if find(i)==find(to):
            print("No")
            exit()
        else:
            E3[find(i)].append(find(to))
            E3[find(to)].append(find(i))
ANS=[]
USE=[-1]*(N+1)
for i in range(N+1):
    if find(i)!=i:
        continue
    if USE[i]!=-1:
        continue
    Q=[i]
    USE[i]=0
    zero=Nodes[i]
    one=0
    Z=[i]
    O=[]
    while Q:
        #print(Q)
        x=Q.pop()
        for to in E3[x]:
            if USE[to]==-1:
                USE[to]=USE[x]^1
                if USE[to]==0:
                    zero+=Nodes[to]
                    Z.append(to)
                else:
                    one+=Nodes[to]
                    O.append(to)
                Q.append(to)
            else:
                if USE[to]==USE[x]^1:
                    pass
                else:
                    print("No")
                    exit()
    #print(Z,O)
    if zero>=one:
        for z in Z:
            ANS.append(z)
    else:
        for o in O:
            ANS.append(o)
SET=set(ANS)
LANS=[]
for i in range(1,N+1):
    if find(i) in SET:
        LANS.append(i)
print("Yes")
print(len(LANS))
print(*LANS)
                
    
    
        
        
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX