1141G - Privatization of Roads in Treeland.cpp

#include <iostream>
#include <string>
#include <utility>
#include <sstream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <unordered_set>
#include <ctime>
#include <list>

using namespace std;

template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define F0R1(i, a) for (int i=1; i<=(a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define F0Rd1(i, a) for (int i=a; i>0; i--)
#define SORT(vec) sort(vec.begin(), vec.end())
#define MIN(a, b) a = min(a, b)
#define MAX(a, b) a = max(a, b)

#define INF 1000000010
#define LL_INF 4500000000000000000
#define LSOne(S) (S & (-S))
#define EPS 1e-9
#define pA first
#define pB second
#define mp make_pair
#define pb push_back
#define PI acos(-1.0)
#define ll long long
#define MOD (int)(2e+9+11)
#define SET(vec, val, size) for (int i = 0; i < size; i++) vec[i] = val;
#define SET2D(arr, val, dim1, dim2) F0R(i, dim1) F0R(j, dim2) arr[i][j] = val;
#define SET3D(arr, val, dim1, dim2, dim3) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) arr[i][j][k] = val;
#define SET4D(arr, val, dim1, dim2, dim3, dim4) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) F0R(l, dim4) arr[i][j][k][l] = val;
#define READGRID(arr, dim) F0R(i, dim) F0R(j, dim) cin >> arr[i][j];
#define all(x) (x).begin(), (x).end()

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vl;

void setupIO(const string &PROB) {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ifstream infile(PROB + ".in");
    if (infile.good()) {
        freopen((PROB + ".in").c_str(), "r", stdin);
        freopen((PROB + ".out").c_str(), "w", stdout);
    }
}

/* ============================ */

int n, k;
vi children[200000];
int degree[200000];
bool excused[200000];
map<ii, int> ans;

void assign(int u, int bad, int parent) {
    if (excused[u]) {
        for (int v : children[u]) {
            if (v == parent) continue;
            ans[mp(u, v)] = 1;
            assign(v, 1, u);
        }
    } else {
        int thing = 1;
        for (int v : children[u]) {
            if (v == parent) continue;
            if (thing == bad) thing++;
            ans[mp(u, v)] = thing;
            assign(v, thing, u);
            thing++;
        }
    }
}

int main() {
    cin >> n >> k;
    F0R(i, n) degree[i] = 0;
    SET(excused, false, n);
    vii edges;
    F0R(i, n - 1) {
        int a, b; cin >> a >> b;
        children[--a].pb(--b);
        children[b].pb(a);
        degree[a]++;
        degree[b]++;
        edges.pb(mp(a, b));
    }
    vii degrees;
    F0R(i, n) degrees.pb(mp(degree[i], i));
    SORT(degrees);
    reverse(degrees.begin(), degrees.end());
    F0R(i, k) {
        excused[degrees[i].pB] = true;
    }
    assign(0, -1, 0);

    vi toPrint;
    int biggest = -1;
    for (ii edge : edges) {
        if (ans.count(edge)) {
            toPrint.pb(ans[edge]);
        } else {
            assert(ans.count(mp(edge.pB, edge.pA)) == 1);
            toPrint.pb(ans[mp(edge.pB, edge.pA)]);
        }
        MAX(biggest, toPrint.back());
    }
    cout << biggest << endl;
    cout << toPrint[0];
    FOR(i, 1, toPrint.size()) cout << " " << toPrint[i];
    cout << endl;

    return 0;
}