oj.uz

Submission #1089629

# Submission time Handle Problem Language Result Execution time Memory
1089629 2024-09-16T19:33:19 Z raczek Village (BOI20_village) C++17
0 / 100
 1 ms 860 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(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;
}
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> result = MinSolve(graph);
	cout<<result[0]<<" "<<0<<"\n";
	for(int i=1;i<=n;i++) cout<<result[i]<<" ";
	cout<<"\n";
	for(;n--;) cout<<1<<" ";
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB Partially correct
2 Partially correct 0 ms 348 KB Partially correct
3 Partially correct 0 ms 348 KB Partially correct
4 Runtime error 1 ms 604 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Partially correct
2 Partially correct 0 ms 452 KB Partially correct
3 Partially correct 0 ms 348 KB Partially correct
4 Partially correct 1 ms 348 KB Partially correct
5 Runtime error 1 ms 860 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 50.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 344 KB Partially correct
2 Partially correct 0 ms 348 KB Partially correct
3 Partially correct 0 ms 348 KB Partially correct
4 Runtime error 1 ms 604 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -