G. Privatization of Roads in Treeland

http://codeforces.com/contest/1141/problem/G

题意：给树染色，一个节点为坏点是多与两条边颜色相同，在最多k个坏点下，问最少的使用颜色种类；

思路：度数越大必然先是坏点，所以选度数最大的前k个当

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);endl '\n'
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=998244353;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}

int D;
int n,k;
int d[maxn],col[maxn];
vector<pair<int,int> >g[maxn];
void dfs(int u,int fa,int c)
{
    for(int i=0;i<g[u].size();i++)
    {
        int v=g[u][i].first;
        int id=g[u][i].second;
        if(v==fa) continue;
        col[id]=c;
        c=(c+1)%D;
        dfs(v,u,c);

    }
}
int main()
{
    cin>>n>>k;
    for(int i=1;i<n;i++)
    {
        int u,v;
        cin>>u>>v;
        g[u].push_back({v,i});
        g[v].push_back({u,i});
        d[v]++;
        d[u]++;
    }
    sort(d+1,d+1+n);
    reverse(d+1,d+1+n);
    D=d[k+1];
    dfs(1,0,0);
    cout<<D<<endl;
    for(int i=1;i<n;i++)
    {
        cout<<col[i]+1<<" ";
    }
    return 0;
}

坏点，需要的颜色就越少；dfs保证相邻边不同色瞎染即可；