oj.uz

Submission #976077

# Submission time Handle Problem Language Result Execution time Memory
976077 2024-05-06T07:05:59 Z efedmrlr Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 178 ms 22352 KB 
// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,popcnt")
#include <bits/stdc++.h>
#include "supertrees.h"


#define lli long long int
#define ld long double
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end();
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define MP make_pair

using namespace std;

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

const int N = 1e5 + 5;
const int INF = 1e9 + 500;
const int MOD = 1e9 + 7;

struct DSU {
    vector<int> p, sz;
    int n;
    void make_set(int x) {
        p[x] = x;
        sz[x] = 1;
    }
    void init(int nn) {
        n = nn;
        p.assign(n + 3, 0);
        sz.assign(n + 3, 0);
        for(int i = 0; i < n; i++) {
            make_set(i);
        }
    }
    int find_set(int x) {
        return (x == p[x]) ? x : p[x] = find_set(p[x]);
    }
    bool union_set(int x, int y) {
        x = find_set(x); y = find_set(y);
        if(x == y) return 0;
        if(sz[x] < sz[y]) swap(x, y);
        sz[x] += sz[y];
        p[y] = x;
        return 1;
    }
};

int construct(std::vector<std::vector<int>> p) {
	int n = (int)p.size();
	vector<vector<int> > ans(n, vector<int>(n, 0));
    DSU ds, ds2;
    ds.init(n);

    // check zero
    bool f = 1;
    for(int i = 0; i < n; i++) {
        for(int j = i + 1; j < n; j++) {
            if(p[i][j]) {
                ds.union_set(i, j);
            }
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = i + 1; j < n; j++) {
            if(!p[i][j] && ds.find_set(i) == ds.find_set(j)) {
                f = 0;
            }
        }
    }
    if(!f) return 0;
    cerr << "zort" << endl;
    ds.init(n);
    ds2.init(n);
    // connect 1 and 2 separately
    for(int i = 0; i < n; i++) {
        for(int j = i + 1; j < n; j++) {
            if(p[i][j] == 1) {
                ds.union_set(i, j);
            }
            else if(p[i][j] == 2) {
                ds2.union_set(i, j);
            }
        }
    }
    vector<vector<int> > cmp(n, vector<int>());
    for(int i = 0; i < n; i++) {
        cmp[ds.find_set(i)].pb(i);
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < (int)cmp[i].size() - 1; j++) {
            // assert(j + 1 <= (int)cmp[i].size() - 1); 
            // assert(ans[cmp[i][j]].size() == 4);
            // assert(ans[cmp[i][j + 1]].size() == 4);
            ans[cmp[i][j]][cmp[i][j + 1]] = 1;
            ans[cmp[i][j + 1]][cmp[i][j]] = 1;
        }
    }
    cmp.assign(n, vector<int>());
    for(int i = 0; i < n; i++) {
        cmp[ds2.find_set(i)].pb(i);
    }
    for(int i = 0; i < n; i++) {
        if(cmp[i].size() == 2) {
            f = 0;
        }
        if(cmp[i].size() < 2) continue;
        for(int j = 0; j < cmp[i].size() - 1; j++) {
            ans[cmp[i][j]][cmp[i][j + 1]] = 1;
            ans[cmp[i][j + 1]][cmp[i][j]] = 1;
        }
        ans[cmp[i][0]][cmp[i][cmp[i].size() - 1]] = 1;
        ans[cmp[i][cmp[i].size() - 1]][cmp[i][0]] = 1;
    }
    if(!f) return 0;
    build(ans);

	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:113:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |         for(int j = 0; j < cmp[i].size() - 1; 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 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1112 KB Output is correct
7 Correct 172 ms 22120 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 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1112 KB Output is correct
7 Correct 172 ms 22120 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 168 ms 22100 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 93 ms 12056 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 43 ms 5888 KB Output is correct
21 Correct 171 ms 22024 KB Output is correct
22 Correct 171 ms 22280 KB Output is correct
23 Correct 177 ms 22040 KB Output is correct
24 Correct 166 ms 22100 KB Output is correct
25 Correct 80 ms 12056 KB Output is correct
26 Correct 77 ms 12040 KB Output is correct
27 Correct 175 ms 22104 KB Output is correct
28 Correct 174 ms 22020 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 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 7 ms 1116 KB Output is correct
9 Correct 167 ms 22144 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 8 ms 1288 KB Output is correct
13 Correct 175 ms 22020 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 89 ms 12036 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 45 ms 5880 KB Output is correct
22 Correct 171 ms 22100 KB Output is correct
23 Correct 166 ms 22096 KB Output is correct
24 Correct 176 ms 22036 KB Output is correct
25 Correct 76 ms 12296 KB Output is correct
26 Correct 79 ms 12040 KB Output is correct
27 Correct 170 ms 22352 KB Output is correct
28 Correct 175 ms 22100 KB Output is correct
29 Correct 76 ms 12112 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 344 KB Output is correct
4 Correct 43 ms 5768 KB Output is correct
5 Correct 170 ms 22020 KB Output is correct
6 Correct 173 ms 22192 KB Output is correct
7 Correct 176 ms 22036 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 44 ms 5728 KB Output is correct
10 Correct 168 ms 22120 KB Output is correct
11 Correct 165 ms 22100 KB Output is correct
12 Correct 178 ms 22100 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 388 KB Output is correct
15 Incorrect 0 ms 348 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
16 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 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1112 KB Output is correct
7 Correct 172 ms 22120 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 168 ms 22100 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 93 ms 12056 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 43 ms 5888 KB Output is correct
21 Correct 171 ms 22024 KB Output is correct
22 Correct 171 ms 22280 KB Output is correct
23 Correct 177 ms 22040 KB Output is correct
24 Correct 166 ms 22100 KB Output is correct
25 Correct 80 ms 12056 KB Output is correct
26 Correct 77 ms 12040 KB Output is correct
27 Correct 175 ms 22104 KB Output is correct
28 Correct 174 ms 22020 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 7 ms 1116 KB Output is correct
37 Correct 167 ms 22144 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 8 ms 1288 KB Output is correct
41 Correct 175 ms 22020 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 89 ms 12036 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 45 ms 5880 KB Output is correct
50 Correct 171 ms 22100 KB Output is correct
51 Correct 166 ms 22096 KB Output is correct
52 Correct 176 ms 22036 KB Output is correct
53 Correct 76 ms 12296 KB Output is correct
54 Correct 79 ms 12040 KB Output is correct
55 Correct 170 ms 22352 KB Output is correct
56 Correct 175 ms 22100 KB Output is correct
57 Correct 76 ms 12112 KB Output is correct
58 Correct 0 ms 344 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 4 ms 860 KB Output is correct
61 Correct 87 ms 12116 KB Output is correct
62 Correct 0 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 42 ms 5736 KB Too many ways to get from 1 to 269, should be 1 found no less than 2
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 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 1112 KB Output is correct
7 Correct 172 ms 22120 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 168 ms 22100 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 93 ms 12056 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 43 ms 5888 KB Output is correct
21 Correct 171 ms 22024 KB Output is correct
22 Correct 171 ms 22280 KB Output is correct
23 Correct 177 ms 22040 KB Output is correct
24 Correct 166 ms 22100 KB Output is correct
25 Correct 80 ms 12056 KB Output is correct
26 Correct 77 ms 12040 KB Output is correct
27 Correct 175 ms 22104 KB Output is correct
28 Correct 174 ms 22020 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 7 ms 1116 KB Output is correct
37 Correct 167 ms 22144 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 8 ms 1288 KB Output is correct
41 Correct 175 ms 22020 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 89 ms 12036 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 45 ms 5880 KB Output is correct
50 Correct 171 ms 22100 KB Output is correct
51 Correct 166 ms 22096 KB Output is correct
52 Correct 176 ms 22036 KB Output is correct
53 Correct 76 ms 12296 KB Output is correct
54 Correct 79 ms 12040 KB Output is correct
55 Correct 170 ms 22352 KB Output is correct
56 Correct 175 ms 22100 KB Output is correct
57 Correct 76 ms 12112 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 344 KB Output is correct
61 Correct 43 ms 5768 KB Output is correct
62 Correct 170 ms 22020 KB Output is correct
63 Correct 173 ms 22192 KB Output is correct
64 Correct 176 ms 22036 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 44 ms 5728 KB Output is correct
67 Correct 168 ms 22120 KB Output is correct
68 Correct 165 ms 22100 KB Output is correct
69 Correct 178 ms 22100 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 388 KB Output is correct
72 Incorrect 0 ms 348 KB Too many ways to get from 0 to 4, should be 1 found no less than 2
73 Halted 0 ms 0 KB -