oj.uz

Submission #873387

# Submission time Handle Problem Language Result Execution time Memory
873387 2023-11-15T01:58:12 Z bobbilyking Connecting Supertrees (IOI20_supertrees) C++17
40 / 100
 171 ms 22316 KB 
#include "supertrees.h"
using namespace std;
#include <bits/stdc++.h>
using ll=long long;

#define F(i, l, r) for (ll i = (l); i < ll(r); ++i)
bool vis[1010];
vector<ll> comp;

struct info {
	vector<ll> twos;
	vector<vector<ll>> ones;
};

vector<info> glob;

void dfs(ll i, vector<vector<int>>& p) {
	if (vis[i]) return;
	vis[i] = 1;
	comp.push_back(i);
	F(j, 0, p.size()) if (p[i][j]) dfs(j, p);
}

ll dsu[1010];
vector<ll> st[1010];
ll find(ll i) {
	return dsu[i] == i ? i: dsu[i] = find(dsu[i]);
}


bool my_build(std::vector<std::vector<int>>& b) {
	for (auto &[twos, ones]: glob) {
		if (!twos.size()) if (ones.size() != 1) return false; // if no cycles, y'all should be happy wtf bruther
		for (const auto &y: ones) {
			if (twos.size()) twos.push_back(y[0]); // then we actually neeed this shit
			for (ll i = 0; i + 1 < ll(y.size()); ++i) b[y[i]][y[i+1]] = b[y[i+1]][y[i]] = 1;
		}
		if (twos.size() != 0 and twos.size() < 3) return false; // cant have a cycle with less than 3 nodes bruh
		F(i, 0, twos.size()) {
			ll nidx = (i+1)%twos.size();
			b[twos[i]][twos[nidx]] = b[twos[nidx]][twos[i]] = 1;
		}
	}
	return 1;
}

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

	for (auto &x: p) for (auto y: x) if (y==3) return 0;
	F(i, 0, n) {
		dsu[i] = i;
		st[i] = {i};
	}

	F(i, 0, n) if (!vis[i]) {
		comp.clear();
		dfs(i, p);
		if (comp.size() == 1) continue; // empty live my life yo
		info cur;

		for (auto idx: comp) {
			ll ign = 0;
			for (auto x: comp) if (x-idx) {
				if (!p[idx][x]) return false; // everything within component is connected
				if (p[idx][x] == 1) {
					ll u = find(idx), v = find(x);
					if (u-v) {	
						if (st[u].size() < st[v].size()) swap(u, v);
						dsu[v] = u;
						st[u].insert(st[u].end(), st[v].begin(), st[v].end());
					}
				} else ign++;
			}
			if (ign + 1 == ll(comp.size())) cur.twos.push_back(idx); // all twos
		}

		set<ll> ivis;
		for (auto idx: comp) if (st[find(idx)].size() > 1) ivis.insert(find(idx));
		for (auto idx: ivis) {
			for (auto y: st[idx]) for (auto z: st[idx]) if (p[y][z] != 1) return false;
			cur.ones.push_back(st[idx]);
		}

		glob.push_back(cur);
	}	

	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}
	if (!my_build(answer)) return false;

	build(answer);
	return 1;
}

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 596 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 154 ms 22276 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 596 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 154 ms 22276 KB Output is correct
8 Correct 0 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 348 KB Output is correct
12 Correct 6 ms 1312 KB Output is correct
13 Correct 144 ms 22232 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 616 KB Output is correct
17 Correct 79 ms 8244 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 36 ms 5716 KB Output is correct
21 Correct 143 ms 22100 KB Output is correct
22 Correct 141 ms 22124 KB Output is correct
23 Correct 151 ms 22048 KB Output is correct
24 Correct 141 ms 22196 KB Output is correct
25 Correct 62 ms 8276 KB Output is correct
26 Correct 61 ms 8224 KB Output is correct
27 Correct 151 ms 22060 KB Output is correct
28 Correct 147 ms 22316 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 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 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 1368 KB Output is correct
9 Correct 149 ms 22136 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1116 KB Output is correct
13 Correct 146 ms 22308 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 604 KB Output is correct
17 Correct 69 ms 8224 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 384 KB Output is correct
21 Correct 36 ms 5804 KB Output is correct
22 Correct 142 ms 22140 KB Output is correct
23 Correct 150 ms 22048 KB Output is correct
24 Correct 171 ms 22096 KB Output is correct
25 Correct 58 ms 12320 KB Output is correct
26 Correct 58 ms 8276 KB Output is correct
27 Correct 143 ms 22120 KB Output is correct
28 Correct 152 ms 22096 KB Output is correct
29 Correct 59 ms 12116 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 348 KB Output is correct
4 Correct 36 ms 5792 KB Output is correct
5 Correct 143 ms 22064 KB Output is correct
6 Correct 151 ms 22048 KB Output is correct
7 Correct 153 ms 22088 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 36 ms 5800 KB Output is correct
10 Correct 151 ms 22132 KB Output is correct
11 Correct 142 ms 22096 KB Output is correct
12 Correct 148 ms 22208 KB Output is correct
13 Correct 0 ms 512 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Incorrect 15 ms 3420 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 596 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 154 ms 22276 KB Output is correct
8 Correct 0 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 348 KB Output is correct
12 Correct 6 ms 1312 KB Output is correct
13 Correct 144 ms 22232 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 616 KB Output is correct
17 Correct 79 ms 8244 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 36 ms 5716 KB Output is correct
21 Correct 143 ms 22100 KB Output is correct
22 Correct 141 ms 22124 KB Output is correct
23 Correct 151 ms 22048 KB Output is correct
24 Correct 141 ms 22196 KB Output is correct
25 Correct 62 ms 8276 KB Output is correct
26 Correct 61 ms 8224 KB Output is correct
27 Correct 151 ms 22060 KB Output is correct
28 Correct 147 ms 22316 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 344 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 1 ms 344 KB Output is correct
36 Correct 6 ms 1368 KB Output is correct
37 Correct 149 ms 22136 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 1116 KB Output is correct
41 Correct 146 ms 22308 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 69 ms 8224 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 384 KB Output is correct
49 Correct 36 ms 5804 KB Output is correct
50 Correct 142 ms 22140 KB Output is correct
51 Correct 150 ms 22048 KB Output is correct
52 Correct 171 ms 22096 KB Output is correct
53 Correct 58 ms 12320 KB Output is correct
54 Correct 58 ms 8276 KB Output is correct
55 Correct 143 ms 22120 KB Output is correct
56 Correct 152 ms 22096 KB Output is correct
57 Correct 59 ms 12116 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 3 ms 868 KB Output is correct
61 Correct 68 ms 10188 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 Incorrect 16 ms 3864 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 596 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 6 ms 1372 KB Output is correct
7 Correct 154 ms 22276 KB Output is correct
8 Correct 0 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 348 KB Output is correct
12 Correct 6 ms 1312 KB Output is correct
13 Correct 144 ms 22232 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 616 KB Output is correct
17 Correct 79 ms 8244 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 36 ms 5716 KB Output is correct
21 Correct 143 ms 22100 KB Output is correct
22 Correct 141 ms 22124 KB Output is correct
23 Correct 151 ms 22048 KB Output is correct
24 Correct 141 ms 22196 KB Output is correct
25 Correct 62 ms 8276 KB Output is correct
26 Correct 61 ms 8224 KB Output is correct
27 Correct 151 ms 22060 KB Output is correct
28 Correct 147 ms 22316 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 344 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 1 ms 344 KB Output is correct
36 Correct 6 ms 1368 KB Output is correct
37 Correct 149 ms 22136 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 1116 KB Output is correct
41 Correct 146 ms 22308 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 3 ms 604 KB Output is correct
45 Correct 69 ms 8224 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 384 KB Output is correct
49 Correct 36 ms 5804 KB Output is correct
50 Correct 142 ms 22140 KB Output is correct
51 Correct 150 ms 22048 KB Output is correct
52 Correct 171 ms 22096 KB Output is correct
53 Correct 58 ms 12320 KB Output is correct
54 Correct 58 ms 8276 KB Output is correct
55 Correct 143 ms 22120 KB Output is correct
56 Correct 152 ms 22096 KB Output is correct
57 Correct 59 ms 12116 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 348 KB Output is correct
61 Correct 36 ms 5792 KB Output is correct
62 Correct 143 ms 22064 KB Output is correct
63 Correct 151 ms 22048 KB Output is correct
64 Correct 153 ms 22088 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 36 ms 5800 KB Output is correct
67 Correct 151 ms 22132 KB Output is correct
68 Correct 142 ms 22096 KB Output is correct
69 Correct 148 ms 22208 KB Output is correct
70 Correct 0 ms 512 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Incorrect 15 ms 3420 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -