oj.uz

답안 #976314

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
976314 2024-05-06T12:19:04 Z efedmrlr 슈퍼트리 잇기 (IOI20_supertrees) C++17
100 / 100
 197 ms 23624 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, typ;
    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);
        typ.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;
    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);
            }
            if(p[i][j] == 3) return 0;
        }
    }
    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);
    vector<int> reps;
    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);
            }
        }
    }
    vector<vector<int> > comp(n, vector<int>());
    for(int i = 0; i < n; i++) {
        if(ds.find_set(i) == i) reps.pb(i);
        comp[ds.find_set(i)].pb(i);
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < (int)comp[i].size() - 1; j++) {
            ans[comp[i][j]][comp[i][j + 1]] = 1;
            ans[comp[i][j + 1]][comp[i][j]] = 1;
        }
    }
    DSU ds2;
    ds2.init(n);
    // for(auto c : reps) {
    //     cout << c << " ";
    // }
    // cout << "\n\n";
    for(int i = 0; i < reps.size(); i++) {
        for(int j = i + 1; j < reps.size(); j++) {
            if(p[reps[i]][reps[j]] == 2) {
                ds2.union_set(reps[i], reps[j]);
            } 
        }
    }
    comp.assign(n, vector<int>());
    for(int i = 0; i < n; i++) {
        comp[ds2.find_set(i)].pb(i);
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < (int)comp[i].size() - 1; j++) {
            ans[comp[i][j]][comp[i][j + 1]] = 1;
            ans[comp[i][j + 1]][comp[i][j]] = 1;
        }
        if(comp[i].size() > 1) {
            ans[comp[i].back()][comp[i][0]] = 1;
            ans[comp[i][0]][comp[i].back()] = 1;
        }
        if(comp[i].size() == 2) {
            f = 0;
        }
    }

    if(!f) return 0;

    build(ans);

	return 1;
}

Compilation message

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 8 ms 1372 KB Output is correct
7 Correct 166 ms 23484 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 8 ms 1372 KB Output is correct
7 Correct 166 ms 23484 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 1408 KB Output is correct
13 Correct 168 ms 23560 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 86 ms 13320 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 46 ms 6200 KB Output is correct
21 Correct 169 ms 23544 KB Output is correct
22 Correct 179 ms 23284 KB Output is correct
23 Correct 174 ms 23376 KB Output is correct
24 Correct 164 ms 23380 KB Output is correct
25 Correct 75 ms 13440 KB Output is correct
26 Correct 74 ms 13432 KB Output is correct
27 Correct 181 ms 23380 KB Output is correct
28 Correct 167 ms 23560 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 360 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 7 ms 1400 KB Output is correct
9 Correct 170 ms 23432 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 440 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 174 ms 23468 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 856 KB Output is correct
17 Correct 85 ms 13316 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 42 ms 6396 KB Output is correct
22 Correct 164 ms 23472 KB Output is correct
23 Correct 164 ms 23376 KB Output is correct
24 Correct 172 ms 23380 KB Output is correct
25 Correct 72 ms 13588 KB Output is correct
26 Correct 78 ms 13444 KB Output is correct
27 Correct 163 ms 23624 KB Output is correct
28 Correct 178 ms 23376 KB Output is correct
29 Correct 73 ms 13396 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 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 41 ms 6392 KB Output is correct
5 Correct 168 ms 23300 KB Output is correct
6 Correct 163 ms 23304 KB Output is correct
7 Correct 176 ms 23380 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 41 ms 6228 KB Output is correct
10 Correct 170 ms 23380 KB Output is correct
11 Correct 164 ms 23376 KB Output is correct
12 Correct 197 ms 23376 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 41 ms 6232 KB Output is correct
17 Correct 172 ms 23380 KB Output is correct
18 Correct 165 ms 23360 KB Output is correct
19 Correct 166 ms 23300 KB Output is correct
20 Correct 170 ms 23544 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 8 ms 1372 KB Output is correct
7 Correct 166 ms 23484 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 1408 KB Output is correct
13 Correct 168 ms 23560 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 86 ms 13320 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 46 ms 6200 KB Output is correct
21 Correct 169 ms 23544 KB Output is correct
22 Correct 179 ms 23284 KB Output is correct
23 Correct 174 ms 23376 KB Output is correct
24 Correct 164 ms 23380 KB Output is correct
25 Correct 75 ms 13440 KB Output is correct
26 Correct 74 ms 13432 KB Output is correct
27 Correct 181 ms 23380 KB Output is correct
28 Correct 167 ms 23560 KB Output is correct
29 Correct 0 ms 600 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 360 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 7 ms 1400 KB Output is correct
37 Correct 170 ms 23432 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 440 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 174 ms 23468 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 856 KB Output is correct
45 Correct 85 ms 13316 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 42 ms 6396 KB Output is correct
50 Correct 164 ms 23472 KB Output is correct
51 Correct 164 ms 23376 KB Output is correct
52 Correct 172 ms 23380 KB Output is correct
53 Correct 72 ms 13588 KB Output is correct
54 Correct 78 ms 13444 KB Output is correct
55 Correct 163 ms 23624 KB Output is correct
56 Correct 178 ms 23376 KB Output is correct
57 Correct 73 ms 13396 KB Output is correct
58 Correct 1 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 93 ms 13504 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 42 ms 6260 KB Output is correct
66 Correct 77 ms 13316 KB Output is correct
67 Correct 78 ms 13304 KB Output is correct
68 Correct 74 ms 13556 KB Output is correct
69 Correct 73 ms 13408 KB Output is correct

Subtask #6
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 432 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 8 ms 1372 KB Output is correct
7 Correct 166 ms 23484 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 8 ms 1408 KB Output is correct
13 Correct 168 ms 23560 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 86 ms 13320 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 46 ms 6200 KB Output is correct
21 Correct 169 ms 23544 KB Output is correct
22 Correct 179 ms 23284 KB Output is correct
23 Correct 174 ms 23376 KB Output is correct
24 Correct 164 ms 23380 KB Output is correct
25 Correct 75 ms 13440 KB Output is correct
26 Correct 74 ms 13432 KB Output is correct
27 Correct 181 ms 23380 KB Output is correct
28 Correct 167 ms 23560 KB Output is correct
29 Correct 0 ms 600 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 360 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 7 ms 1400 KB Output is correct
37 Correct 170 ms 23432 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 1 ms 440 KB Output is correct
40 Correct 7 ms 1372 KB Output is correct
41 Correct 174 ms 23468 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 4 ms 856 KB Output is correct
45 Correct 85 ms 13316 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 42 ms 6396 KB Output is correct
50 Correct 164 ms 23472 KB Output is correct
51 Correct 164 ms 23376 KB Output is correct
52 Correct 172 ms 23380 KB Output is correct
53 Correct 72 ms 13588 KB Output is correct
54 Correct 78 ms 13444 KB Output is correct
55 Correct 163 ms 23624 KB Output is correct
56 Correct 178 ms 23376 KB Output is correct
57 Correct 73 ms 13396 KB Output is correct
58 Correct 0 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 41 ms 6392 KB Output is correct
62 Correct 168 ms 23300 KB Output is correct
63 Correct 163 ms 23304 KB Output is correct
64 Correct 176 ms 23380 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 41 ms 6228 KB Output is correct
67 Correct 170 ms 23380 KB Output is correct
68 Correct 164 ms 23376 KB Output is correct
69 Correct 197 ms 23376 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 41 ms 6232 KB Output is correct
74 Correct 172 ms 23380 KB Output is correct
75 Correct 165 ms 23360 KB Output is correct
76 Correct 166 ms 23300 KB Output is correct
77 Correct 170 ms 23544 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 4 ms 860 KB Output is correct
81 Correct 93 ms 13504 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 42 ms 6260 KB Output is correct
86 Correct 77 ms 13316 KB Output is correct
87 Correct 78 ms 13304 KB Output is correct
88 Correct 74 ms 13556 KB Output is correct
89 Correct 73 ms 13408 KB Output is correct
90 Correct 1 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 3 ms 860 KB Output is correct
93 Correct 74 ms 13324 KB Output is correct
94 Correct 1 ms 344 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 18 ms 3720 KB Output is correct
98 Correct 72 ms 14164 KB Output is correct
99 Correct 71 ms 14160 KB Output is correct
100 Correct 73 ms 13996 KB Output is correct
101 Correct 71 ms 14068 KB Output is correct
102 Correct 70 ms 13996 KB Output is correct
103 Correct 71 ms 14216 KB Output is correct
104 Correct 74 ms 14164 KB Output is correct
105 Correct 79 ms 13996 KB Output is correct