B1079 Total Sales of Supply Chain (BFS,DFS)

B1079 Total Sales of Supply Chain (25分)

//第一处bug在price*(1+rate/100),没看懂题意。
//第二处bug在递归边界处使用price,多加了一次price

price+=(cost[root]*sum);

DFS

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define lowbit(i)((i)&(-i))
using namespace std;
typedef long long ll;
const int MAX=1e5+20;
const int INF=0x3f3f3f3f;
const int MOD=1000000007;
const int SQR=632;//633块,632个
vectorvt[MAX];
double price,rate;
double ans=0;
double cost[MAX],book[MAX];
int n;
void dfs(int root,double sum)
{
    if(cost[root]!=0)
    {
        ans+=(cost[root]*sum);
        return ;
    }
    for(int i=0;i

BFS

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define lowbit(i)((i)&(-i))
using namespace std;
typedef long long ll;
const int MAX=1e5+20;
const int INF=0x3f3f3f3f;
const int MOD=1000000007;
const int SQR=632;//633块,632个
vectorvt[MAX];
double price,rate;
double ans=0;
double cost[MAX],r[MAX];
int n;
void bfs(int root)
{
    queueq;
    r[root]=price;
    q.push(root);
    while(!q.empty())
    {
        int top=q.front();
        q.pop();
        if(cost[top]!=0)
            ans+=(cost[top]*r[top]);
        for(int i=0;i

你可能感兴趣的:(B1079 Total Sales of Supply Chain (BFS,DFS))