oj.uz

Submission #1073120

# Submission time Handle Problem Language Result Execution time Memory
1073120 2024-08-24T09:42:17 Z TheQuantiX Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 132 ms 24196 KB 
#include <bits/stdc++.h>
#include "supertrees.h"

using namespace std;
using ll = long long;

ll n, m, q, k, x, y, a, b, c;

struct dsu {
    ll n;
    vector<ll> par;
    vector<ll> sz;

    dsu(ll N) : n(N) {
        par.resize(n);
        sz.resize(n);
        for (int i = 0; i < n; i++) {
            par[i] = i;
            sz[i] = 1;
        }
    }

    ll find_p(ll x) {
        if (par[x] == x) {
            return x;
        }
        ll p = find_p(par[x]);
        par[x] = p;
        return p;
    }

    void join(ll x, ll y) {
        x = find_p(x);
        y = find_p(y);
        if (x == y) {
            return;
        }
        if (sz[y] > sz[x]) {
            swap(x, y);
        }
        par[y] = x;
        sz[x] += sz[y];
    }
};

int construct(vector< vector<int> > p) {
    n = p.size();
    vector< vector<int> > ans(n, vector<int>(n));
    vector< vector<ll> > comp(n);
    vector< vector<ll> > comp2(n);
    dsu d(n);
    bitset<1000> bt;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < i; j++) {
            if (p[i][j] == 1) {
                d.join(i, j);
                bt.set(i);
                bt.set(j);
            }
        }
    }
    for (int i = 0; i < n; i++) {
        if (!bt[i]) {
            continue;
        }
        comp[d.find_p(i)].push_back(i);
    }
    for (auto i : comp) {
        for (int j : i) {
            for (int k : i) {
                if (p[j][k] != 1) {
                    return 0;
                }
            }
        }
    }
    for (auto i : comp) {
        if (i.size() <= 1) {
            continue;
        }
        for (int j = 0; j < i.size() - 1; j++) {
            ans[i[(j + 1) % i.size()]][i[j]] = 1;
            ans[i[j]][i[(j + 1) % i.size()]] = 1;
        }
    }
    for (int i = 0; i < n; i++) {
        set<ll> st2;
        for (int j : comp[i]) {
            for (int k = 0; k < n; k++) {
                if (p[j][k] == 2) {
                    if (bt[k]) {
                        return 0;
                    }
                    st2.insert(k);
                }
            }
        }
        // cout << i << ' ' << st2.size() << '\n';
        for (int j : st2) {
            comp2[i].push_back(j);
            bt.set(j);
        }
    }
    for (auto i : comp2) {
        if (i.size() == 1) {
            return 0;
        }
        for (int j : i) {
            for (int k : i) {
                if (j != k && p[j][k] != 2) {
                    return 0;
                }
            }
        }
    }
    for (auto i = 0; i < n; i++) {
        for (int j : comp[i]) {
            for (int k : comp2[i]) {
                if (p[j][k] != 2) {
                    return 0;
                }
            }
        }
    }
    // cout << "DEBUG" << endl;
    for (auto i = 0; i < n; i++) {
        if (comp2[i].size() == 0) {
            continue;
        }
        comp2[i].push_back(i);
        for (int j = 0; j < comp2[i].size(); j++) {
            ans[comp2[i][(j + 1) % comp2[i].size()]][comp2[i][j]] = 1;
            ans[comp2[i][j]][comp2[i][(j + 1) % comp2[i].size()]] = 1;
        }
    }
    vector< vector<ll> > comp2i(n);
    dsu d2(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < i; j++) {
            if (bt[i] && !bt[j] && p[i][j] != 0) {
                return 0;
            }
            if (!bt[i] && bt[j] && p[i][j] != 0) {
                return 0;
            }
            if (!bt[i] && !bt[j] && p[i][j] == 2) {
                d2.join(i, j);
            }
        }
    }
    for (int i = 0; i < n; i++) {
        comp2i[d2.find_p(i)].push_back(i);
    }
    for (auto i : comp2i) {
        if (i.size() == 2) {
            return 0;
        }
        for (int j : i) {
            for (int k : i) {
                if (p[j][k] == 0) {
                    return 0;
                }
            }
        }
    }
    for (auto i : comp2i) {
        if (i.size() == 1) {
            continue;
        }
        for (int j = 0; j < i.size(); j++) {
            ans[i[(j + 1) % i.size()]][i[j]] = 1;
            ans[i[j]][i[(j + 1) % i.size()]] = 1;
        }
    }
    build(ans);
    return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:81:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         for (int j = 0; j < i.size() - 1; j++) {
      |                         ~~^~~~~~~~~~~~~~
supertrees.cpp:131:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |         for (int j = 0; j < comp2[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~~~
supertrees.cpp:170:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  170 |         for (int j = 0; j < i.size(); j++) {
      |                         ~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1188 KB Output is correct
7 Correct 116 ms 24068 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1188 KB Output is correct
7 Correct 116 ms 24068 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 436 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 109 ms 24144 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 932 KB Output is correct
17 Correct 68 ms 14084 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 6296 KB Output is correct
21 Correct 119 ms 24144 KB Output is correct
22 Correct 123 ms 24148 KB Output is correct
23 Correct 121 ms 24104 KB Output is correct
24 Correct 117 ms 24196 KB Output is correct
25 Correct 57 ms 14084 KB Output is correct
26 Correct 51 ms 14160 KB Output is correct
27 Correct 132 ms 24180 KB Output is correct
28 Correct 118 ms 24196 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 5 ms 1416 KB Output is correct
9 Correct 113 ms 23888 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 412 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 118 ms 24196 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 956 KB Output is correct
17 Correct 61 ms 14212 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 31 ms 6352 KB Output is correct
22 Correct 114 ms 24148 KB Output is correct
23 Correct 114 ms 24180 KB Output is correct
24 Correct 128 ms 24196 KB Output is correct
25 Correct 51 ms 14164 KB Output is correct
26 Correct 54 ms 14160 KB Output is correct
27 Correct 112 ms 24184 KB Output is correct
28 Correct 119 ms 24148 KB Output is correct
29 Correct 49 ms 14324 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 28 ms 6400 KB Output is correct
5 Correct 118 ms 24144 KB Output is correct
6 Correct 114 ms 24148 KB Output is correct
7 Correct 119 ms 24072 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 29 ms 6228 KB Output is correct
10 Correct 113 ms 24144 KB Output is correct
11 Correct 119 ms 24144 KB Output is correct
12 Correct 121 ms 24144 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Incorrect 13 ms 3848 KB Answer gives possible 0 while actual possible 1
17 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1188 KB Output is correct
7 Correct 116 ms 24068 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 436 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 109 ms 24144 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 932 KB Output is correct
17 Correct 68 ms 14084 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 6296 KB Output is correct
21 Correct 119 ms 24144 KB Output is correct
22 Correct 123 ms 24148 KB Output is correct
23 Correct 121 ms 24104 KB Output is correct
24 Correct 117 ms 24196 KB Output is correct
25 Correct 57 ms 14084 KB Output is correct
26 Correct 51 ms 14160 KB Output is correct
27 Correct 132 ms 24180 KB Output is correct
28 Correct 118 ms 24196 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 5 ms 1416 KB Output is correct
37 Correct 113 ms 23888 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 412 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 118 ms 24196 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 956 KB Output is correct
45 Correct 61 ms 14212 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 31 ms 6352 KB Output is correct
50 Correct 114 ms 24148 KB Output is correct
51 Correct 114 ms 24180 KB Output is correct
52 Correct 128 ms 24196 KB Output is correct
53 Correct 51 ms 14164 KB Output is correct
54 Correct 54 ms 14160 KB Output is correct
55 Correct 112 ms 24184 KB Output is correct
56 Correct 119 ms 24148 KB Output is correct
57 Correct 49 ms 14324 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 900 KB Output is correct
61 Correct 57 ms 14212 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Incorrect 13 ms 3708 KB Answer gives possible 0 while actual possible 1
66 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 5 ms 1188 KB Output is correct
7 Correct 116 ms 24068 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 436 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1372 KB Output is correct
13 Correct 109 ms 24144 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 932 KB Output is correct
17 Correct 68 ms 14084 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 28 ms 6296 KB Output is correct
21 Correct 119 ms 24144 KB Output is correct
22 Correct 123 ms 24148 KB Output is correct
23 Correct 121 ms 24104 KB Output is correct
24 Correct 117 ms 24196 KB Output is correct
25 Correct 57 ms 14084 KB Output is correct
26 Correct 51 ms 14160 KB Output is correct
27 Correct 132 ms 24180 KB Output is correct
28 Correct 118 ms 24196 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 5 ms 1416 KB Output is correct
37 Correct 113 ms 23888 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 412 KB Output is correct
40 Correct 5 ms 1372 KB Output is correct
41 Correct 118 ms 24196 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 956 KB Output is correct
45 Correct 61 ms 14212 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 31 ms 6352 KB Output is correct
50 Correct 114 ms 24148 KB Output is correct
51 Correct 114 ms 24180 KB Output is correct
52 Correct 128 ms 24196 KB Output is correct
53 Correct 51 ms 14164 KB Output is correct
54 Correct 54 ms 14160 KB Output is correct
55 Correct 112 ms 24184 KB Output is correct
56 Correct 119 ms 24148 KB Output is correct
57 Correct 49 ms 14324 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 28 ms 6400 KB Output is correct
62 Correct 118 ms 24144 KB Output is correct
63 Correct 114 ms 24148 KB Output is correct
64 Correct 119 ms 24072 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 29 ms 6228 KB Output is correct
67 Correct 113 ms 24144 KB Output is correct
68 Correct 119 ms 24144 KB Output is correct
69 Correct 121 ms 24144 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Incorrect 13 ms 3848 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -