#927975 (C++17) No.2536 同値性と充足可能性

• 問題: No.2536 同値性と充足可能性
• ユーザー: pmankirai
• 提出日時: 2023-11-10 23:01:13
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 380 ms / 2,000 ms
• コード長: 3,233 bytes
• コンパイル時間: 2,365 ms
• コンパイル使用メモリ: 209,884 KB
• 最終ジャッジ日時: 2025-02-17 21:21:35
• ジャッジサーバーID （参考情報）: judge2 / judge3

ファイルパターン	結果
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
125
126
127
128
129
130
131
132
133
134
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef long long int ll;
void speedUpIO() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
}
template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
/*--------------------------------------------------*/
typedef pair<int, int> P;
typedef pair<P, int> PP;
const int INF = 1e9;
const ll LINF = 1e18;
const int MX = 100010;
void solve() {
    int n, m;
    cin >> n >> m;
    VV<int> G(n);
    set<PP> st;
    rep(mi, m) {
        int i, j;
        string e;
        cin >> i >> e >> j;
        i--, j--;
        int ei = 0;
        if (e == "<==>") ei = 1;
        st.insert({{i, j}, ei});
        st.insert({{j, i}, ei});
        G[i].eb(j);
        G[j].eb(i);
    }
    V<int> col(n, -1);
    bool ans = true;
    auto dfs = [&](auto dfs, int u, V<int> &a) -> void {
        for (auto v : G[u]) {
            if (col[v] == -1) {
                if (st.count({{u, v}, 0})) {
                    col[v] = 1 - col[u];
                } else if (st.count({{u, v}, 1})) {
                    col[v] = col[u];
                } else {
                    assert(false);
                }
                a.eb(v);
                dfs(dfs, v, a);
            } else {
                if (st.count({{u, v}, 0})) {
                    if (col[u] == col[v]) {
                        ans = false;
                        return;
                    }
                }
                if (st.count({{u, v}, 1})) {
                    if (col[u] != col[v]) {
                        ans = false;
                        return;
                    }
                }
            }
        }
    };
    V<int> b;
    rep(i, n) {
        if (col[i] == -1) {
            col[i] = 0;
            V<int> a = {i};
            dfs(dfs, i, a);
            if (!ans) break;
            int cnt = 0;
            for (auto v : a) {
                if (col[v] == 1) cnt++;
            }
            for (auto v : a) {
                int c = cnt >= (n + 1) / 2 ? 1 : 0;
                if (col[v] == c) b.eb(v);
            }
        }
    }
    if (!ans) {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    cout << sz(b) << "\n";
    sort(all(b));
    for (auto v : b) {
        cout << v + 1;
        if (v != b.back()) cout << " ";
    }
    cout << "\n";
}
int main() {
    speedUpIO();
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        // cout << solve() << "\n";
        // cout << (solve() ? "YES" : "NO") << "\n";
        // cout << fixed << setprecision(15) << solve() << "\n";
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX