折戟沉沙

#include#include#include#include#include#include#include#define fo(i,a,b) for(int i=a;i<=b;i++)#define fod(i,a,b) for(int i=a;i>=b;i--)using namespace std;typedef long long ll;const int MA

#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#include<vector>using namespace std;const int N=1e2+10,INF=1000000000;int n,m,pa[N];struct edge { int

题目大意:给出求每个区间{l,r}的异或和的花费cost[i][j],求知道每一个元素的最小花费 分析:考试的时候想成了线性基(明明考图论了),结果就GG了.正解是MST,把每个询问当做边,前缀和(似乎可以这么说)当做点,做MST#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<a

题目大意:有一张n个点m条边的无向图。占领第i个点需要ai个人，在第i个点空降一个人需要bi的花费。占领第i条边需要ci个人，当占领某条边后，人便可以在边上自由行走。求占领所有点的最小花费。 1<=n,m<=3e51<=ai,bi<=1e60<=ci<=1e61 <= n, m <= 3e5\\ 1 <= ai, bi <= 1e6\\ 0 <= ci <= 1e6 思路:我们会做两种决策:选择

T1: 题目大意:有n个点,使它们与某个点直接或间接相连 题解:裸Kruskal#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>#define fo(i,a,b) for(int i=a;i<=b;i++)#define fod(i,a,b) for(int i=