前言

話說今天好像放做題導致$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{木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大木大}$$

總結

以上是生活随笔為你收集整理的欢乐纪中某A组赛【2019.7.11】的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。