前言

话说今天好像放做题导致$B$组贼难$A$组还好。

---

成绩

$J$表示初中，$H$表示高中后面加的是几年级

$Rank$	$Person$	$Score$	$A$	$B$	$C$
$10$	$(J-2)WYC$	$250$	$100$	$100$	$50$
$28$	$(J-2)ZYC$	$200$	$100$	$100$	$0$
$47$	$(J-2)LRZ$	$150$	$50$	$100$	$0$
$52$	$(J-2)XJQ$	$100$	$0$	$100$	$0$
$52$	$(H-1)HJW$	$100$	$100$	$0$	$0$
$52$	$(J-2)LW$	$100$	$100$	$0$	$0$
$58$	$(J-2)HJQ$	$90$	$90$	$0$	$0$
$61$	$(J-2)HZB$	$30$	$30$	$0$	$0$

---

正题

---

$T1:jzoj3236-$矮人排队【权值线段树】

链接:
https://blog.csdn.net/Mr_wuyongcong/article/details/95462316

---

$T2:jzoj3237-$间谍派遣【最小生成树$,$并查集】

链接:
https://blog.csdn.net/Mr_wuyongcong/article/details/95473654

---

$T3:bzoj3482,jzoj3238-$超时空旅行$hiperprostor$【最短路$,$凸包$,$斜率优化】

链接:
https://blog.csdn.net/Mr_wuyongcong/article/details/95491246

---

$someofcode$

---

$T350$分$code$

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1100;
struct node{int x,y,w;
}a[N*N];
int n,tot,ans,fa[N],cost[N];
bool cmp(node x,node y)
{return x.w<y.w;}
int find(int x)
{if(fa[x]==x) return x;return fa[x]=find(fa[x]);
}
void unionn(int x,int y)
{int Fa=find(x),Fb=find(y);if(Fa<Fb) fa[Fb]=Fa,cost[Fa]=min(cost[Fa],cost[Fb]);else fa[Fa]=Fb,cost[Fb]=min(cost[Fa],cost[Fb]);return;
}
int main()
{scanf("%d",&n);for(int i=1;i<=n;i++)for(int j=1;j<=n;j++){int x;scanf("%d",&x);a[++tot].x=i;a[tot].y=j;a[tot].w=x;}for(int i=1;i<=n;i++)scanf("%d",&cost[i]),fa[i]=i,ans+=cost[i];sort(a+1,a+1+tot,cmp);for(int i=1;i<=tot;i++){int fx=find(a[i].x),fy=find(a[i].y);if(fx==fy||a[i].w>max(cost[fx],cost[fy])) continue;ans-=max(max(cost[fx],cost[fy])-a[i].w,0);unionn(fx,fy);}printf("%d",ans);

---

总结

看起来十分可做然后$T1T2$一眼正解，$T3$半天啥都看不出来就写了个暴力$50$

---

$$\text{：|}$$

最后的最后
$$\text{木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大}$$