oj.uz

답안 #1089648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089648 2024-09-16T20:19:32 Z raczek Village (BOI20_village) C++17
50 / 100
 89 ms 24856 KB 
#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG 
auto& operator <<(auto& o, pair<auto, auto> p) {return o<<"{"<<p.first<<", "<<p.second<<"}";}
auto& operator <<(auto& o, auto x) {o<<"{"; for(auto v : x) o<<v<<", "; return o<<"}";}
#define debug(X) cerr<<"["#X"]: "<<X<<endl;
#else
#define debug(X) {}
#endif
vector<int> MinSolve(vector<vector<int> > graph)
{
	int n = graph.size();
	vector<int> result(n+1);
	for(int i=0;i<n+1;i++) result[i] = i;
	vector<int> par(n+1);
	vector<int> deg(n+1);
	queue<int> q;
	function<void(int, int)> dfs = [&](int a, int fat)
	{
		par[a] = fat;
		for(auto v : graph[a])
			if(fat != v)
				dfs(v, a);
		deg[a] = graph[a].size();
		if(a != 1 && graph[a].size() == 1) q.push(a);
	};
	dfs(1, -1);
	while(!q.empty())
	{
		int a = q.front();
		q.pop();
		if(a == 1) continue;
		if(result[a] == a)
			swap(result[a], result[par[a]]), result[0]+=2;
		deg[par[a]]--;
		if(deg[par[a]] == 1) q.push(par[a]);
	}
	if(result[1] == 1)
	{
		result[0] += 2;
		swap(result[graph[1][0]], result[1]);
	}
	return result;
}
vector<int> MaxSolve(vector<vector<int> > graph)
{
	int n = graph.size()-1;
	vector<int> Sz(n+1);
	vector<int> result(n+1);
	function<void(int, int)> getSz = [&](int a, int par)
	{
		Sz[a] = 1;
		for(auto v : graph[a])
			if(v != par)
			{
				getSz(v, a);
				Sz[a] += Sz[v];
				result[0] += Sz[v] * 2;
			}
	};
	getSz(1, -1);
	debug(Sz);
	debug(n/2);
	function<int(int, int)> getCtr = [&](int a, int par)
	{
		debug(a);
		for(auto v : graph[a])
			if(v != par)
				if(Sz[v] > n/2)
					return getCtr(v, a);
		return a;
	};
	int ctr = getCtr(1, -1);
	debug(ctr);
	result[0] = 0;
	getSz(ctr, -1);
	vector<vector<int> > grp;
	function<void(int, int)> dfs = [&](int a, int par)
	{
		grp.back().push_back(a);
		for(auto v : graph[a])
			if(v != par)
				dfs(v, a);
	};
	for(auto v : graph[ctr])
	{
		grp.push_back({});
		dfs(v, ctr);
	}
	sort(grp.begin(), grp.end(),[&](vector<int> v1,vector<int> v2){return v1.size()>v2.size();});
	grp.back().push_back(ctr);
	debug(grp);
	int pot = grp[0][0];
	for(int i=1;i<=n;i++) result[i] = i;
	for(int i=0;i<grp.size()-1;i++)
	{
		for(int j=i+1;j<grp.size() && grp[i].size();j++)
			while(grp[i].size() && grp[j].size())
			{
				result[grp[i].back()] = grp[j].back();
				result[grp[j].back()] = grp[i].back();
				grp[i].pop_back();
				grp[j].pop_back();
			}
	}
	if(grp.back().size() > 0) swap(result[pot], result[grp.back()[0]]);
	return result;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	vector<vector<int> > graph(n+1);
	for(int i=0;i<n-1;i++)
	{
		int a, b;
		cin>>a>>b;
		graph[a].push_back(b);
		graph[b].push_back(a);
	}
	vector<int> minn = MinSolve(graph);
	vector<int> maxx = MaxSolve(graph);
	cout<<minn[0]<<" "<<maxx[0]<<"\n";
	for(int i=1;i<=n;i++) cout<<minn[i]<<" ";
	cout<<"\n";
	for(int i=1;i<=n;i++) cout<<maxx[i]<<" ";
}

Compilation message

Village.cpp: In function 'std::vector<int> MaxSolve(std::vector<std::vector<int> >)':
Village.cpp:95:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |  for(int i=0;i<grp.size()-1;i++)
      |              ~^~~~~~~~~~~~~
Village.cpp:97:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |   for(int j=i+1;j<grp.size() && grp[i].size();j++)
      |                 ~^~~~~~~~~~~

Subtask #1
6.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Partially correct 0 ms 344 KB Partially correct
4 Correct 0 ms 348 KB Output is correct
5 Partially correct 0 ms 348 KB Partially correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Partially correct 0 ms 348 KB Partially correct
11 Correct 0 ms 356 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 0 ms 348 KB Partially correct
15 Partially correct 0 ms 344 KB Partially correct
16 Partially correct 0 ms 348 KB Partially correct
17 Partially correct 0 ms 348 KB Partially correct

Subtask #2
19.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 348 KB Partially correct
2 Partially correct 0 ms 348 KB Partially correct
3 Correct 1 ms 348 KB Output is correct
4 Partially correct 1 ms 604 KB Partially correct
5 Partially correct 1 ms 604 KB Partially correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Partially correct 1 ms 348 KB Partially correct
10 Partially correct 1 ms 604 KB Partially correct
11 Partially correct 1 ms 604 KB Partially correct
12 Partially correct 1 ms 604 KB Partially correct
13 Correct 1 ms 604 KB Output is correct
14 Partially correct 1 ms 604 KB Partially correct
15 Partially correct 1 ms 604 KB Partially correct
16 Partially correct 1 ms 604 KB Partially correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Partially correct 1 ms 604 KB Partially correct
20 Partially correct 1 ms 604 KB Partially correct
21 Partially correct 1 ms 604 KB Partially correct
22 Correct 1 ms 604 KB Output is correct
23 Partially correct 1 ms 460 KB Partially correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Partially correct 1 ms 348 KB Partially correct
27 Partially correct 0 ms 452 KB Partially correct
28 Partially correct 1 ms 604 KB Partially correct
29 Partially correct 1 ms 604 KB Partially correct
30 Partially correct 1 ms 604 KB Partially correct

Subtask #3
25.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Partially correct 0 ms 344 KB Partially correct
4 Correct 0 ms 348 KB Output is correct
5 Partially correct 0 ms 348 KB Partially correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Partially correct 0 ms 348 KB Partially correct
11 Correct 0 ms 356 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 0 ms 348 KB Partially correct
15 Partially correct 0 ms 344 KB Partially correct
16 Partially correct 0 ms 348 KB Partially correct
17 Partially correct 0 ms 348 KB Partially correct
18 Partially correct 1 ms 348 KB Partially correct
19 Partially correct 0 ms 348 KB Partially correct
20 Correct 1 ms 348 KB Output is correct
21 Partially correct 1 ms 604 KB Partially correct
22 Partially correct 1 ms 604 KB Partially correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Partially correct 1 ms 348 KB Partially correct
27 Partially correct 1 ms 604 KB Partially correct
28 Partially correct 1 ms 604 KB Partially correct
29 Partially correct 1 ms 604 KB Partially correct
30 Correct 1 ms 604 KB Output is correct
31 Partially correct 1 ms 604 KB Partially correct
32 Partially correct 1 ms 604 KB Partially correct
33 Partially correct 1 ms 604 KB Partially correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Partially correct 1 ms 604 KB Partially correct
37 Partially correct 1 ms 604 KB Partially correct
38 Partially correct 1 ms 604 KB Partially correct
39 Correct 1 ms 604 KB Output is correct
40 Partially correct 1 ms 460 KB Partially correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Partially correct 1 ms 348 KB Partially correct
44 Partially correct 0 ms 452 KB Partially correct
45 Partially correct 1 ms 604 KB Partially correct
46 Partially correct 1 ms 604 KB Partially correct
47 Partially correct 1 ms 604 KB Partially correct
48 Partially correct 62 ms 14548 KB Partially correct
49 Correct 61 ms 15820 KB Output is correct
50 Partially correct 60 ms 15768 KB Partially correct
51 Correct 44 ms 12500 KB Output is correct
52 Correct 58 ms 15352 KB Output is correct
53 Partially correct 50 ms 14196 KB Partially correct
54 Correct 33 ms 12344 KB Output is correct
55 Partially correct 75 ms 24856 KB Partially correct
56 Partially correct 66 ms 19992 KB Partially correct
57 Partially correct 64 ms 18492 KB Partially correct
58 Partially correct 64 ms 17500 KB Partially correct
59 Partially correct 56 ms 15896 KB Partially correct
60 Partially correct 89 ms 20232 KB Partially correct
61 Partially correct 56 ms 17412 KB Partially correct
62 Partially correct 57 ms 16672 KB Partially correct
63 Correct 51 ms 15736 KB Output is correct
64 Partially correct 57 ms 16092 KB Partially correct
65 Partially correct 53 ms 16640 KB Partially correct
66 Correct 47 ms 15640 KB Output is correct
67 Partially correct 46 ms 12848 KB Partially correct
68 Correct 43 ms 14004 KB Output is correct
69 Partially correct 57 ms 16668 KB Partially correct
70 Partially correct 54 ms 15616 KB Partially correct
71 Partially correct 35 ms 11668 KB Partially correct
72 Correct 38 ms 13044 KB Output is correct
73 Correct 49 ms 16496 KB Output is correct
74 Correct 46 ms 15040 KB Output is correct
75 Partially correct 57 ms 15640 KB Partially correct
76 Partially correct 64 ms 15516 KB Partially correct
77 Partially correct 61 ms 15400 KB Partially correct
78 Partially correct 36 ms 10788 KB Partially correct
79 Partially correct 40 ms 12496 KB Partially correct
80 Partially correct 64 ms 15664 KB Partially correct
81 Partially correct 50 ms 15324 KB Partially correct
82 Partially correct 53 ms 16184 KB Partially correct