oj.uz

Submission #300831

# Submission time Handle Problem Language Result Execution time Memory
300831 2020-09-17T14:09:30 Z luciocf Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 295 ms 23260 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
#include <vector>

using namespace std;

const int maxn = 1e3+10;

struct DSU
{
	int pai[maxn], peso[maxn];

	void init(int n)
	{
		for (int i = 0; i < n; i++)
			pai[i] = i, peso[i] = 1;
	}

	int Find(int x)
	{
		if (pai[x] == x) return x;
		return pai[x] = Find(pai[x]);
	}

	void Join(int x, int y)
	{
		x = Find(x), y = Find(y);
		if (x == y) return;

		if (peso[x] < peso[y]) swap(x, y);

		pai[y] = x, peso[x] += peso[y];
	}
} dsu;

bool liga[maxn][maxn];
bool in[maxn];

void edge(int u, int v)
{
	liga[u][v] = liga[v][u] = 1;
}

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

	dsu.init(n);

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			if (p[i][j] != 0)
				dsu.Join(i, j);

	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			if (dsu.Find(i) == dsu.Find(j) && p[i][j] == 0)
				return 0;

	for (int f = 0; f < n; f++)
	{
		vector<int> comp;

		for (int j = 0; j < n; j++)
			if (dsu.Find(j) == f)
				comp.push_back(j);

		if (comp.size() == 0) continue;

		int u = -1, v = -1;

		for (auto i: comp)
			for (auto j: comp)
				if (p[i][j] == 2)
					u = i, v = j;

		if (u == -1)
		{
			for (auto i = 0; i < comp.size(); i++)
			{
				if (i < (int)comp.size()-1) edge(comp[i], comp[i+1]);
				if (i > 0) edge(comp[i], comp[i-1]);
			}

			continue;
		}

		vector<int> ciclo;
		ciclo.push_back(u); ciclo.push_back(v);
		in[u] = 1, in[v] = 1;

		for (auto i: comp)
		{
			bool ok = 1;

			for (auto c: ciclo)
				if (p[i][c] != 2)
					ok = 0;

			if (ok)
			{
				ciclo.push_back(i);
				in[i] = 1;
			}
		}

		if (ciclo.size() == 2) return 0;

		edge(ciclo[0], ciclo.back());
		for (int i = 1; i < ciclo.size(); i++)
			edge(ciclo[i], ciclo[i-1]);

		for (auto i: comp)
		{
			if (in[i]) continue;

			int ind, qtd = 0;

			for (auto c: ciclo)
				if (p[i][c] == 1)
					++qtd, ind = c;

			if (qtd > 1) return 0;

			edge(ind, i);
		}

		for (auto i: comp)
			for (auto j: comp)
				if (!in[i] && !in[j] && p[i][j] == 2)
					return 0;
	}

	for (int i = 0; i < n; i++)
	{
		vector<int> a;
		a.resize(n);

		for (int j = 0; j < n; j++)
			if (liga[i][j])
				a[j] = 1;

		ans.push_back(a);
	}

	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:80:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |    for (auto i = 0; i < comp.size(); i++)
      |                     ~~^~~~~~~~~~~~~
supertrees.cpp:111:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |   for (int i = 1; i < ciclo.size(); i++)
      |                   ~~^~~~~~~~~~~~~~
supertrees.cpp:41:13: warning: 'ind' may be used uninitialized in this function [-Wmaybe-uninitialized]
   41 |  liga[u][v] = liga[v][u] = 1;
      |  ~~~~~~~~~~~^~~~~~~~~~~~~~~~
supertrees.cpp:118:8: note: 'ind' was declared here
  118 |    int ind, qtd = 0;
      |        ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 15 ms 1408 KB Output is correct
7 Correct 274 ms 23160 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 15 ms 1408 KB Output is correct
7 Correct 274 ms 23160 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 262 ms 22108 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 131 ms 8184 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 66 ms 6264 KB Output is correct
21 Correct 267 ms 23132 KB Output is correct
22 Correct 275 ms 23112 KB Output is correct
23 Correct 273 ms 23032 KB Output is correct
24 Correct 255 ms 22392 KB Output is correct
25 Correct 108 ms 8184 KB Output is correct
26 Correct 134 ms 8184 KB Output is correct
27 Correct 285 ms 23160 KB Output is correct
28 Correct 259 ms 22392 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 11 ms 1204 KB Output is correct
9 Correct 255 ms 22136 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 12 ms 1536 KB Output is correct
13 Correct 281 ms 23132 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 122 ms 8156 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 276 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 67 ms 6264 KB Output is correct
22 Correct 270 ms 23160 KB Output is correct
23 Correct 257 ms 23160 KB Output is correct
24 Correct 276 ms 23032 KB Output is correct
25 Correct 111 ms 8440 KB Output is correct
26 Correct 109 ms 8184 KB Output is correct
27 Correct 264 ms 23032 KB Output is correct
28 Correct 280 ms 23032 KB Output is correct
29 Correct 112 ms 8536 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 68 ms 6264 KB Output is correct
5 Correct 266 ms 23160 KB Output is correct
6 Correct 276 ms 23032 KB Output is correct
7 Correct 280 ms 23164 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 66 ms 6392 KB Output is correct
10 Correct 268 ms 23160 KB Output is correct
11 Correct 276 ms 23132 KB Output is correct
12 Correct 295 ms 23260 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Incorrect 28 ms 2304 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 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 15 ms 1408 KB Output is correct
7 Correct 274 ms 23160 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 262 ms 22108 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 131 ms 8184 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 66 ms 6264 KB Output is correct
21 Correct 267 ms 23132 KB Output is correct
22 Correct 275 ms 23112 KB Output is correct
23 Correct 273 ms 23032 KB Output is correct
24 Correct 255 ms 22392 KB Output is correct
25 Correct 108 ms 8184 KB Output is correct
26 Correct 134 ms 8184 KB Output is correct
27 Correct 285 ms 23160 KB Output is correct
28 Correct 259 ms 22392 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 11 ms 1204 KB Output is correct
37 Correct 255 ms 22136 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 12 ms 1536 KB Output is correct
41 Correct 281 ms 23132 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 6 ms 640 KB Output is correct
45 Correct 122 ms 8156 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 276 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 67 ms 6264 KB Output is correct
50 Correct 270 ms 23160 KB Output is correct
51 Correct 257 ms 23160 KB Output is correct
52 Correct 276 ms 23032 KB Output is correct
53 Correct 111 ms 8440 KB Output is correct
54 Correct 109 ms 8184 KB Output is correct
55 Correct 264 ms 23032 KB Output is correct
56 Correct 280 ms 23032 KB Output is correct
57 Correct 112 ms 8536 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 7 ms 640 KB Output is correct
61 Correct 124 ms 8184 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Incorrect 31 ms 2432 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 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 15 ms 1408 KB Output is correct
7 Correct 274 ms 23160 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 262 ms 22108 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 131 ms 8184 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 66 ms 6264 KB Output is correct
21 Correct 267 ms 23132 KB Output is correct
22 Correct 275 ms 23112 KB Output is correct
23 Correct 273 ms 23032 KB Output is correct
24 Correct 255 ms 22392 KB Output is correct
25 Correct 108 ms 8184 KB Output is correct
26 Correct 134 ms 8184 KB Output is correct
27 Correct 285 ms 23160 KB Output is correct
28 Correct 259 ms 22392 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 256 KB Output is correct
36 Correct 11 ms 1204 KB Output is correct
37 Correct 255 ms 22136 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 12 ms 1536 KB Output is correct
41 Correct 281 ms 23132 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 0 ms 256 KB Output is correct
44 Correct 6 ms 640 KB Output is correct
45 Correct 122 ms 8156 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 0 ms 276 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 67 ms 6264 KB Output is correct
50 Correct 270 ms 23160 KB Output is correct
51 Correct 257 ms 23160 KB Output is correct
52 Correct 276 ms 23032 KB Output is correct
53 Correct 111 ms 8440 KB Output is correct
54 Correct 109 ms 8184 KB Output is correct
55 Correct 264 ms 23032 KB Output is correct
56 Correct 280 ms 23032 KB Output is correct
57 Correct 112 ms 8536 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 68 ms 6264 KB Output is correct
62 Correct 266 ms 23160 KB Output is correct
63 Correct 276 ms 23032 KB Output is correct
64 Correct 280 ms 23164 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 66 ms 6392 KB Output is correct
67 Correct 268 ms 23160 KB Output is correct
68 Correct 276 ms 23132 KB Output is correct
69 Correct 295 ms 23260 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Incorrect 28 ms 2304 KB Answer gives possible 0 while actual possible 1
74 Halted 0 ms 0 KB -