前言

題目有毒系列。反正我覺得第1題最難，3,4題簡(jiǎn)單些。
跟jz大佬做題

---

成績(jī)

$Rank$是有算別人的

$Rank$$Person$$Score$$A$$B$$C$$D$

$1$	$meself$	$280$	$0$	$80$	$100$	$100$
$12$	$xjq$	$100$	$0$	$0$	$100$	$0$
$12$	$xxy$	$100$	$0$	$0$	$100$	$0$
$12$	$zyc$	$100$	$0$	$0$	$100$	$0$
$29$	$lrz$	$30$	$0$	$0$	$30$	$0$
$29$	$hjq$	$30$	$0$	$0$	$30$	$0$
$29$	$lw$	$30$	$0$	$0$	$30$	$0$
$49$	$hzb$	$0$	$0$	$0$	$0$	$0$

---

正題

---

$T1:jzoj5123?diyiti$【統(tǒng)計(jì)$,$容斥】

博客鏈接:
https://blog.csdn.net/Mr_wuyongcong/article/details/84893821

---

$T2:jzoj100042?$保留道路【最小生成樹$,$圖論】

奇怪的題號(hào)
博客鏈接:
https://blog.csdn.net/Mr_wuyongcong/article/details/84892764

---

$T3:jzoj3518?$進(jìn)化序列$(evolve)$【位運(yùn)算】

位運(yùn)算快樂題
博客鏈接:
https://blog.csdn.net/Mr_wuyongcong/article/details/84891935

---

$T4:jzoj5223?B$【矩陣乘法】

省選模擬賽?
博客鏈接:
https://blog.csdn.net/Mr_wuyongcong/article/details/84891983

---

$someofcode$

---

T2 80分code

#include<cstdio> #include<algorithm> #define Inf 1e18 #define N 500 #define M 50010 #define ll long long using namespace std; struct node{ll x,y,g,s; }a[M]; ll n,m,wS,wG,ans; ll fa[N],s[M]; bool cmp(node x,node y) {return x.g<y.g;} ll find(ll x) {return fa[x]==x?x:fa[x]=find(fa[x]);} void unionn(ll x,ll y) {ll Fa=find(x),Fb=find(y);if(Fa<Fb) fa[Fb]=Fa;else fa[Fa]=Fb; } ll check(ll ms) {for(ll i=1;i<=n;i++)fa[i]=i;ll maxg=0,k=0;for(ll i=1;i<=m;i++){if(a[i].s>ms) continue;if(find(a[i].x)!=find(a[i].y)){maxg=max(maxg,a[i].g);k++;unionn(a[i].x,a[i].y);}if(k==n-1) break;}if(k<n-1) return Inf;return ms*wS+maxg*wG; } int main() {scanf("%lld%lld%lld%lld",&n,&m,&wG,&wS);for(ll i=1;i<=m;i++){scanf("%lld%lld%lld%lld",&a[i].x,&a[i].y,&a[i].g,&a[i].s);s[i]=a[i].s;}ans=Inf;sort(s+1,s+1+m);sort(a+1,a+1+m,cmp);for(ll i=1;i<=m;i++){if(s[i]*wS>ans) break;ans=min(ans,check(s[i]));}if(ans==Inf) printf("-1");else printf("%lld",ans); }

---

T1 0分code

#include<cstdio> #include<algorithm> #define N 35 #define A int(1e7)+10 using namespace std; int n,v[A],a[N],ans; int main() {freopen("yist.in","r",stdin);freopen("yist.out","w",stdout);scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]),v[a[i]]++;sort(a+1,a+1+n);for(int i=4;i<=n;i++)for(int j=3;j<i;j++)for(int k=2;k<j;k++)for(int q=1;q<k;q++){if(a[i]+a[q]==a[j]+a[k]){int w=a[i]+a[q];if(v[w]>1)ans+=v[w]*(v[w]-1)/2;}}for(int i=3;i<=n;i++)for(int j=2;j<i;j++)for(int k=1;k<j;k++)ans+=(v[a[i]+a[j]+a[k]]>=3);printf("%d",ans); }

---

尾聲

又回jzoj做題了

總結(jié)

以上是生活随笔為你收集整理的欢乐纪中某B组赛【2018.12.8】的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。