T1
题面花里胡哨的,但仔细想一下会发现其实就是个裸的完全背包...
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <ctime>
#include <cmath>
#define maxn 5010
#define maxt 5010
using namespace std;
int s,T,n,m,x,t[maxn],w[maxn];
long long dp[maxt];
int read()
{
int xx=0,kk=1;char ch=' ';
while(!isdigit(ch)){ch=getchar();if(ch=='-')kk=-1;}
while(isdigit(ch)){xx=xx*10+ch-'0';ch=getchar();}
return kk*xx;
}
int main()
{
freopen("restaurant.in","r",stdin);
freopen("restaurant.out","w",stdout);
s=read();
while(s--)
{
memset(dp,0,sizeof(dp));
n=read(),m=read();T=read();
for(int i=1;i<=n+m;++i)
t[i]=read(),w[i]=read();
for(int i=n+1;i<=n+m;++i)
for(int j=1;j<=n;++j)
{
x=read();
t[i]+=x*t[j];
}
for(int i=1;i<=n+m;++i)
for(int j=t[i];j<=T;++j)
dp[j]=max(dp[j],dp[j-t[i]]+1ll*w[i]);
printf("%lld\n",dp[T]);
}
return 0;
}
T2
和9月2号D2T2大同小异,但本题中求的是包含边的最大链,就在子节点的最大值和父节点的最大值取min就好了
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <ctime>
#include <cmath>
#define maxn 200010
using namespace std;
int n,m,q,num,t;
int fa[maxn],fir[maxn],len[maxn][2];
struct qwq
{
int to,nxt;
}e[maxn];
int read()
{
int xx=0,kk=1;char ch=' ';
while(!isdigit(ch)){ch=getchar();if(ch=='-')kk=-1;}
while(isdigit(ch)){xx=xx*10+ch-'0';ch=getchar();}
return kk*xx;
}
void addedge(int u,int v)
{
e[++num].to=v;
e[num].nxt=fir[u];
fir[u]=num;
}
void dfs(int u)
{
len[u][0]=len[u][1]=0;
for(int i=fir[u];i;i=e[i].nxt)
{
int v=e[i].to;
dfs(v);
if(len[v][0]+1>=len[u][0])
{
len[u][1]=len[u][0];
len[u][0]=len[v][0]+1;
}
else if(len[v][0]+1>len[u][1])
len[u][1]=len[v][0]+1;
}
}
void change(int u)
{
for(int i=fir[u];i;i=e[i].nxt)
{
int v=e[i].to;
if(len[u][0]==len[v][0]+1)
{
if(len[u][1]+1>=len[v][0])
{
len[v][1]=len[v][0];
len[v][0]=len[u][1]+1;
}
else if(len[u][1]+1>len[v][1])
len[v][1]=len[u][1]+1;
}
else
{
if(len[u][0]+1>=len[v][0])
{
len[v][1]=len[v][0];
len[v][0]=len[u][0]+1;
}
else if(len[u][0]+1>len[v][1])
len[v][1]=len[u][0]+1;
}
change(v);
}
}
void clear()
{
num=0;
memset(fir,0,sizeof(fir));
memset(len,0,sizeof(len));
memset(fa,0,sizeof(fa));
}
int main()
{
freopen("olefin.in","r",stdin);
freopen("olefin.out","w",stdout);
read();t=read();
while(t--)
{
n=read(),m=read();clear();
for(int i=2;i<=n;++i)
fa[i]=read(),addedge(fa[i],i);
dfs(1);change(1);
for(int i=1;i<m;++i)
q=read(),printf("%d ",min(len[q][0]+len[q][1],len[fa[q]][0]+len[fa[q]][1]));
if(m) q=read(),printf("%d\n",min(len[q][0]+len[q][1],len[fa[q]][0]+len[fa[q]][1]));
}
return 0;
}
T3
神学高精十进制快速幂...rbqrbq...