前言

這次那了一個和fuW并列的第一，然而似乎都不是很難。(因為第1題有bug所以滿分不了)

---

成績

只放Rank?1～10Rank1～10

RankRankPersonPersonScoreScore

11	2015hjw2015hjw	193193
11	2017myself2017myself	193193
33	2017xjq2017xjq	136136
44	2015zyf2015zyf	129129
55	2017zyc2017zyc	101101
66	2017lw2017lw	8686
77	2017lrz2017lrz	8484
88	2017hjq2017hjq	7979
88	2015trx2015trx	7979
1010	2015yjy2015yjy	5555

---

正題

---

T1:nssl1148,jzoj5461?T1:nssl1148,jzoj5461?購物【可撤回貪心,,堆】

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

---

nssl1149,jzoj5455?nssl1149,jzoj5455?拆網(wǎng)線【貪心】

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

---

nssl1150,jzoj5309?nssl1150,jzoj5309?密室【分層建圖,SPFA,SPFA】

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

---

一些codecode

---

一些code

---

T1 93(AC)代碼

#include<cstdio> #include<algorithm> #define N 50010 using namespace std; struct node{long long w,sct,num; }a[2*N]; long long n,k,m,p,q,ans; bool v[N]; bool cmp(node x,node y) {return x.w<y.w;} int main() {scanf("%lld%lld%lld",&n,&k,&m);for(long long i=1;i<=n;i++){scanf("%lld%lld",&p,&q);a[i]=(node){p,0,i};a[i+n]=(node){q,1,i};}sort(a+1,a+1+2*n,cmp);for(long long i=1;i<=2*n;i++){if(m>=a[i].w&&!v[a[i].num]&&(!a[i].sct||k)){ans++;m-=a[i].w;v[a[i].num]=true;if(a[i].sct) k--;}}printf("%lld",ans); }

---

T2 5分代碼

#include<cstdio> #include<cstring> #include<algorithm> #define N 100010 using namespace std; struct node{int to,next; }a[N*2]; int ls[N],t,n,k,x,f[N][2],tot; void addl(int x,int y) {a[++tot].to=y;a[tot].next=ls[x];ls[x]=tot;a[++tot].to=x;a[tot].next=ls[y];ls[y]=tot; } void dp(int x,int fa) {int mark=0;for(int i=ls[x];i;i=a[i].next){int y=a[i].to;if(y==fa) continue;dp(y,x);f[x][1]+=f[y][0];if(f[y][1]-f[y][0]>f[mark][1]-f[mark][0]) mark=y;}f[x][0]=f[x][1]+f[mark][1]-f[mark][0];f[x][1]++; } int main() {scanf("%d",&t);for(int ti=1;ti<=t;ti++){memset(f,0,sizeof(f));memset(ls,0,sizeof(ls));scanf("%d%d",&n,&k);tot=0;for(int i=1;i<n;i++){scanf("%d",&x);addl(i+1,x);}dp(1,0);int ans=f[1][0];if(ans*2>=k) printf("%d\n",(k+1)/2);else printf("%d",ans+(k-ans*2));} }

---

T3 95分代碼

#include<cstdio> #include<deque> #define p(x,y) x*n+y #define N 5010 #define M 6010 #define MS 1024 using namespace std; struct node{int to,next;bool w; }a[MS*(N+M)]; int n,m,k,x,y,w,MAX_State,d[N*MS],tot,ls[N*MS]; deque<int> q; void addl(int x,int y,int w) {a[++tot].to=y;a[tot].next=ls[x];a[tot].w=w;ls[x]=tot; } void bfs() {q.push_back(p(0,1));d[p(0,1)]=1;while(!q.empty()){int x=q.front();q.pop_front();for(int i=ls[x];i;i=a[i].next){int y=a[i].to;//if(y%n==0)// printf("%d\n",y);if(!d[y]){d[y]=d[x]+a[i].w;if(a[i].w==0) q.push_front(y);else q.push_back(y); }}} } int main() {scanf("%d%d%d",&n,&m,&k);MAX_State=1<<k;for(int i=1;i<=n;i++)for(int j=1;j<=k;j++){scanf("%d",&x);if(x){for(int state=0;state<MAX_State;state++)if(!(state&(1<<(j-1))))addl(p(state,i),p((state|(1<<(j-1))),i),0);}}for(int i=1;i<=m;i++){int state=0;scanf("%d%d",&x,&y);for(int i=1;i<=k;i++){scanf("%d",&w);state+=w<<(i-1);}for(int j=0;j<MAX_State;j++)if((j&state)==state)addl(p(j,x),p(j,y),1);}bfs();int ans;ans=2147483647;for(int j=0;j<MAX_State;j++)if(d[p(j,n)])ans=min(ans,d[p(j,n)]);if(ans==2147483647) printf("No Solution");else printf("%d",ans-1); }

---

尾聲

依舊沒了

創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎勵來咯，堅持創(chuàng)作打卡瓜分現(xiàn)金大獎

總結

以上是生活随笔為你收集整理的ssl提高组周六模拟赛【2018.9.15】的全部內容，希望文章能夠幫你解決所遇到的問題。

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