problem: (D) Labelling Cities Solution In C/C++ Archive

Tinkoff Challenge – Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2), problem: (D) Labelling Cities Solution In C/C++

Tinkoff Challenge – Final Round (Codeforces Round #414, rated, Div. 1 + Div. 2), problem: (D) Labelling Cities Solution In C/C++

#include<bits/stdc++.h> #define MAXN 300100 using namespace std; struct node{int y,next;}e; int n,m,len,Link,p,hash,col,vis,used; inline int read(){ int x=0,f=1; char ch=getchar(); while(!isdigit(ch)) {if(ch==’-‘) f=-1; ch=getchar();} while(isdigit(ch)) {x=x*10+ch-‘0’; ch=getchar();} return x*f; } void insert(int x,int y){e.next=Link;Link=len;e.y=y;} void dfs(int …