Zenith_Habitant的博客

题目连接：https://www.luogu.com.cn/problem/P3388技巧：割点模板题//#define LOCAL#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define sz(a) (int)a.size()#define INF 0x3f3f3f3f#define DNF 0x7f#de.

强连通分量

#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define p_queue priority_queue#define DBG printf("this is a input\n")#define fi first#define se second#define mk(a.

//#define LOCAL#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DNF 0x7f#define DBG printf("this is a...

1.圆方树做法：//#define LOCAL#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DNF 0x7f#define DBG printf(...

//#define LOCAL#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DNF 0x7f#define DBG printf("this is a...

//#define LOCAL#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DNF 0x7f#define DBG printf("this is a...

//#define LOCAL#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DNF 0x7f#define DBG printf("this is a...

int times , tot;int n;int dfn[105] , low[105], vis[105], stack[105], color[105], type = 0;int in[105],out[105];void tarjan(int u){ dfn[u] = low[u] = ++ times; stack[++ tot] = u; vis[...

#include <bits/stdc++.h>using namespace std;#define ll long long#define mem(a, b) memset(a,b,sizeof(a))#define INF 0x3f3f3f3f#define DBG printf("this is a input\n")#define fi first#defi...

割点的主体部分——Tarjan，各位大佬应该都会了吧，那我就不细讲了吧，关键是这么4行（伪）代码：if(边 u -> v 是树边（父子边）) low[u] = min( low[u], low[v] );else low[u] = min( low[u], dfn[v] );关键在于：为什么回边的情况下，为什么不是low[u] = min( low[u], low...