Codeforces Round #436 (Div. 2), problem: (F) Cities Excursions Solution In C/C++
#include<cstdio> #include<algorithm> #include<cstring> using namespace std; const int N = 3005, INF = 0x3f3f3f3f; int n, m, q, f; bool vis; struct Edge { int to; Edge *next; Edge () {} Edge (int to, Edge …