oj.uz

답안 #1089679

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089679 2024-09-16T21:09:14 Z raczek Village (BOI20_village) C++17
50 / 100
 83 ms 24568 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);
	}
//	debug(grp);
	grp.push_back({ctr});
	sort(grp.begin(), grp.end(),[&](const vector<int>& v1,const vector<int>& v2){return v1.size()<v2.size();});
//	debug(grp);
	assert(grp[0].size() <= n/2);
//	for(auto v : grp) cerr<<v.size()<<" ";
//	cout<<endl;
	int pot = grp[1].back();
	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() > 0;j++)
		{
			while(grp[i].size() > 0 && grp[j].size() > 0)
			{
				result[grp[i].back()] = grp[j].back();
				result[grp[j].back()] = grp[i].back();
				grp[i].pop_back();
				grp[j].pop_back();
			}
		}
//		cout<<grp[i].size()<<" ";
	}
//	cout<<endl;
	int k = 0;
	for(auto v : grp) k += v.size();
//	assert(k <= 1);
//	assert(grp.back().size() == 0);
	if(grp.back().size() > 0) swap(result[pot], result[grp.back()[0]]);
	//for(int i=1;i<=n;i++) assert(result[i] != i);
	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

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from Village.cpp:1:
Village.cpp: In function 'std::vector<int> MaxSolve(std::vector<std::vector<int> >)':
Village.cpp:94:23: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   94 |  assert(grp[0].size() <= n/2);
      |         ~~~~~~~~~~~~~~^~~~~~
Village.cpp:99:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |  for(int i=0;i<grp.size()-1;i++)
      |              ~^~~~~~~~~~~~~
Village.cpp:101:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |   for(int j=i+1;j<grp.size() && grp[i].size() > 0;j++)
      |                 ~^~~~~~~~~~~

Subtask #1
6.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 348 KB Partially correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 Partially correct 0 ms 348 KB Partially correct
9 Partially correct 0 ms 348 KB Partially correct
10 Partially correct 0 ms 348 KB Partially correct
11 Partially correct 0 ms 348 KB Partially correct
12 Partially correct 0 ms 348 KB Partially correct
13 Partially correct 1 ms 348 KB Partially correct
14 Correct 0 ms 348 KB Output is correct
15 Partially correct 0 ms 348 KB Partially correct
16 Partially correct 0 ms 348 KB Partially correct
17 Partially correct 0 ms 344 KB Partially correct

Subtask #2
19.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 348 KB Partially correct
2 Partially correct 1 ms 348 KB Partially correct
3 Partially correct 0 ms 348 KB Partially correct
4 Partially correct 1 ms 604 KB Partially correct
5 Partially correct 1 ms 452 KB Partially correct
6 Partially correct 1 ms 348 KB Partially correct
7 Partially correct 1 ms 604 KB Partially correct
8 Partially correct 1 ms 600 KB Partially correct
9 Partially correct 1 ms 452 KB Partially correct
10 Correct 1 ms 604 KB Output is correct
11 Partially correct 1 ms 600 KB Partially correct
12 Correct 1 ms 604 KB Output is correct
13 Partially correct 1 ms 604 KB Partially correct
14 Partially correct 1 ms 600 KB Partially correct
15 Partially correct 1 ms 604 KB Partially correct
16 Partially correct 1 ms 604 KB Partially correct
17 Partially correct 1 ms 604 KB Partially correct
18 Partially correct 1 ms 600 KB Partially correct
19 Partially correct 1 ms 600 KB Partially correct
20 Partially correct 1 ms 604 KB Partially correct
21 Partially correct 1 ms 600 KB Partially correct
22 Partially correct 1 ms 600 KB Partially correct
23 Partially correct 1 ms 460 KB Partially correct
24 Partially correct 1 ms 348 KB Partially correct
25 Partially correct 1 ms 596 KB Partially correct
26 Partially correct 1 ms 604 KB Partially correct
27 Partially correct 1 ms 348 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 Partially correct 0 ms 348 KB Partially correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 Partially correct 0 ms 348 KB Partially correct
9 Partially correct 0 ms 348 KB Partially correct
10 Partially correct 0 ms 348 KB Partially correct
11 Partially correct 0 ms 348 KB Partially correct
12 Partially correct 0 ms 348 KB Partially correct
13 Partially correct 1 ms 348 KB Partially correct
14 Correct 0 ms 348 KB Output is correct
15 Partially correct 0 ms 348 KB Partially correct
16 Partially correct 0 ms 348 KB Partially correct
17 Partially correct 0 ms 344 KB Partially correct
18 Partially correct 1 ms 348 KB Partially correct
19 Partially correct 1 ms 348 KB Partially correct
20 Partially correct 0 ms 348 KB Partially correct
21 Partially correct 1 ms 604 KB Partially correct
22 Partially correct 1 ms 452 KB Partially correct
23 Partially correct 1 ms 348 KB Partially correct
24 Partially correct 1 ms 604 KB Partially correct
25 Partially correct 1 ms 600 KB Partially correct
26 Partially correct 1 ms 452 KB Partially correct
27 Correct 1 ms 604 KB Output is correct
28 Partially correct 1 ms 600 KB Partially correct
29 Correct 1 ms 604 KB Output is correct
30 Partially correct 1 ms 604 KB Partially correct
31 Partially correct 1 ms 600 KB Partially correct
32 Partially correct 1 ms 604 KB Partially correct
33 Partially correct 1 ms 604 KB Partially correct
34 Partially correct 1 ms 604 KB Partially correct
35 Partially correct 1 ms 600 KB Partially correct
36 Partially correct 1 ms 600 KB Partially correct
37 Partially correct 1 ms 604 KB Partially correct
38 Partially correct 1 ms 600 KB Partially correct
39 Partially correct 1 ms 600 KB Partially correct
40 Partially correct 1 ms 460 KB Partially correct
41 Partially correct 1 ms 348 KB Partially correct
42 Partially correct 1 ms 596 KB Partially correct
43 Partially correct 1 ms 604 KB Partially correct
44 Partially correct 1 ms 348 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 52 ms 14320 KB Partially correct
49 Partially correct 60 ms 15816 KB Partially correct
50 Partially correct 57 ms 15596 KB Partially correct
51 Partially correct 44 ms 12240 KB Partially correct
52 Partially correct 55 ms 15424 KB Partially correct
53 Partially correct 50 ms 14052 KB Partially correct
54 Partially correct 37 ms 12152 KB Partially correct
55 Partially correct 83 ms 24568 KB Partially correct
56 Partially correct 68 ms 19988 KB Partially correct
57 Partially correct 63 ms 18236 KB Partially correct
58 Partially correct 66 ms 17088 KB Partially correct
59 Partially correct 62 ms 15640 KB Partially correct
60 Correct 65 ms 20220 KB Output is correct
61 Partially correct 53 ms 17288 KB Partially correct
62 Partially correct 51 ms 16420 KB Partially correct
63 Partially correct 51 ms 15576 KB Partially correct
64 Partially correct 75 ms 16196 KB Partially correct
65 Partially correct 58 ms 16348 KB Partially correct
66 Partially correct 57 ms 15320 KB Partially correct
67 Partially correct 39 ms 12696 KB Partially correct
68 Partially correct 42 ms 13916 KB Partially correct
69 Partially correct 48 ms 16420 KB Partially correct
70 Partially correct 46 ms 15496 KB Partially correct
71 Partially correct 36 ms 11532 KB Partially correct
72 Partially correct 50 ms 12844 KB Partially correct
73 Partially correct 59 ms 16412 KB Partially correct
74 Partially correct 58 ms 15052 KB Partially correct
75 Partially correct 64 ms 15616 KB Partially correct
76 Partially correct 55 ms 15504 KB Partially correct
77 Partially correct 53 ms 15512 KB Partially correct
78 Partially correct 36 ms 10800 KB Partially correct
79 Partially correct 42 ms 12496 KB Partially correct
80 Partially correct 68 ms 15572 KB Partially correct
81 Partially correct 52 ms 15320 KB Partially correct
82 Partially correct 49 ms 15928 KB Partially correct