oj.uz

Submission #808509

# Submission time Handle Problem Language Result Execution time Memory
808509 2023-08-05T07:26:39 Z drdilyor Connecting Supertrees (IOI20_supertrees) C++17
96 / 100
 200 ms 24016 KB 
#include<bits/stdc++.h>
#include "supertrees.h"
using namespace std;
using ll = long long;
const int inf = 1e9;

#ifdef ONPC
#define debug(args...) {cout << "[" << #args << "]: "; debug_out(args);}
#else
#define debug(args...) {42;}
#endif

void debug_out() {
    cout << endl;
}
template<typename H, typename... T>
void debug_out(vector<H> h, T... t) {
    cout << "{";
    for (H i : h) cout << i << ", ";
    cout << "}, ";
    debug_out(t...);
}
template<typename H, typename... T>
void debug_out(H h, T... t) {
    cout << h << ", ";
    debug_out(t...);
}

struct DSU {
    int n;
    vector<int> par;
    DSU(int n) : n(n), par(n) {
        for (int i = 0; i < n; i++)
            par[i] = i;
    }
    void merge(int a, int b) {
        a = get(a), b = get(b);
        par[b] = a;
    }
    int get(int i) {
        return par[i] == i ? i : par[i] = get(par[i]);
    }
};

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
    vector ans(n, vector<int>(n));

    DSU cc1(n), cc(n);
    for (int i = 0;i  < n;i++)
        for (int j = 0; j < n; j++) {
            if (p[i][j] == 1)
                cc1.merge(i, j);
            if (p[i][j])
                cc.merge(i, j);
        }

    DSU rcc(n), rcc1(n);

    for (int i = 0; i < n; i++) {
        int j = cc1.get(i);
        if (j == i) continue;
        ans[i][j] = ans[j][i] = 1;
        rcc1.merge(i, j);
    }


    for (int i = 0; i < n; i++) {
        if (cc.get(i) != i) continue;
        vector<int> full{i};
        for (int j = 0; j < n; j++) {
            if (j == i) continue;
            if (cc.get(j) == cc.get(i))
                full.push_back(cc1.get(j));
        }
        debug(full);
        sort(full.begin(), full.end());
        full.erase(unique(full.begin(), full.end()), full.end());
        if (full.size() == 2) return 0;
        if (full.size() == 1) continue;
        int m = full.size();
        for (int j = 0; j < m; j++) {
            ans[full[j]][full[(j + 1) % m]] = 1;
            ans[full[(j + 1) % m]][full[j]] = 1;
        }
    }
    for (int i = 0; i < n;i++)
        for (int j = 0; j < n; j++)
            if (ans[i][j])
                rcc.merge(i, j);

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (pair(cc.get(i) == cc.get(j), cc1.get(i) == cc1.get(j))
                    != pair(rcc.get(i) == rcc.get(j), rcc1.get(i) == rcc1.get(j)))
                return 0;
            if (bool(p[i][j]) != (rcc.get(i) == rcc.get(j)))
                return 0;
        }
    }

    build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:10:25: warning: statement has no effect [-Wunused-value]
   10 | #define debug(args...) {42;}
      |                         ^~
supertrees.cpp:76:9: note: in expansion of macro 'debug'
   76 |         debug(full);
      |         ^~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 168 ms 21992 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 168 ms 21992 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1160 KB Output is correct
13 Correct 161 ms 22020 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 88 ms 12844 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 42 ms 6220 KB Output is correct
21 Correct 174 ms 22764 KB Output is correct
22 Correct 196 ms 22876 KB Output is correct
23 Correct 178 ms 22792 KB Output is correct
24 Correct 162 ms 22928 KB Output is correct
25 Correct 69 ms 12848 KB Output is correct
26 Correct 72 ms 12864 KB Output is correct
27 Correct 171 ms 22788 KB Output is correct
28 Correct 170 ms 22776 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 7 ms 1188 KB Output is correct
9 Correct 155 ms 22012 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1100 KB Output is correct
13 Correct 158 ms 22016 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 5 ms 820 KB Output is correct
17 Correct 87 ms 14064 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 40 ms 6180 KB Output is correct
22 Correct 161 ms 24016 KB Output is correct
23 Correct 164 ms 23928 KB Output is correct
24 Correct 165 ms 23980 KB Output is correct
25 Correct 67 ms 14076 KB Output is correct
26 Correct 69 ms 14200 KB Output is correct
27 Correct 160 ms 23920 KB Output is correct
28 Correct 197 ms 23920 KB Output is correct
29 Correct 76 ms 14068 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 44 ms 5716 KB Output is correct
5 Correct 171 ms 22020 KB Output is correct
6 Correct 171 ms 22004 KB Output is correct
7 Correct 169 ms 22028 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 41 ms 5732 KB Output is correct
10 Correct 155 ms 22020 KB Output is correct
11 Correct 160 ms 21964 KB Output is correct
12 Correct 200 ms 22064 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 40 ms 5768 KB Output is correct
17 Correct 159 ms 22032 KB Output is correct
18 Correct 169 ms 22024 KB Output is correct
19 Correct 165 ms 22028 KB Output is correct
20 Correct 162 ms 22144 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 168 ms 21992 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1160 KB Output is correct
13 Correct 161 ms 22020 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 88 ms 12844 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 42 ms 6220 KB Output is correct
21 Correct 174 ms 22764 KB Output is correct
22 Correct 196 ms 22876 KB Output is correct
23 Correct 178 ms 22792 KB Output is correct
24 Correct 162 ms 22928 KB Output is correct
25 Correct 69 ms 12848 KB Output is correct
26 Correct 72 ms 12864 KB Output is correct
27 Correct 171 ms 22788 KB Output is correct
28 Correct 170 ms 22776 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 7 ms 1188 KB Output is correct
37 Correct 155 ms 22012 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1100 KB Output is correct
41 Correct 158 ms 22016 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 5 ms 820 KB Output is correct
45 Correct 87 ms 14064 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 40 ms 6180 KB Output is correct
50 Correct 161 ms 24016 KB Output is correct
51 Correct 164 ms 23928 KB Output is correct
52 Correct 165 ms 23980 KB Output is correct
53 Correct 67 ms 14076 KB Output is correct
54 Correct 69 ms 14200 KB Output is correct
55 Correct 160 ms 23920 KB Output is correct
56 Correct 197 ms 23920 KB Output is correct
57 Correct 76 ms 14068 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 82 ms 14064 KB Output is correct
62 Correct 1 ms 300 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 304 KB Output is correct
65 Correct 42 ms 6220 KB Output is correct
66 Correct 70 ms 14076 KB Output is correct
67 Correct 67 ms 14064 KB Output is correct
68 Correct 82 ms 14064 KB Output is correct
69 Correct 83 ms 14064 KB Output is correct

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 1108 KB Output is correct
7 Correct 168 ms 21992 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 1160 KB Output is correct
13 Correct 161 ms 22020 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 88 ms 12844 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 42 ms 6220 KB Output is correct
21 Correct 174 ms 22764 KB Output is correct
22 Correct 196 ms 22876 KB Output is correct
23 Correct 178 ms 22792 KB Output is correct
24 Correct 162 ms 22928 KB Output is correct
25 Correct 69 ms 12848 KB Output is correct
26 Correct 72 ms 12864 KB Output is correct
27 Correct 171 ms 22788 KB Output is correct
28 Correct 170 ms 22776 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 7 ms 1188 KB Output is correct
37 Correct 155 ms 22012 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 7 ms 1100 KB Output is correct
41 Correct 158 ms 22016 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 5 ms 820 KB Output is correct
45 Correct 87 ms 14064 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 40 ms 6180 KB Output is correct
50 Correct 161 ms 24016 KB Output is correct
51 Correct 164 ms 23928 KB Output is correct
52 Correct 165 ms 23980 KB Output is correct
53 Correct 67 ms 14076 KB Output is correct
54 Correct 69 ms 14200 KB Output is correct
55 Correct 160 ms 23920 KB Output is correct
56 Correct 197 ms 23920 KB Output is correct
57 Correct 76 ms 14068 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 44 ms 5716 KB Output is correct
62 Correct 171 ms 22020 KB Output is correct
63 Correct 171 ms 22004 KB Output is correct
64 Correct 169 ms 22028 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 41 ms 5732 KB Output is correct
67 Correct 155 ms 22020 KB Output is correct
68 Correct 160 ms 21964 KB Output is correct
69 Correct 200 ms 22064 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 40 ms 5768 KB Output is correct
74 Correct 159 ms 22032 KB Output is correct
75 Correct 169 ms 22024 KB Output is correct
76 Correct 165 ms 22028 KB Output is correct
77 Correct 162 ms 22144 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 4 ms 852 KB Output is correct
81 Correct 82 ms 14064 KB Output is correct
82 Correct 1 ms 300 KB Output is correct
83 Correct 1 ms 212 KB Output is correct
84 Correct 1 ms 304 KB Output is correct
85 Correct 42 ms 6220 KB Output is correct
86 Correct 70 ms 14076 KB Output is correct
87 Correct 67 ms 14064 KB Output is correct
88 Correct 82 ms 14064 KB Output is correct
89 Correct 83 ms 14064 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 3 ms 852 KB Output is correct
93 Correct 88 ms 13992 KB Output is correct
94 Incorrect 1 ms 296 KB Answer gives possible 1 while actual possible 0
95 Halted 0 ms 0 KB -