oj.uz

Submission #718725

# Submission time Handle Problem Language Result Execution time Memory
718725 2023-04-04T14:48:40 Z baojiaopisu Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 205 ms 23944 KB 
#include "supertrees.h"
#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define left BAO
#define right ANH
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
	void add(X &x, const Y &y) {
		x = (x + y);
		if(x >= MOD) x -= MOD;
	}

template<class X, class Y> 
	void sub(X &x, const Y &y) {
		x = (x - y);
		if(x < 0) x += MOD;
	}

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;

int par[N];
bool ok[N];
int curr[N];
int find_par(int u) {
	if(par[u] < 0) return u;
	par[u] = find_par(par[u]);
	return par[u];
}
bool merge(int u, int v) {
	u = find_par(u), v = find_par(v);
	if(u == v) return false;
	if(par[u] > par[v]) swap(u, v);
	par[u] += par[v];
	par[v] = u;
	return true;
}

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

	for(int i = 0; i < n; i++) par[i] = -1;
	for(int i = 0; i < n; i++) {
		if(p[i][i] != 1) return 0;
		for(int j = 0; j < n; j++) {
			if(p[i][j] > 2) return 0;
			if(p[i][j] == 1) {
				if(merge(i, j)) ans[i][j] = ans[j][i] = 1;
			}
		}
	}

	for(int i = 0; i < n; i++) {
		for(int j = i + 1; j < n; j++) {
			if(find_par(i) == find_par(j) && p[i][j] != 1) return 0;
		}
	}

	for(int i = 0; i < n; i++) curr[i] = -1;
	for(int i = 0; i < n; i++) {
		if(find_par(i) == i && !ok[i]) {
			vector<int> root;
			root.pb(i);
			for(int j = i + 1; j < n; j++) {
				if(find_par(j) == j && p[i][j] == 2) {
					root.pb(j);
				}
			}

			vector<int> node;	
			for(auto x : root) curr[x] = i, ok[x] = true;
			for(int j = 0; j < n; j++) if(curr[find_par(j)] == i) node.pb(j);

			if(root.size() == 2) return 0;
			if(root.size() > 1) {
				for(int j = 0; j < root.size(); j++) {
					int u = root[j];
					int v = root[(j + 1) % root.size()];
					ans[u][v] = ans[v][u] = true;
				}
			}

			for(int i = 0; i < root.size(); i++) {
				for(int j = i + 1; j < root.size(); j++) {
					if(p[root[i]][root[j]] != 2) return 0;
				}
			}

			for(int j = 0; j < node.size(); j++) {
				for(int k = j + 1; k < node.size(); k++) {
					int u = node[j];
					int v = node[k];
					if(find_par(u) != find_par(v) && p[u][v] != 2) {
						return 0;
					}
				}
			}

			for(int j = 0; j < node.size(); j++) {
				for(int k = j + 1; k < node.size(); k++) {
					int u = node[j];
					int v = node[k];
					merge(u, v);
				}
			}
		}
	}

	for(int i = 0; i < n; i++) {
		for(int j = i + 1; j < n; j++) {
			if(find_par(i) != find_par(j) && p[i][j] > 0) return 0;
		}
	}

	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:128:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  128 |     for(int j = 0; j < root.size(); j++) {
      |                    ~~^~~~~~~~~~~~~
supertrees.cpp:135:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |    for(int i = 0; i < root.size(); i++) {
      |                   ~~^~~~~~~~~~~~~
supertrees.cpp:136:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  136 |     for(int j = i + 1; j < root.size(); j++) {
      |                        ~~^~~~~~~~~~~~~
supertrees.cpp:141:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |    for(int j = 0; j < node.size(); j++) {
      |                   ~~^~~~~~~~~~~~~
supertrees.cpp:142:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |     for(int k = j + 1; k < node.size(); k++) {
      |                        ~~^~~~~~~~~~~~~
supertrees.cpp:151:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  151 |    for(int j = 0; j < node.size(); j++) {
      |                   ~~^~~~~~~~~~~~~
supertrees.cpp:152:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |     for(int k = j + 1; k < node.size(); k++) {
      |                        ~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 8 ms 1148 KB Output is correct
7 Correct 186 ms 21980 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 1 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 8 ms 1148 KB Output is correct
7 Correct 186 ms 21980 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 8 ms 1144 KB Output is correct
13 Correct 178 ms 21984 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 98 ms 12108 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 42 ms 5760 KB Output is correct
21 Correct 205 ms 21996 KB Output is correct
22 Correct 169 ms 22032 KB Output is correct
23 Correct 194 ms 22036 KB Output is correct
24 Correct 174 ms 22032 KB Output is correct
25 Correct 80 ms 12048 KB Output is correct
26 Correct 73 ms 12048 KB Output is correct
27 Correct 183 ms 22012 KB Output is correct
28 Correct 184 ms 21964 KB Output is correct

Subtask #3
19.0 / 19.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 1 ms 212 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 8 ms 1176 KB Output is correct
9 Correct 171 ms 21972 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 197 ms 22036 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 80 ms 12048 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 44 ms 5704 KB Output is correct
22 Correct 170 ms 22016 KB Output is correct
23 Correct 176 ms 21964 KB Output is correct
24 Correct 181 ms 22044 KB Output is correct
25 Correct 83 ms 12108 KB Output is correct
26 Correct 71 ms 12048 KB Output is correct
27 Correct 168 ms 23944 KB Output is correct
28 Correct 189 ms 23936 KB Output is correct
29 Correct 76 ms 14088 KB Output is correct

Subtask #4
35.0 / 35.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 1 ms 212 KB Output is correct
4 Correct 51 ms 5688 KB Output is correct
5 Correct 172 ms 22052 KB Output is correct
6 Correct 169 ms 22032 KB Output is correct
7 Correct 192 ms 22028 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 42 ms 5772 KB Output is correct
10 Correct 179 ms 22064 KB Output is correct
11 Correct 170 ms 22052 KB Output is correct
12 Correct 179 ms 21992 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 44 ms 5772 KB Output is correct
17 Correct 164 ms 22032 KB Output is correct
18 Correct 175 ms 21964 KB Output is correct
19 Correct 172 ms 22044 KB Output is correct
20 Correct 192 ms 22080 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 1 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 8 ms 1148 KB Output is correct
7 Correct 186 ms 21980 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 8 ms 1144 KB Output is correct
13 Correct 178 ms 21984 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 98 ms 12108 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 42 ms 5760 KB Output is correct
21 Correct 205 ms 21996 KB Output is correct
22 Correct 169 ms 22032 KB Output is correct
23 Correct 194 ms 22036 KB Output is correct
24 Correct 174 ms 22032 KB Output is correct
25 Correct 80 ms 12048 KB Output is correct
26 Correct 73 ms 12048 KB Output is correct
27 Correct 183 ms 22012 KB Output is correct
28 Correct 184 ms 21964 KB Output is correct
29 Correct 0 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 1 ms 212 KB Output is correct
33 Correct 1 ms 292 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 8 ms 1176 KB Output is correct
37 Correct 171 ms 21972 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 8 ms 1108 KB Output is correct
41 Correct 197 ms 22036 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 80 ms 12048 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 44 ms 5704 KB Output is correct
50 Correct 170 ms 22016 KB Output is correct
51 Correct 176 ms 21964 KB Output is correct
52 Correct 181 ms 22044 KB Output is correct
53 Correct 83 ms 12108 KB Output is correct
54 Correct 71 ms 12048 KB Output is correct
55 Correct 168 ms 23944 KB Output is correct
56 Correct 189 ms 23936 KB Output is correct
57 Correct 76 ms 14088 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 5 ms 836 KB Output is correct
61 Correct 93 ms 14104 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 59 ms 6176 KB Output is correct
66 Correct 71 ms 14084 KB Output is correct
67 Correct 73 ms 14076 KB Output is correct
68 Correct 82 ms 14028 KB Output is correct
69 Correct 71 ms 14008 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 8 ms 1148 KB Output is correct
7 Correct 186 ms 21980 KB Output is correct
8 Correct 1 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 1 ms 212 KB Output is correct
12 Correct 8 ms 1144 KB Output is correct
13 Correct 178 ms 21984 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 98 ms 12108 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 42 ms 5760 KB Output is correct
21 Correct 205 ms 21996 KB Output is correct
22 Correct 169 ms 22032 KB Output is correct
23 Correct 194 ms 22036 KB Output is correct
24 Correct 174 ms 22032 KB Output is correct
25 Correct 80 ms 12048 KB Output is correct
26 Correct 73 ms 12048 KB Output is correct
27 Correct 183 ms 22012 KB Output is correct
28 Correct 184 ms 21964 KB Output is correct
29 Correct 0 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 1 ms 212 KB Output is correct
33 Correct 1 ms 292 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 8 ms 1176 KB Output is correct
37 Correct 171 ms 21972 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 8 ms 1108 KB Output is correct
41 Correct 197 ms 22036 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 80 ms 12048 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 44 ms 5704 KB Output is correct
50 Correct 170 ms 22016 KB Output is correct
51 Correct 176 ms 21964 KB Output is correct
52 Correct 181 ms 22044 KB Output is correct
53 Correct 83 ms 12108 KB Output is correct
54 Correct 71 ms 12048 KB Output is correct
55 Correct 168 ms 23944 KB Output is correct
56 Correct 189 ms 23936 KB Output is correct
57 Correct 76 ms 14088 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 51 ms 5688 KB Output is correct
62 Correct 172 ms 22052 KB Output is correct
63 Correct 169 ms 22032 KB Output is correct
64 Correct 192 ms 22028 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 42 ms 5772 KB Output is correct
67 Correct 179 ms 22064 KB Output is correct
68 Correct 170 ms 22052 KB Output is correct
69 Correct 179 ms 21992 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 44 ms 5772 KB Output is correct
74 Correct 164 ms 22032 KB Output is correct
75 Correct 175 ms 21964 KB Output is correct
76 Correct 172 ms 22044 KB Output is correct
77 Correct 192 ms 22080 KB Output is correct
78 Correct 1 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 5 ms 836 KB Output is correct
81 Correct 93 ms 14104 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 1 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 59 ms 6176 KB Output is correct
86 Correct 71 ms 14084 KB Output is correct
87 Correct 73 ms 14076 KB Output is correct
88 Correct 82 ms 14028 KB Output is correct
89 Correct 71 ms 14008 KB Output is correct
90 Correct 1 ms 212 KB Output is correct
91 Correct 1 ms 212 KB Output is correct
92 Correct 4 ms 852 KB Output is correct
93 Correct 75 ms 14000 KB Output is correct
94 Correct 1 ms 212 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 19 ms 3724 KB Output is correct
98 Correct 75 ms 14080 KB Output is correct
99 Correct 103 ms 14080 KB Output is correct
100 Correct 74 ms 14080 KB Output is correct
101 Correct 72 ms 14080 KB Output is correct
102 Correct 73 ms 14092 KB Output is correct
103 Correct 74 ms 14096 KB Output is correct
104 Correct 81 ms 14084 KB Output is correct
105 Correct 81 ms 14096 KB Output is correct