前言

重返纪中之日，又是被虐之时

---

成绩

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

$Rank$	$Person$	$Score$	$A$	$B$	$C$
$6$	$(H-1)HJW$	$191$	$100$	$91$	$0$
$9$	$(J-2)WYC$	$151$	$60$	$90$	$0$
$15$	$(J-2)HJQ$	$110$	$10$	$100$	$0$
$17$	$(J-3)WHF$	$100$	$100$	$0$	$0$
$28$	$(J-2)XXY$	$50$	$50$	$0$	$0$
$30$	$(J-2)LRZ$	$46$	$10$	$36$	$0$
$31$	$(H-1)TRX$	$40$	$40$	$0$	$0$
$31$	$(J-2)ZYC$	$40$	$40$	$0$	$0$
$36$	$(J-2)HZB$	$29$	$20$	$9$	$0$
$37$	$(J-2)XJQ$	$27$	$0$	$27$	$0$
$39$	$(J-2)LW$	$10$	$10$	$0$	$0$
$43$	$(J-3)QYH$	$0$	$0$	$0$	$0$

(分数已经四舍五入了)

---

正题

---

$T1:jzoj1764-$游戏【$dp,dfs$】

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

---

$T2:jzoj1758-$过河【$dp$】

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

---

$T3:jzoj4669-[NOIP2016$提高$A$组模拟$7.19]$弄提纲【$LCA,KMP,$字符串】

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

---

$someofcodes$

---

T1 60分code

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=110;
int n,m,Big,K,a[N],f[N][N];
bool flag,v[N][N];
void dfs(int x,int num)
{int A=f[1][x];if(num==K){flag=1;for(int i=1;i<=n;i++)printf("%d\n",a[i]);return;}if(x>n||num>K||flag) return;if(A==0){dfs(x+1,num);return;}for(int i=0;i<=Big;i++){if(num+i*A>K) break;a[x]=i;dfs(x+1,num+i*A);}
}
int main()
{scanf("%d%d%d%d",&n,&m,&Big,&K);for(int i=1;i<=m;i++){int x,y;scanf("%d%d",&x,&y);v[x][y]=1;}f[n][1]=1;for(int i=n-1;i>=1;i--)for(int j=1;j<=n;j++){f[i][j]=f[i+1][j]+f[i+1][j-1];if(f[i+1][j]==-1||f[i+1][j-1]==-1)f[i][j]=-1;if(f[i][j]>K) f[i][j]=-1;if(v[i][j]) f[i][j]=0;}for(int i=1;i<=n;i++)if(f[1][i]==-1) f[1][i]=0;dfs(1,0);
}

---

T2 90.9分code

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1100;
int G,t,a[N],b[N],f[2][N],n;
int main()
{scanf("%d",&G);while(G--){scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d%d",&a[i],&b[i]);memset(f,0,sizeof(f));t=1;f[1][0]=1;n++;a[0]=1;a[n]=1;bool flag;while(!f[t&1][n]){flag=1;for(int i=0;i<=n;i++){if(!f[t&1][i]) continue;flag=0;for(int j=-5;j<=5;j++){int z=i+j;if(z<0||z>n) continue;if((t-1)%(a[z]+b[z])+1>a[z]) continue;f[~t&1][z]=1;}}if(t>5000000/n) flag=1;if(flag) break;memset(f[t&1],0,sizeof(f[t&1]));t++;}if(flag) printf("No\n");else printf("%d\n",t-1);}
}

---

总结

看题期望分$$40+0+0=40$$
做题期望分$$90+50+0=140$$
实际の分数$$60+90.9(???)+0=150.9$$
开始看所有题目都没有思路，然后$T1$推了一会开始写$dp$写了半天各种出锅就该去写$dfs$了，发现好像似乎可以过$???$。然后$T2$写了个暴力结果就是正解$???$，$T3$题目开始出了锅然后没鸟它，后来改回去了也没看。
就是死刚$T1$

---

$$\text{:D}$$

最后的最后
$${\text{我}}_{{\text{了}}^{\text{呀}}}^{{\text{太}}_{\text{菜}}}$$