前言

被花式暴虐，$T1$签到后两题神仙

---

成绩

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

$Rank$	$Person$	$Score$	$A$	$B$	$C$
$1$	$(J-3)ZZY$	$200$	$100$	$100$	$0$
$8$	$(J-3)WHF$	$145$	$100$	$0$	$45$
$20$	$(J-2)WYC$	$105$	$100$	$5$	$0$
$28$	$(J-2)HJQ$	$100$	$100$	$0$	$0$
$28$	$(J-2)LRZ$	$100$	$100$	$0$	$0$
$28$	$(J-2)HZB$	$100$	$100$	$0$	$0$
$48$	$(J-2)XJQ$	$60$	$60$	$0$	$0$
$53$	$(J-2)ZYC$	$45$	$45$	$0$	$0$
$57$	$(J-2)XXY$	$35$	$25$	$10$	$0$
$60$	$(J-3)QYH$	$20$	$15$	$5$	$0$
$67$	$(J-2)LW$	$5$	$5$	$0$	$0$

---

正题

---

$T1:jzoj3301-[$集训队互测$2013]$家族【并查集$,$暴力】

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

---

$T2:jzoj3302-[$集训队互测$2013]$供电网络【上下界网络流,费用流,动态加边】

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

---

$T3:P4841,jzoj3303-$城市规划【$NTT,$多项式求逆$,dp$】

链接:
https://blog.csdn.net/Mr_wuyongcong/article/details/94770631
神仙题好吧，促使我一个晚上学会了$FFT,NTT,$多项式求逆。

---

$someofcode$

---

$T25$分$code$

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#define p(x,y) (x*10-4+y)
using namespace std;
const int N=210,inf=2147483647/3;
struct node{int to,next,w,c;
}a[N*20];
int n,m,ls[N],s,e,S,tot=1,flow,sum;
int pre[N],f[N],mf[N],yflow,eflow,E;
bool v[N];
queue<int> q;
void addl(int x,int y,int w,int c)
{a[++tot].to=y;a[tot].next=ls[x];ls[x]=tot;a[tot].w=w;a[tot].c=c;a[++tot].to=x;a[tot].next=ls[y];ls[y]=tot;a[tot].w=0;a[tot].c=-c;
}
bool spfa()
{memset(f,0x3f,sizeof(f));q.push(s);v[s]=1;f[s]=0;mf[s]=inf;pre[e]=0;while(!q.empty()){int x=q.front();q.pop();v[x]=0;for(int i=ls[x];i;i=a[i].next){if(!a[i].w) continue;int y=a[i].to;if(f[x]+a[i].c<f[y]){mf[y]=min(mf[x],a[i].w);pre[y]=i;f[y]=f[x]+a[i].c;if(!v[y])q.push(y),v[y]=1;}}}return pre[e];
}
void count_cost()
{int now=e;sum+=mf[e]*f[e];flow+=mf[e];while(now!=s){a[pre[now]].w-=mf[e];a[pre[now]^1].w+=mf[e];now=a[pre[now]^1].to;}
}
void net_flow()
{while(spfa())count_cost();
}
bool check()
{/*for(int i=2;i<=tot;i+=2)if(a[i+1].to==s&&!a[i].c&&a[i].w)return false;return true;*/return flow>=max(eflow,yflow);
}
int main()
{scanf("%d%d",&n,&m);s=n+1;S=s+1;E=S+1;e=E+1;for(int i=1;i<=n;i++){int left,in,out;scanf("%d%d%d",&left,&in,&out);if(left>0) addl(s,i,left,0),yflow+=left;if(left<0) addl(i,e,-left,0),eflow-=left;addl(S,i,inf,in);addl(i,E,inf,out);}for(int i=1;i<=m;i++){int u,v,a,b,L,U;scanf("%d%d%d%d%d%d",&u,&v,&a,&b,&L,&U);if(!U||L>U) continue;addl(u,v,L,0);sum+=a*L*L+b*L;for(int j=L+1;j<=U;j++)addl(u,v,1,a*j*j-a*(j-1)*(j-1)+b);}if(eflow>yflow)addl(s,S,eflow-yflow,0);else addl(e,E,yflow-eflow,0);net_flow();printf("%d",sum);
}

---

总结

额，$T1$签到后面没什么好说的。

---

$$\text{:|}$$

最后的最后
$$\begin{array}{c}很菜\\ \text{被虐在A组}\end{array}$$