欢乐SSL初二组周六赛【2019.5.11】

前言

难度差异极大

成绩

只放前 $10$ ， $J$ 表示初中， $H$ 表示高中

$R a n k$	$P e r s o n$	$S c o r e$	$A$	$B$	$C$	$D$
$1$	$(J) 2017 W Y C$	$296$	$100$	$100$	$76$	$20$
$2$	$(J) 2017 Z Y C$	$254$	$100$	$100$	$24$	$30$
$3$	$(J) 2017 X X Y$	$240$	$100$	$100$	$40$	$0$
$4$	$(J) 2017 H Z B$	$240$	$100$	$100$	$40$	$0$
$5$	$(J) 2017 L R Z$	$236$	$100$	$100$	$36$	$0$
$6$	$(H) 2018 Y J Y$	$222$	$100$	$90$	$32$	$0$
$7$	$(J) 2017 X J Q$	$220$	$100$	$100$	$0$	$20$
$8$	$(J) 2018 L Y F$	$210$	$100$	$100$	$10$	$0$
$9$	$(J) 2017 L W$	$200$	$100$	$100$	$0$	$0$
$10$	$(J) 2017 H J Q$	$200$	$100$	$100$	$0$	$0$

$L Y F$ 这个 $d a l a o$ 做完自己的题来刷水

正题

$T 1 : n s s l 1320, j z o j ($ 初中 $) 2108 -$ 买装备【 $d f s,$ 水题】

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

$T 2 : n s s l 1321, j z o j ($ 初中 $) 2106 -$ 买门票【 $d f s,$ 暴力 $,$ 字符串】

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

$T 3 : n s s l 1322, j z o j ($ 初中 $) 2109 -$ 清兵线【 $d p$ 】

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

$T 4 : n s s l 1323, j z o j ($ 初中 $) 2107 -$ 交流【 $d f s,$ 容斥 $,$ 组合数】

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

$someofcodessome\ of\ codes$

T3 76分code

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=320;
int n,m,a[N],ans;
int f[N][N][2],t[N][N][2];
void dfs(int l,int r,bool k,int v,int w){if(v>m||l<1||r>n) return;w+=m-v;if(f[l][r][k]>=w||f[l][r][k]==w&&t[l][r][k]<=v) return;f[l][r][k]=w;t[l][r][k]=v;ans=max(ans,f[l][r][k]);if(k){dfs(l,r+1,1,v+a[r+1]-a[r],w);dfs(l-1,r,0,v+a[r]-a[l-1],w);}else{dfs(l-1,r,0,v+a[l]-a[l-1],w);dfs(l,r+1,1,v+a[r+1]-a[l],w);}
}
int main()
{scanf("%d%d",&n,&m);for(int i=1;i<=n;i++)scanf("%d",&a[i]);a[++n]=0;sort(a+1,a+1+n);int mid=lower_bound(a+1,a+1+n,0)-a;memset(f,0xcf,sizeof(f));memset(t,0x3f,sizeof(t));dfs(mid,mid,0,0,0);dfs(mid,mid,1,0,0);printf("%d",ans-m); 
}

T4 20分code

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<iostream>
using namespace std;
const int L=55,XJQ=1000003;
int m,K,l,ans,num[L],cnt;
char k[L],y[20][L];
bool v[L][26];
string z[32780];
void dfs(int dep,int c)
{if(!c){++cnt;for(int i=1;i<=l;i++)z[cnt]+=k[i];return;}if(dep>m) return;char b[L];bool flag=1;for(int i=1;i<=l;i++){if(k[i]!='?'&&y[dep][i]!='?'&&k[i]!=y[dep][i]){flag=0;break;}b[i]=k[i];k[i]=(y[dep][i]=='?'?k[i]:y[dep][i]);}if(flag) dfs(dep+1,c-1);for(int i=1;i<=l;i++)k[i]=b[i];dfs(dep+1,c); 
}
bool cmp(string x,string y)
{for(int i=0;i<l;i++){if(x[i]=='?'||y[i]=='?') continue;if(x[i]>y[i])return 1;else if(x[i]<y[i]) return 0;}return 1;
}
int main()
{scanf("%d%d",&m,&K);for(int i=1;i<=m;i++)scanf("%s",y[i]+1);l=strlen(y[1]+1);for(int i=1;i<=l;i++)k[i]='?';dfs(1,K);sort(z+1,z+1+cnt,cmp);for(int j=0;j<l;j++){k[j]=z[1][j];if(k[j]=='?') num[j]=26;else num[j]=1,v[j][k[j]-'a']=1;}//cout<<z[1]<<endl;for(int i=2;i<=cnt;i++){bool flag=0;//cout<<z[i]<<endl;for(int j=0;j<l;j++){if(k[j]!='?'&&z[i][j]!='?'&&k[j]!=z[i][j]){flag=1;break;}k[j]=(z[i][j]=='?'?k[j]:z[i][j]);}if(flag){memset(v,0,sizeof(v));int w=1;for(int j=0;j<l;j++){w=w*num[j]%XJQ;k[j]=z[i][j];if(k[j]=='?') num[j]=26;else num[j]=1,v[j][k[j]-'a']=1;}ans=(ans+w)%XJQ;}else{for(int j=0;j<l;j++){if(num[j]==26) continue;if(z[i][j]=='?') num[j]=26;else num[j]+=!v[j][z[i][j]-'a'],v[j][z[i][j]-'a']=1;}}}int w=1;for(int j=0;j<l;j++)w=w*num[j]%XJQ;ans=(ans+w)%XJQ;printf("%d",ans);
}