qq_42129242的博客

题目链接 二分图做法： #include<bits/stdc++.h> using namespace std; const int N = 105; vector<int>e[N]; int vis[N],cy[N],cx[N],n,m; int dfs(int u) { for(int i=0;i<e[u].size();++i){ int v=e[u...

#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int maxn = 1e2+10; const int inf = 0x3f3f3f3f; int p,n,S,T,en=1,tot; int head[maxn],h[maxn],q[maxn]...

#include<bits/stdc++.h> using namespace std; const int N = 1100; const int inf = 0x3f3f3f3f; int n,p,q,S,T,tot; int en=1,head[N],h[N],Q[N]; struct edge{ int to,v,next; }e[N*10]; inline void i...