BZOJ 4828 DP+BFS

 

被一道简单BFS坑了这么长时间我也是hhh了

//By SiriusRen
#include <bits/stdc++.h>
using namespace std;
struct Node{int d,x,l;Node(int D=0,int X=0,int L=0):d(D),x(X),l(L){}};
int n,m,mc,xx,a[105],w[105],maxx,f[105][105],top;
set<int>s[105];pair<int,int>p[10000000];
void BFS(){
    queue<Node>q;q.push(Node(1,1,0));
    while(!q.empty()){
        Node t=q.front();q.pop();
        if(t.d<maxx){
            q.push(Node(t.d+1,t.x,t.l+1));
            if(t.l>1&&t.x<=100000000/t.l&&s[t.l].find(t.x*t.l)==s[t.l].end())
                p[++top]=make_pair(t.x*t.l,t.d+1),
                s[t.l].insert(t.x*t.l),
                q.push(Node(t.d+1,t.x*t.l,t.l));
        }
    }
}
int main(){
    memset(f,0xcf,sizeof(f));
    scanf("%d%d%d",&n,&m,&mc),f[0][mc]=0;
    for(int i=1;i<=n;i++)scanf("%d",&a[i]);
    for(int i=1;i<=n;i++)scanf("%d",&w[i]);
    for(int i=0;i<n;i++)
        for(int j=0;j<=mc;j++){
            if(j-a[i+1]>=0)
                f[i+1][j-a[i+1]]=max(f[i+1][j-a[i+1]],f[i][j]+1),
                f[i+1][min(mc,j-a[i+1]+w[i+1])]=max(f[i+1][min(mc,j-a[i+1]+w[i+1])],f[i][j]);
            maxx=max(maxx,f[i][j]);
        }
    BFS(),sort(p+1,p+1+top);
    for(int i=1;i<=m;i++){
        scanf("%d",&xx);
        int mn=0x3f3f3f3f;
        if(xx<=maxx){puts("1");goto ed2;}
        for(int j=top,k=0;j;--j)
        {
            while(k<top&&p[k+1].first+p[j].first<=xx) ++k,mn=min(mn,p[k].second-p[k].first);
            if(mn+p[j].second-p[j].first+xx<=maxx){puts("1");goto ed2;}
            if(p[j].first<=xx&&p[j].second+xx-p[j].first<=maxx){puts("1");goto ed2;}
        }
        puts("0");
        ed2:;
    }
}

 

转载于:https://www.cnblogs.com/SiriusRen/p/6908738.html