09 2022 档案

质数筛
摘要：#include<bits/stdc++.h> using namespace std; const int N = 1e6 + 10; int n, primes[N]; int get_prime(int u) { int cnt = 0; memset(primes, true, sizeof 阅读全文
posted @ 2022-09-02 17:08 ginkgozyf 阅读(42) 评论(0) 推荐(0)
匈牙利算法
摘要：#include<bits/stdc++.h> using namespace std; const int N = 550, M = 1e5 + 10; int n1, n2, m, h[N], e[M], ne[M], idx; int match[N], ans; bool vis[N]; v 阅读全文
posted @ 2022-09-02 15:49 ginkgozyf 阅读(40) 评论(0) 推荐(0)
染色法二分图
摘要：#include<bits/stdc++.h> using namespace std; const int N = 1e5 + 10, M = 1e5 + 10, INF = 0x3f3f3f3f; int n, m, h[N], e[M << 1], ne[M << 1], idx, color 阅读全文
posted @ 2022-09-01 15:26 ginkgozyf 阅读(21) 评论(0) 推荐(0)
kruskal
摘要：#include<bits/stdc++.h> using namespace std; const int N = 1e5 + 10, M = 2e5 + 10, INF = 0x3f3f3f3f; int n, m, f[N]; struct edge{ int f, t, l; edge(){ 阅读全文
posted @ 2022-09-01 14:52 ginkgozyf 阅读(48) 评论(0) 推荐(0)
prim
摘要：朴素prim #include<bits/stdc++.h> using namespace std; const int N = 550, INF = 0x3f3f3f3f; int n, m, dis[N], g[N][N]; bool vis[N]; int prim() { memset(d 阅读全文
posted @ 2022-09-01 14:51 ginkgozyf 阅读(115) 评论(0) 推荐(0)
floyd
摘要：#include<bits/stdc++.h> using namespace std; const int N = 202, INF = 0x3f3f3f3f; int n, m, q; int g[N][N]; void floyd() { for(int k = 1; k <= n; k ++ 阅读全文
posted @ 2022-09-01 09:07 ginkgozyf 阅读(172) 评论(0) 推荐(0)