QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#234116	#3846. Link-Cut Tree	tselmegkh^#	AC ✓	175ms	12648kb	C++17	2.1kb	2023-11-01 14:10:04	2023-11-01 14:10:05

Judging History

你现在查看的是最新测评结果

[2023-11-01 14:10:05]
评测

测评结果：AC
用时：175ms
内存：12648kb

查看

[2023-11-01 14:10:04]
提交

answer

#include <bits/stdc++.h>
using namespace std;
using ll = long long ;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
        int n, m;
        cin >> n >> m;
        vector<int> u(m), v(m);
        for (int i = 0; i < m; i++) {
            cin >> u[i] >> v[i];
            u[i]--, v[i]--;
        }
        vector<int> par(n), sz(n, 1);
        iota(par.begin(), par.end(), 0);
        function<int(int)> find = [&](int i) {
            return i == par[i] ? i : par[i] = find(par[i]);
        };
        auto unite = [&](int x, int y) {
            x = find(x);
            y = find(y);
            if (x == y) return;
            if (sz[x] > sz[y]) swap(x, y);
            sz[y] += sz[x];
            par[x] = y;
        };
        vector<vector<pair<int, int>>> adj(n);
        bool f = 0;
        for (int i = 0; i < m; i++) {
            if (find(u[i]) != find(v[i])) {
                adj[u[i]].emplace_back(v[i], i);
                adj[v[i]].emplace_back(u[i], i);
                unite(u[i], v[i]);
                continue;
            }
            vector<int> a(n, -1);
            a[u[i]] = u[i];
            queue<int> q;
            q.push(u[i]);
            while (!q.empty()) {
                int x = q.front();
                q.pop();
                for (auto [y, z] : adj[x]) {
                    if (a[y] == -1) {
                        a[y] = z;
                        q.push(y);
                    }
                }
            }
            vector<int> ans{i};
            int x = v[i];
            while (x != u[i]) {
                int i = a[x];
                x ^= u[i] ^ v[i];
                ans.push_back(i);
            }
            sort(ans.begin(), ans.end());
            for (int i = 0; i < ans.size(); i++) {
                cout << ans[i] + 1;
                if (i + 1 < ans.size()) {
                    cout << " ";
                }
            }
            cout << "\n";
            f = 1;
            break;
        }
        if (!f) cout << -1 << "\n";
    }
}

源文件, 语言: C++17

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3544kb

input:

output:

2 4 5 6
-1

result:

ok 2 lines

Test #2:

score: 0

Accepted

time: 157ms

memory: 11152kb

input:

output:

2 5 8
3 5 7
1 3 4
2 3 4
2 3 4 7 13
1 3 4 5 9
3 4 7 12
1 2 3
8 10 11
2 3 5 7 12 13 14 15 16
1 2 3 5
1 2 4
1 3 4
1 2 3
1 2 3
10 11 15
1 5 6
1 5 7
1 2 3 4
-1
1 3 6
-1
1 2 3 5
-1
-1
6 8 9 10 11 16
1 2 6
2 3 4
-1
-1
7 8 12 13 18
-1
1 4 8 12
3 5 10
4 6 8
1 2 3 4
3 5 6
5 8 10 15
4 6 8
-1
1 2 3 5 6
1 3 4
1 ...

result:

ok 1658 lines

Test #3:

score: 0

Accepted

time: 175ms

memory: 12648kb

input:

10
100000 100000
1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
10 11
11 12
12 13
13 14
14 15
15 16
16 17
17 18
18 19
19 20
20 21
21 22
22 23
23 24
24 25
25 26
26 27
27 28
28 29
29 30
30 31
31 32
32 33
33 34
34 35
35 36
36 37
37 38
38 39
39 40
40 41
41 42
42 43
43 44
44 45
45 46
46 47
47 48
48 49
49 50
50 51
...

output:

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 ...

result:

ok 10 lines