답안 #1032878

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1032878	2024-07-24T10:18:08 Z	fv3	슈퍼트리 잇기 (IOI20_supertrees)	C++14	21 / 100	135 ms	31940 KB

supertrees

#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<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(r-1);
			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(r-1);

	// 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

	// 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++)
      |                   ~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	428 KB	Output is correct
4	Correct	0 ms	356 KB	Output is correct
5	Correct	0 ms	356 KB	Output is correct
6	Correct	5 ms	1372 KB	Output is correct
7	Correct	125 ms	27252 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	428 KB	Output is correct
4	Correct	0 ms	356 KB	Output is correct
5	Correct	0 ms	356 KB	Output is correct
6	Correct	5 ms	1372 KB	Output is correct
7	Correct	125 ms	27252 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	352 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	5 ms	1632 KB	Output is correct
13	Correct	122 ms	31504 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	356 KB	Output is correct
16	Correct	3 ms	864 KB	Output is correct
17	Correct	56 ms	14084 KB	Output is correct
18	Correct	0 ms	356 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	30 ms	7556 KB	Output is correct
21	Correct	131 ms	28040 KB	Output is correct
22	Correct	118 ms	29520 KB	Output is correct
23	Correct	127 ms	28040 KB	Output is correct
24	Correct	135 ms	31824 KB	Output is correct
25	Correct	57 ms	14072 KB	Output is correct
26	Correct	53 ms	14776 KB	Output is correct
27	Correct	126 ms	28040 KB	Output is correct
28	Correct	122 ms	31940 KB	Output is correct

Subtask #3
0 / 19.0

#	결과	메모리	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Incorrect	600 KB	Answer gives possible 1 while actual possible 0
5	Halted	0 KB	-

Subtask #4
0 / 35.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Incorrect	372 KB	Too few ways to get from 0 to 1, should be 2 found 0
3	Halted	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	428 KB	Output is correct
4	Correct	0 ms	356 KB	Output is correct
5	Correct	0 ms	356 KB	Output is correct
6	Correct	5 ms	1372 KB	Output is correct
7	Correct	125 ms	27252 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	352 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	5 ms	1632 KB	Output is correct
13	Correct	122 ms	31504 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	356 KB	Output is correct
16	Correct	3 ms	864 KB	Output is correct
17	Correct	56 ms	14084 KB	Output is correct
18	Correct	0 ms	356 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	30 ms	7556 KB	Output is correct
21	Correct	131 ms	28040 KB	Output is correct
22	Correct	118 ms	29520 KB	Output is correct
23	Correct	127 ms	28040 KB	Output is correct
24	Correct	135 ms	31824 KB	Output is correct
25	Correct	57 ms	14072 KB	Output is correct
26	Correct	53 ms	14776 KB	Output is correct
27	Correct	126 ms	28040 KB	Output is correct
28	Correct	122 ms	31940 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	348 KB	Output is correct
32	Incorrect	0 ms	600 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Subtask #6
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	428 KB	Output is correct
4	Correct	0 ms	356 KB	Output is correct
5	Correct	0 ms	356 KB	Output is correct
6	Correct	5 ms	1372 KB	Output is correct
7	Correct	125 ms	27252 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	352 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	5 ms	1632 KB	Output is correct
13	Correct	122 ms	31504 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	356 KB	Output is correct
16	Correct	3 ms	864 KB	Output is correct
17	Correct	56 ms	14084 KB	Output is correct
18	Correct	0 ms	356 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	30 ms	7556 KB	Output is correct
21	Correct	131 ms	28040 KB	Output is correct
22	Correct	118 ms	29520 KB	Output is correct
23	Correct	127 ms	28040 KB	Output is correct
24	Correct	135 ms	31824 KB	Output is correct
25	Correct	57 ms	14072 KB	Output is correct
26	Correct	53 ms	14776 KB	Output is correct
27	Correct	126 ms	28040 KB	Output is correct
28	Correct	122 ms	31940 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	348 KB	Output is correct
32	Incorrect	0 ms	600 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

답안 #1032878

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 19.0

Subtask #4 0 / 35.0

Subtask #5 0 / 21.0

Subtask #6 0 / 4.0

Subtask #1
11.0 / 11.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 19.0

Subtask #4
0 / 35.0

Subtask #5
0 / 21.0

Subtask #6
0 / 4.0