To be an ACMan

View Code #include<stdio.h>#include<string.h>#include<algorithm>using namespace std;const int maxn = 20003;struct node{ int v, next, w;}edge[maxn<<1];int tot;int head[maxn];int n;void init(){ tot = 0; memset(head, -1, sizeof(int) * (n+1));}void add(int x, int y){ edge[tot].v Read More