Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals

C题思路：生成树上的dfs，完全没见过，留作复习

代码：

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<queue>
#include<string>
#include<vector>
#define maxn 210000
using namespace std;
int n;
vector<int>aaa[maxn];
int power[maxn];
int color[maxn];void dfs(int x, int fa) {   //对第x个节点的子节点们开始染色，x的父节点是fAint c = 1;for (int i = 0; i < aaa[x].size(); i++) {int temp = aaa[x][i];if (color[temp] != 0)continue;while (c == color[x] || c == color[fa])c++;color[temp] = c;dfs(temp, x);c++;}
}int ans;
int main() {memset(color, 0, sizeof(color));memset(power, 0, sizeof(power));ans = 0;scanf("%d", &n);int a, b;for (int i = 1; i < n; i++) {scanf("%d %d", &a, &b);power[a]++; power[b]++;ans = max(ans, max(power[a], power[b]));aaa[a].push_back(b);aaa[b].push_back(a);}ans++;cout << ans << endl;dfs(1, 0);for (int i = 1; i <= n; i++) {if (i != 1)printf(" ");printf("%d", color[i]);}printf("\n");
}

转载于:https://www.cnblogs.com/Drenight/p/8611331.html

Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals相关推荐

Codeforces Round #403 (Div. 1, based on Technocup 2017 Finals)
Div1单场我从来就没上过分,这场又剧毒,半天才打出B,C挂了好几次最后还FST了,回紫了. AC:AB Rank:340 Rating:2204-71->2133 Div2.B.The Mee ...
Codeforces Round #528 (Div. 2, based on Technocup 2019 Elimination Round 4) C. Connect Three 【模拟】...
传送门:http://codeforces.com/contest/1087/problem/C C. Connect Three time limit per test 1 second memor ...
Codeforces Round #709 (Div. 2, based on Technocup 2021 Final Round) 题解
文章目录 A. Prison Break B. Restore Modulo C. Basic Diplomacy D. Playlist E. Skyline Photo F. Useful Edg ...
Codeforces Round #625 (Div. 2, based on Technocup 2020 Final Round)【A、B、C题】
A. Contest for Robots 签到题,注意特判即可. #include <bits/stdc++.h> using namespace std; const int N=11 ...
szu cf套题训练Codeforces Round #602 (Div. 2, based on Technocup 2020 Elimination Round 3)A~D题解报告
A. Math Problem 题目大意:就是给你n个线段,你自己再添加一个线段d使得d和所有的线段都有交点,求d这个线段的最小长度是多少解题思路: 1.首先看d线段的左端点,就是左端点选取的是所有 ...
Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2)
一场挺简单的CF,但是我打炸了啊 A. Search for Pretty Integers time limit per test 1 second memory limit per test 25 ...
Codeforces Round #606 (Div. 2, based on Technocup 2020 Elimination Round 4) 构造
传送门文章目录题意: 思路: 题意: 给nnn个数,让你构造一个尽可能大的矩阵,其中每个点所在的行和列都不含相等元素. 思路: 假设构造的答案矩阵大小为a×ba×ba×b且a<=ba< ...
Codeforces Round #606 (Div. 2, based on Technocup 2020 Elimination Round 4) dfs + 思维
传送门文章目录题意: 思路: 题意: 给一张图,求必须经过aaa点和bbb点的路径条数. 思路: 通过观察我们发现,这个路径无非就是x−>a−>b−>yx->a->b ...
Codeforces Round #709 (Div. 1, based on Technocup 2021 Final Round) A. Basic Diplomacy
传送门文章目录题意: 思路: 题意: 有nnn个小朋友,让后你要在mmm天中每天都选择一个小朋友,给出这mmm天都可以选哪个小朋友,每个小朋友选的次数不超过⌈m2⌉\left \lceil \fr ...

Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals

Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals相关推荐

最新文章

热门文章