P5683 [CSP-J2019 江西] 道路拆除
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
#include<iostream>
using namespace std;
const int MAXN=3005,MAXM=6005;
int n,m;
int s1,t1,s2,t2;
int cnte,h[MAXN],to[MAXM],nx[MAXM];
inline void adde(int u,int v){
cnte++;
nx[cnte]=h[u];
to[cnte]=v;
h[u]=cnte;
}
queue<int> que;
int dis[3][MAXN];
void Bfs(int rt,int *d){
d[rt]=0;
que.push(rt);
while(!que.empty()){
int u=que.front();
que.pop();
for(int i=h[u]; i; i=nx[i]){
int v=to[i];
if(d[v]>d[u]+1)
d[v]=d[u]+1,que.push(v);
}
}
return ;
}
int ans;
int main(){
scanf("%d%d",&n,&m);
while(m--){
int u,v,a;
scanf("%d%d",&u,&v);
adde(u,v),adde(v,u);
}
scanf("%d%d%d%d",&s1,&t1,&s2,&t2);
memset(dis,0x3f,sizeof(dis));
Bfs(1,dis[0]);
Bfs(s1,dis[1]);
Bfs(s2,dis[2]);
ans=2e9;
for(int i=1; i<=n; i++)
if(dis[0][i]+dis[1][i]<=t1&&dis[0][i]+dis[2][i]<=t2)
ans=min(ans,dis[0][i]+dis[1][i]+dis[2][i]);
if(ans==2e9) ans=-1;
else ans=cnte/2-ans;
printf("%d\n",ans);
return 0;
}
P1052 [NOIP2005 提高组] 过河
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
using namespace std;
int f[10005],far[10005],a[10005],flag[10005],p,s,t,n;
int main()
{
scanf("%d",&p);
scanf("%d%d%d",&s,&t,&n);
if(s==t)
{
int cont=0,qaq;
for(int i=1;i<=n;++i)scanf("%d",&qaq),cont+=((qaq%s)==0);
printf("%d\n",cont);return 0;
}
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
sort(a+1,a+n+1);a[0]=0;f[0]=0;
far[n+1]=min(p-a[n],100);p=0;
for(int i=1;i<=n;i++)far[i]=min(a[i]-a[i-1],90),p+=far[i],flag[p]=1;
p+=far[n+1];
for(int i=1;i<=p+9;i++)
{
f[i]=INT_MAX-1;
for(int j=s;j<=t;j++)if(i>=j)f[i]=min(f[i],f[i-j]+flag[i]);
}
int minn=INT_MAX-1;
for(int i=p;i<=p+9;i++)
minn=min(minn,f[i]);
printf("%d",minn);
}