Codecraft-17 and Codeforces Round #391 (Div. 1 + Div. 2, combined), problem: (G) Can Bash Save the Day? Solution in C/C++
#include<bits/stdc++.h> #define N 200100 using namespace std; int sz; vector<int> g,w; int loc,dep,tloc,td; long long len; bool del; void build(int u, int p, int ly, long long d){ sz=1; len=d; for(int i=0;i<g.size();i++){ int v=g; if(v==p||del) …