1450: 经商 01背包 dfs标记

最新推荐文章于 2022-01-06 17:33:10 发布

twh233

最新推荐文章于 2022-01-06 17:33:10 发布

阅读量394

点赞数

CC 4.0 BY-SA版权

分类专栏：背包DP STL dfs

本文链接：https://blog.youkuaiyun.com/qq_36553623/article/details/78126926

STL dfs 同时被 2 个专栏收录

25 篇文章

订阅专栏

背包DP

9 篇文章

订阅专栏

本文介绍了一道中文编程题目，使用01背包算法结合深度优先搜索（DFS）解决一个关于物品选择的问题。通过示例输入输出展示了算法的具体实现过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

传送门

Sample Input

Sample Output

题意懒得说了，中文题啊

做法：01背包 01背包 01背包啊，dfs判连接啊

//china no.1
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
typedef long long LL;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e4+10;
const int maxx=200005;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;

int t;
int n,m,c;

int v[maxn],dp[maxn],w[maxn];
vector<int>G[maxn];
bool vis[maxn];

void dfs(int x)
{
    if(vis[x]) return ;
    vis[x]=1;
    for(int i=0;i<G[x].size();i++)
        dfs(G[x][i]);
}

int main()
{
    S_1(t);
    W(t--)
    {
        me(dp,0);
        FOR(0,maxn,i)
            G[i].clear();
        me(v,0);
        me(w,0);
        me(vis,0);
        S_3(n,m,c);//n人数 关系数 c最大体积
        int a,b;
        FOR(2,n,i)
        {
            S_2(a,b);
            v[i]=a;//体积
            w[i]=b;//价值
        }
        FOR(1,m,i)
        {
            int x,y;
            S_2(x,y);
            G[x].pb(y);
            G[y].pb(x);
        }
        dfs(1);
        FOR(2,n,i)
        {
            if(vis[i])
            for(int j=c;j>=v[i];j--)
                dp[j]=max(dp[j],dp[j-v[i]]+w[i]);
        }
        print(dp[c]);
    }
}