oj.uz

Submission #1073122

# Submission time Handle Problem Language Result Execution time Memory
1073122 2024-08-24T09:44:15 Z TheQuantiX Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 176 ms 22336 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 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 1 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 125 ms 22296 KB Output is correct

Subtask #2
10.0 / 10.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 1 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 125 ms 22296 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 114 ms 22208 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 59 ms 12112 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 5908 KB Output is correct
21 Correct 120 ms 22100 KB Output is correct
22 Correct 118 ms 22100 KB Output is correct
23 Correct 125 ms 22292 KB Output is correct
24 Correct 120 ms 22280 KB Output is correct
25 Correct 53 ms 12308 KB Output is correct
26 Correct 56 ms 12116 KB Output is correct
27 Correct 135 ms 22288 KB Output is correct
28 Correct 122 ms 22100 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 1116 KB Output is correct
9 Correct 128 ms 22220 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1108 KB Output is correct
13 Correct 121 ms 22148 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 63 ms 12368 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 5980 KB Output is correct
22 Correct 116 ms 22288 KB Output is correct
23 Correct 117 ms 22100 KB Output is correct
24 Correct 125 ms 22100 KB Output is correct
25 Correct 56 ms 12368 KB Output is correct
26 Correct 53 ms 12372 KB Output is correct
27 Correct 124 ms 22280 KB Output is correct
28 Correct 176 ms 22280 KB Output is correct
29 Correct 60 ms 12372 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 30 ms 5872 KB Output is correct
5 Correct 129 ms 22336 KB Output is correct
6 Correct 127 ms 22096 KB Output is correct
7 Correct 130 ms 22296 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 31 ms 5780 KB Output is correct
10 Correct 127 ms 22100 KB Output is correct
11 Correct 121 ms 22172 KB Output is correct
12 Correct 143 ms 22292 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Incorrect 17 ms 3236 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 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 1 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 125 ms 22296 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 114 ms 22208 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 59 ms 12112 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 5908 KB Output is correct
21 Correct 120 ms 22100 KB Output is correct
22 Correct 118 ms 22100 KB Output is correct
23 Correct 125 ms 22292 KB Output is correct
24 Correct 120 ms 22280 KB Output is correct
25 Correct 53 ms 12308 KB Output is correct
26 Correct 56 ms 12116 KB Output is correct
27 Correct 135 ms 22288 KB Output is correct
28 Correct 122 ms 22100 KB Output is correct
29 Correct 0 ms 344 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 1116 KB Output is correct
37 Correct 128 ms 22220 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 1108 KB Output is correct
41 Correct 121 ms 22148 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 63 ms 12368 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 5980 KB Output is correct
50 Correct 116 ms 22288 KB Output is correct
51 Correct 117 ms 22100 KB Output is correct
52 Correct 125 ms 22100 KB Output is correct
53 Correct 56 ms 12368 KB Output is correct
54 Correct 53 ms 12372 KB Output is correct
55 Correct 124 ms 22280 KB Output is correct
56 Correct 176 ms 22280 KB Output is correct
57 Correct 60 ms 12372 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 860 KB Output is correct
61 Correct 65 ms 12304 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Incorrect 29 ms 3220 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 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 1 ms 348 KB Output is correct
6 Correct 5 ms 1116 KB Output is correct
7 Correct 125 ms 22296 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 114 ms 22208 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 59 ms 12112 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 5908 KB Output is correct
21 Correct 120 ms 22100 KB Output is correct
22 Correct 118 ms 22100 KB Output is correct
23 Correct 125 ms 22292 KB Output is correct
24 Correct 120 ms 22280 KB Output is correct
25 Correct 53 ms 12308 KB Output is correct
26 Correct 56 ms 12116 KB Output is correct
27 Correct 135 ms 22288 KB Output is correct
28 Correct 122 ms 22100 KB Output is correct
29 Correct 0 ms 344 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 1116 KB Output is correct
37 Correct 128 ms 22220 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 1108 KB Output is correct
41 Correct 121 ms 22148 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 63 ms 12368 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 5980 KB Output is correct
50 Correct 116 ms 22288 KB Output is correct
51 Correct 117 ms 22100 KB Output is correct
52 Correct 125 ms 22100 KB Output is correct
53 Correct 56 ms 12368 KB Output is correct
54 Correct 53 ms 12372 KB Output is correct
55 Correct 124 ms 22280 KB Output is correct
56 Correct 176 ms 22280 KB Output is correct
57 Correct 60 ms 12372 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 30 ms 5872 KB Output is correct
62 Correct 129 ms 22336 KB Output is correct
63 Correct 127 ms 22096 KB Output is correct
64 Correct 130 ms 22296 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 31 ms 5780 KB Output is correct
67 Correct 127 ms 22100 KB Output is correct
68 Correct 121 ms 22172 KB Output is correct
69 Correct 143 ms 22292 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Incorrect 17 ms 3236 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -