oj.uz

답안 #1032921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1032921 2024-07-24T10:53:50 Z fv3 슈퍼트리 잇기 (IOI20_supertrees) C++14
56 / 100
 140 ms 32004 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

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

	for (int i = 0; i < n; i++)
		p[i].push_back(i);
	sort(p.begin(), p.end());

	// 1. Find all parts which are the same
	vector<vector<int>> parts = { {p[0].back()} };
	map<vector<int>, vector<pair<int, int>>> cycles;

	int l = 0, r = 1;
	while (r < n)
	{
		int i = 0;
		for (; i < n; i++)
		{
			if (p[r-1][i] != p[r][i])
				break;
		}

		if (i != n)
		{
			parts.push_back({p[r].back()});

			// Count 1's in last part
			int one_cnt = 0;
			for (int j = 0; j < n; j++)
			{
				if (p[r-1][j] == 1)
					one_cnt++;
			}

			if (one_cnt != r - l)
				return 0;

			vector<int> bs(n);
			for (int j = 0; j < n; j++)
			{
				if (p[r-1][j]) 
					bs[j] = 1;
			}

			cycles[bs].push_back({p[r-1].back(), parts[parts.size()-2].size()});
			l = r;
		}
		else
		{
			parts.back().push_back(p[r].back());
		}

		r++;
	}

	// Count 1's in last part
	int one_cnt = 0;
	for (int j = 0; j < n; j++)
	{
		if (p[r-1][j] == 1)
			one_cnt++;
	}

	if (one_cnt != r - l)
		return 0;

	vector<int> bs(n);
	for (int j = 0; j < n; j++)
	{
		if (p[r-1][j]) 
			bs[j] = 1;
	}
	cycles[bs].push_back({p[r-1].back(), parts[parts.size()-1].size()});

	// 2. Generate parts
	vector<vector<int>> answer(n, vector<int>(n));
	for (auto path : parts)
	{
		for (int i = 1; i < path.size(); i++)
		{
			answer[path[i]][path[i-1]] = 1;
			answer[path[i-1]][path[i]] = 1;
		}
	}

	// 3. Generate cycles
	for (auto cycle : cycles)
	{
		if (cycle.second.size() == 1)
			continue;

		if (cycle.second.size() == 2)
			return 0;

		int cyclesize = 0;
		for (auto e : cycle.first)
			if (e) cyclesize++;

		int realsize = 0;
		for (auto e : cycle.second)
		{
			realsize += e.second;
		}

		if (cyclesize != realsize)
			return 0;

		for (auto e : cycle.second)
			cerr << e.first << ' ';
		cerr << '\n';

		for (int i = 1; i < cycle.second.size(); i++)
		{
			answer[cycle.second[i].first][cycle.second[i-1].first] = 1;
			answer[cycle.second[i-1].first][cycle.second[i].first] = 1;
		}
		answer[cycle.second[0].first][cycle.second.back().first] = 1;
		answer[cycle.second.back().first][cycle.second[0].first] = 1;
	}

	// 4. Profit
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:84:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |   for (int i = 1; i < path.size(); i++)
      |                   ~~^~~~~~~~~~~~~
supertrees.cpp:117:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |   for (int i = 1; i < cycle.second.size(); i++)
      |                   ~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.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 0 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 5 ms 1444 KB Output is correct
7 Correct 121 ms 27988 KB Output is correct

Subtask #2
10.0 / 10.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 0 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 5 ms 1444 KB Output is correct
7 Correct 121 ms 27988 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 5 ms 1628 KB Output is correct
13 Correct 124 ms 32004 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 58 ms 14168 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 7432 KB Output is correct
21 Correct 127 ms 28240 KB Output is correct
22 Correct 132 ms 29708 KB Output is correct
23 Correct 121 ms 28024 KB Output is correct
24 Correct 129 ms 31824 KB Output is correct
25 Correct 55 ms 14164 KB Output is correct
26 Correct 54 ms 14672 KB Output is correct
27 Correct 126 ms 27984 KB Output is correct
28 Correct 132 ms 31828 KB Output is correct

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 ms 348 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 0 ms 348 KB Output is correct
8 Correct 5 ms 1628 KB Output is correct
9 Correct 129 ms 31988 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 1476 KB Output is correct
13 Correct 138 ms 27984 KB Output is correct
14 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

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 1 ms 344 KB Output is correct
4 Correct 31 ms 7300 KB Output is correct
5 Correct 128 ms 28036 KB Output is correct
6 Correct 119 ms 29684 KB Output is correct
7 Correct 133 ms 28040 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 44 ms 7508 KB Output is correct
10 Correct 123 ms 28168 KB Output is correct
11 Correct 121 ms 28756 KB Output is correct
12 Correct 130 ms 27984 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 31 ms 7452 KB Output is correct
17 Correct 123 ms 28044 KB Output is correct
18 Correct 118 ms 27984 KB Output is correct
19 Correct 140 ms 28280 KB Output is correct
20 Correct 125 ms 31828 KB Output is correct

Subtask #5
0 / 21.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 0 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 5 ms 1444 KB Output is correct
7 Correct 121 ms 27988 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 5 ms 1628 KB Output is correct
13 Correct 124 ms 32004 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 58 ms 14168 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 7432 KB Output is correct
21 Correct 127 ms 28240 KB Output is correct
22 Correct 132 ms 29708 KB Output is correct
23 Correct 121 ms 28024 KB Output is correct
24 Correct 129 ms 31824 KB Output is correct
25 Correct 55 ms 14164 KB Output is correct
26 Correct 54 ms 14672 KB Output is correct
27 Correct 126 ms 27984 KB Output is correct
28 Correct 132 ms 31828 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 436 KB Output is correct
31 Correct 0 ms 348 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 0 ms 348 KB Output is correct
36 Correct 5 ms 1628 KB Output is correct
37 Correct 129 ms 31988 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 1476 KB Output is correct
41 Correct 138 ms 27984 KB Output is correct
42 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 0 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 5 ms 1444 KB Output is correct
7 Correct 121 ms 27988 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 5 ms 1628 KB Output is correct
13 Correct 124 ms 32004 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 58 ms 14168 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 30 ms 7432 KB Output is correct
21 Correct 127 ms 28240 KB Output is correct
22 Correct 132 ms 29708 KB Output is correct
23 Correct 121 ms 28024 KB Output is correct
24 Correct 129 ms 31824 KB Output is correct
25 Correct 55 ms 14164 KB Output is correct
26 Correct 54 ms 14672 KB Output is correct
27 Correct 126 ms 27984 KB Output is correct
28 Correct 132 ms 31828 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 436 KB Output is correct
31 Correct 0 ms 348 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 0 ms 348 KB Output is correct
36 Correct 5 ms 1628 KB Output is correct
37 Correct 129 ms 31988 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 6 ms 1476 KB Output is correct
41 Correct 138 ms 27984 KB Output is correct
42 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
43 Halted 0 ms 0 KB -