摘要:
``` #include #include #include #include using namespace std; const int N = 200000+10, M = 200000+10; int n, m; int h[N], e[M], ne[M], idx; int dfn[N], low[N], timestamp; // 栈顶 int stk[N], top; bool in 阅读全文
摘要:
``` #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define rep_1(i,m,n) for(int i=m;i='0'&&ch='0'&&ch pii; ty 阅读全文
摘要:
``` #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define rep_1(i,m,n) for(int i=m;i='0'&&ch='0'&&ch pii; ty 阅读全文
摘要:
```//稠密图#include #include #include using namespace std;const int N = 100010, M = 200010, INF = 0x3f3f3f3f;int n, m;int p[N];struct Edge { int a, b, w; bool operator< (const Edge &W)const { ... 阅读全文
摘要:
太难了,参考题解:https://www.luogu.com.cn/blog/An Fly/soluti p5774 阅读全文
摘要:
```#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define rep_1(i,m,n) for(int i=m;i '9') && c != '-'); if (c == '-') bo = ... 阅读全文