#1052854 (C++23) No.3056 Disconnected Coloring

• 問題: No.3056 Disconnected Coloring
• ユーザー: kwm_t
• 提出日時: 2025-03-14 22:13:56
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 2,171 bytes
• コンパイル時間: 3,694 ms
• コンパイル使用メモリ: 288,944 KB
• 実行使用メモリ: 27,576 KB
• 最終ジャッジ日時: 2025-03-14 22:14:17
• 合計ジャッジ時間: 17,202 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	AC * 1 WA * 1
other	AC * 10 WA * 24

ソースコード

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
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<int> bfs(int m, int str, int end, vector<vector<P>>&to) {
    vector<int>col(m, -1);
    set<int>st = { str };
    queue<int>q;
    q.push(str);
    while (!q.empty()) {
        auto v = q.front();
        q.pop();
        for (auto[nv, idx] : to[v]) {
            if (nv == end)continue;
            if (col[idx] == -1) col[idx] = 0;
            if (st.count(nv))continue;
            st.insert(nv);
            q.push(nv);
        }
    }
    return col;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m; cin >> n >> m;
    vector to(n, vector<P>());
    rep(i, m) {
        int u, v; cin >> u >> v;
        u--, v--;
        to[u].push_back({ v,i });
        to[v].push_back({ u,i });
    }
    if (m % 2 == 1) {
        cout << -1 << endl;
        return 0;
    }
    vector<int>col0 = bfs(m, 0, n - 1, to);
    vector<int>col1 = bfs(m, n - 1, 0, to);
    rep(i, m) {
        if (col0[i] == -1 && col1[i] == -1) {
            cout << -1 << endl;
            return 0;
        }
    }
    int c0 = 0, c1 = 0;
    vector<int>col(m, -1);
    rep(i, m) {
        if (col0[i] == -1) {
            col[i] = 1;
            c1++;
        }
        else if (col1[i] == -1) {
            col[i] = 0;
            c0++;
        }
    }
    if (c0 > m / 2 || c1 > m / 2) {
        cout << -1 << endl;
        return 0;
    }
    rep(i, m) {
        if (col[i] == -1) {
            if (c0 < m / 2) {
                col[i] = 0;
                c0++;
            }
            else {
                col[i] = 1;
                c1++;
            }
        }
    }
    cout << -1 << endl;
    return 0;
    string ans;
    rep(i, m) {
        if (col[i])ans += 'R';
        else ans += 'B';
    }
    cout << ans << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX