oj.uz

답안 #832312

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832312 2023-08-21T08:47:02 Z Johann 슈퍼트리 잇기 (IOI20_supertrees) C++14
96 / 100
 229 ms 23928 KB 
#include "supertrees.h"
#include "bits/stdc++.h"
using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

int construct(std::vector<std::vector<int>> p)
{
	int N = p.size();
	vi comp(N, -1);

	vvi ans(N, vi(N, 0));
	for (int v = 0; v < N; ++v)
	{
		if (comp[v] == -1)
		{
			vvi c(4);
			comp[v] = v;
			for (int u = 0; u < N; ++u)
			{
				if (p[v][u] == 0 || u == v)
					continue;
				if (comp[u] != -1)
					return 0;
				comp[u] = v;
				c[p[v][u]].push_back(u);
			}

			if (sz(c[2]) && sz(c[3]))
				return 0;

			for (int u : c[1])
			{
				ans[v][u] = ans[u][v] = 1;
				for (int w = 0; w < N; ++w)
					if (comp[w] != comp[u] && p[u][w] > 0)
						return 0;
				for (int w : c[1])
					if (p[u][w] != 1)
						return 0;
				for (int w : c[2])
					if (p[u][w] != 2)
						return 0;
				for (int w : c[3])
					if (p[u][w] != 3)
						return 0;
			}

			if (!c[2].empty())
			{
				for (int u : c[2])
					for (int w = 0; w < N; ++w)
						if (comp[w] != comp[u] && p[u][w] > 0)
							return 0;

				int last = v;
				vi belongs(sz(c[2]), -1);
				for (int i = 0; i < sz(c[2]); ++i)
				{
					int u = c[2][i];
					if (belongs[i] == -1)
					{
						ans[last][u] = ans[u][last] = 1;
						last = u;
						belongs[i] = u;
					}
					for (int j = i + 1; j < sz(c[2]); ++j)
					{
						int w = c[2][j];
						if (p[u][w] == 1)
						{
							if (belongs[j] != -1)
							{
								if (belongs[j] != belongs[i])
									return 0;
							}
							else
							{
								belongs[j] = belongs[i];
								ans[w][u] = ans[u][w] = 1;
							}
						}
						else if (p[u][w] == 2)
						{
							if (belongs[i] == belongs[j])
								return 0;
						}
						else
							return 0;
					}
				}
				if (ans[v][last])
					return 0;
				ans[v][last] = ans[last][v] = 1;
			}

			if (!c[3].empty())
			{
				for (int u : c[3])
					for (int w = 0; w < N; ++w)
						if (comp[w] != comp[u] && p[u][w] > 0)
							return 0;

				vi cycle;
				cycle.push_back(v);
				vi belongs(sz(c[3]), -1);
				for (int i = 0; i < sz(c[3]); ++i)
				{
					int u = c[3][i];
					if (belongs[i] == -1)
					{
						cycle.push_back(u);
						belongs[i] = u;
					}
					for (int j = i + 1; j < sz(c[3]); ++j)
					{
						int w = c[3][j];
						if (p[u][w] == 1)
						{
							if (belongs[j] != -1)
							{
								if (belongs[j] != belongs[i])
									return 0;
							}
							else
							{
								belongs[j] = belongs[i];
								ans[w][u] = ans[u][w] = 1;
							}
						}
						else if (p[u][w] == 3)
						{
							if (belongs[i] == belongs[j])
								return 0;
						}
						else
							return 0;
					}
				}
				cycle.push_back(v);
				if (sz(cycle) < 5)
					return 0;
				for (int i = 0; i < sz(cycle) - 1; ++i)
					ans[cycle[i]][cycle[i + 1]] = ans[cycle[i + 1]][cycle[i]] = 1;
				ans[cycle[0]][cycle[2]] = ans[cycle[2]][cycle[0]] = 1;
			}
		}
	}

	build(ans);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 212 KB Output is correct
6 Correct 6 ms 1108 KB Output is correct
7 Correct 148 ms 22036 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 212 KB Output is correct
6 Correct 6 ms 1108 KB Output is correct
7 Correct 148 ms 22036 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
12 Correct 6 ms 1160 KB Output is correct
13 Correct 146 ms 22020 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 64 ms 12040 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 37 ms 5708 KB Output is correct
21 Correct 147 ms 21964 KB Output is correct
22 Correct 149 ms 21932 KB Output is correct
23 Correct 229 ms 21936 KB Output is correct
24 Correct 152 ms 21944 KB Output is correct
25 Correct 60 ms 12036 KB Output is correct
26 Correct 62 ms 12036 KB Output is correct
27 Correct 187 ms 22028 KB Output is correct
28 Correct 170 ms 22032 KB Output is correct

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 7 ms 1108 KB Output is correct
9 Correct 158 ms 21992 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 6 ms 1184 KB Output is correct
13 Correct 149 ms 22040 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 68 ms 12036 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 37 ms 5680 KB Output is correct
22 Correct 160 ms 21996 KB Output is correct
23 Correct 153 ms 21928 KB Output is correct
24 Correct 155 ms 22020 KB Output is correct
25 Correct 59 ms 12036 KB Output is correct
26 Correct 71 ms 12036 KB Output is correct
27 Correct 149 ms 22016 KB Output is correct
28 Correct 151 ms 22000 KB Output is correct
29 Correct 60 ms 12040 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 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 44 ms 5752 KB Output is correct
5 Correct 161 ms 22028 KB Output is correct
6 Correct 152 ms 22148 KB Output is correct
7 Correct 219 ms 22020 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 37 ms 5772 KB Output is correct
10 Correct 153 ms 22020 KB Output is correct
11 Correct 148 ms 22028 KB Output is correct
12 Correct 153 ms 22004 KB Output is correct
13 Correct 0 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 38 ms 5696 KB Output is correct
17 Correct 149 ms 21960 KB Output is correct
18 Correct 151 ms 22024 KB Output is correct
19 Correct 166 ms 21932 KB Output is correct
20 Correct 175 ms 22100 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 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 212 KB Output is correct
6 Correct 6 ms 1108 KB Output is correct
7 Correct 148 ms 22036 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
12 Correct 6 ms 1160 KB Output is correct
13 Correct 146 ms 22020 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 64 ms 12040 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 37 ms 5708 KB Output is correct
21 Correct 147 ms 21964 KB Output is correct
22 Correct 149 ms 21932 KB Output is correct
23 Correct 229 ms 21936 KB Output is correct
24 Correct 152 ms 21944 KB Output is correct
25 Correct 60 ms 12036 KB Output is correct
26 Correct 62 ms 12036 KB Output is correct
27 Correct 187 ms 22028 KB Output is correct
28 Correct 170 ms 22032 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 158 ms 21992 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 6 ms 1184 KB Output is correct
41 Correct 149 ms 22040 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 68 ms 12036 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 37 ms 5680 KB Output is correct
50 Correct 160 ms 21996 KB Output is correct
51 Correct 153 ms 21928 KB Output is correct
52 Correct 155 ms 22020 KB Output is correct
53 Correct 59 ms 12036 KB Output is correct
54 Correct 71 ms 12036 KB Output is correct
55 Correct 149 ms 22016 KB Output is correct
56 Correct 151 ms 22000 KB Output is correct
57 Correct 60 ms 12040 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 3 ms 724 KB Output is correct
61 Correct 62 ms 12048 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 37 ms 5756 KB Output is correct
66 Correct 65 ms 12044 KB Output is correct
67 Correct 60 ms 12036 KB Output is correct
68 Correct 60 ms 12048 KB Output is correct
69 Correct 64 ms 12032 KB Output is correct

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 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 212 KB Output is correct
6 Correct 6 ms 1108 KB Output is correct
7 Correct 148 ms 22036 KB Output is correct
8 Correct 0 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 0 ms 212 KB Output is correct
12 Correct 6 ms 1160 KB Output is correct
13 Correct 146 ms 22020 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 64 ms 12040 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 37 ms 5708 KB Output is correct
21 Correct 147 ms 21964 KB Output is correct
22 Correct 149 ms 21932 KB Output is correct
23 Correct 229 ms 21936 KB Output is correct
24 Correct 152 ms 21944 KB Output is correct
25 Correct 60 ms 12036 KB Output is correct
26 Correct 62 ms 12036 KB Output is correct
27 Correct 187 ms 22028 KB Output is correct
28 Correct 170 ms 22032 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 7 ms 1108 KB Output is correct
37 Correct 158 ms 21992 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 6 ms 1184 KB Output is correct
41 Correct 149 ms 22040 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 68 ms 12036 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 37 ms 5680 KB Output is correct
50 Correct 160 ms 21996 KB Output is correct
51 Correct 153 ms 21928 KB Output is correct
52 Correct 155 ms 22020 KB Output is correct
53 Correct 59 ms 12036 KB Output is correct
54 Correct 71 ms 12036 KB Output is correct
55 Correct 149 ms 22016 KB Output is correct
56 Correct 151 ms 22000 KB Output is correct
57 Correct 60 ms 12040 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 44 ms 5752 KB Output is correct
62 Correct 161 ms 22028 KB Output is correct
63 Correct 152 ms 22148 KB Output is correct
64 Correct 219 ms 22020 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 37 ms 5772 KB Output is correct
67 Correct 153 ms 22020 KB Output is correct
68 Correct 148 ms 22028 KB Output is correct
69 Correct 153 ms 22004 KB Output is correct
70 Correct 0 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 38 ms 5696 KB Output is correct
74 Correct 149 ms 21960 KB Output is correct
75 Correct 151 ms 22024 KB Output is correct
76 Correct 166 ms 21932 KB Output is correct
77 Correct 175 ms 22100 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 1 ms 212 KB Output is correct
80 Correct 3 ms 724 KB Output is correct
81 Correct 62 ms 12048 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 37 ms 5756 KB Output is correct
86 Correct 65 ms 12044 KB Output is correct
87 Correct 60 ms 12036 KB Output is correct
88 Correct 60 ms 12048 KB Output is correct
89 Correct 64 ms 12032 KB Output is correct
90 Correct 0 ms 212 KB Output is correct
91 Correct 0 ms 212 KB Output is correct
92 Correct 3 ms 720 KB Output is correct
93 Correct 67 ms 12032 KB Output is correct
94 Correct 0 ms 212 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 15 ms 3288 KB Output is correct
98 Correct 76 ms 12044 KB Output is correct
99 Correct 84 ms 12032 KB Output is correct
100 Correct 60 ms 12048 KB Output is correct
101 Correct 58 ms 12044 KB Output is correct
102 Incorrect 159 ms 23928 KB Answer gives possible 1 while actual possible 0
103 Halted 0 ms 0 KB -