HDU 3339最短路+背包

In Action

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3791    Accepted Submission(s): 1202

Problem Description

Since 1945, when the first nuclear bomb was exploded by the Manhattan Project team in the US, the number of nuclear weapons have soared across the globe.
Nowadays,the crazy boy in FZU named AekdyCoin possesses some nuclear weapons and wanna destroy our world. Fortunately, our mysterious spy-net has gotten his plan. Now, we need to stop it.
But the arduous task is obviously not easy. First of all, we know that the operating system of the nuclear weapon consists of some connected electric stations, which forms a huge and complex electric network. Every electric station has its power value. To start the nuclear weapon, it must cost half of the electric network's power. So first of all, we need to make more than half of the power diasbled. Our tanks are ready for our action in the base(ID is 0), and we must drive them on the road. As for a electric station, we control them if and only if our tanks stop there. 1 unit distance costs 1 unit oil. And we have enough tanks to use.
Now our commander wants to know the minimal oil cost in this action.

 

Input

The first line of the input contains a single integer T, specifying the number of testcase in the file.
For each case, first line is the integer n(1<= n<= 100), m(1<= m<= 10000), specifying the number of the stations(the IDs are 1,2,3...n), and the number of the roads between the station(bi-direction).
Then m lines follow, each line is interger st(0<= st<= n), ed(0<= ed<= n), dis(0<= dis<= 100), specifying the start point, end point, and the distance between.
Then n lines follow, each line is a interger pow(1<= pow<= 100), specifying the electric station's power by ID order.

 

Output

The minimal oil cost in this action.
If not exist print "impossible"(without quotes).

 

Sample Input

  
  

   
   2
2 3
0 2 9
2 1 3
1 0 2
1
3
2 1
2 1 3
1
3
  
  

 

Sample Output

  
  

   
   5
impossible
  
  

 

Author

Lost@HDU

 

Source

HDOJ Monthly Contest – 2010.03.06

最短路加01背包，最短路好写直接上floyd

费用是0到每个点的距离，最大容量为0到每个点的总距离之和，价值为每个点（发电厂）的电量

获得0～总距离的dp电量值，遍历获得dp[i]>=总电量/2+1的i就是需要的距离

#define DeBUG
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <string>
#include <set>
#include <sstream>
#include <map>
#include <bitset>
using namespace std ;
#define zero {0}
#define INF 0x3f3f3f3f
#define EPS 1e-6
typedef long long LL;
const double PI = acos(-1.0);
//#pragma comment(linker, "/STACK:102400000,102400000")
inline int sgn(double x)
{
    return fabs(x) < EPS ? 0 : (x < 0 ? -1 : 1);
}
const int N = 200;
int mp[N][N];
int value[N];
int dp[10005];
int main()
{
#ifdef DeBUGs
    freopen("//home//amb//桌面//1.in", "r", stdin);
#endif
    int T;
    scanf("%d", &T);
    while (T--)
    {
        int n, m;
        scanf("%d%d", &n, &m);
        int a, b, v;
        memset(mp, INF, sizeof(mp));
        memset(value, 0, sizeof(value));
        memset(dp, 0, sizeof(dp));
        for (int i = 0; i < m; i++)
        {
            scanf("%d%d%d", &a, &b, &v);
            mp[a][b] = mp[b][a] = min(mp[a][b], v);
        }
        int RoadTotal = 0;
        int vtotal = 0;
        for (int i = 1; i <= n; i++)
        {
            scanf("%d", &value[i]);
            vtotal += value[i];
        }
        for (int i = 0; i <= n; i++)
        {
            mp[i][i] = 0;
        }
        for (int k = 0; k <= n; k++)
        {
            for (int i = 0; i <= n; i++)
            {
                for (int j = 0; j <= n; j++)
                {
                    if (mp[i][j] > mp[i][k] + mp[k][j])
                    {
                        mp[i][j] = mp[i][k] + mp[k][j];
                    }
                }
            }
        }
        for (int i = 0; i <= n; i++)
        {
            if (mp[0][i] != INF)
                RoadTotal += mp[0][i];
        }
        for (int i = 1; i <= n; i++)
        {
            for (int j = RoadTotal; j >= mp[0][i]; j--)
            {
                dp[j] = max(dp[j], dp[j - mp[0][i]] + value[i]);
            }
        }

        int d = vtotal / 2 + 1;
        int flag = true;
        for (int i = 0; i <= RoadTotal; i++)
        {
            if (dp[i] >= d)
            {
                flag = false;
                printf("%d\n", i);
                break;
            }
        }
        if (flag)
            printf("impossible\n");
    }

    return 0;
}

伪邻接表版，注意判重边

#define DeBUG
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <string>
#include <set>
#include <sstream>
#include <map>
#include <bitset>
using namespace std ;
#define zero {0}
#define INF 0x3f3f3f3f
#define EPS 1e-6
typedef long long LL;
const double PI = acos(-1.0);
//#pragma comment(linker, "/STACK:102400000,102400000")
inline int sgn(double x)
{
    return fabs(x) < EPS ? 0 : (x < 0 ? -1 : 1);
}
const int N = 200;
const int E=10005;
int mp[N][N];
int value[N];
int dp[10005];
struct Edges
{
    int x, y, w, next;
} e[E << 1];
int head[N];
int dis[N];
int inq[N];
void AddEdge(int x, int y, int w, int k)
{
    e[k].x = x, e[k].y = y, e[k].w = w, e[k].next = head[x], head[x] = k;
}
int relax(int u, int v, int c)
{
    if (dis[v] > dis[u] + c)
    {
        dis[v] = dis[u] + c;
        return 1;
    }
    return 0;
}
int n, m;
void SPFA(int src)
{
    int i;
    memset(inq, 0, sizeof(inq));
    dis[src] = 0;
    queue<int>Q;
    Q.push(src);
    while (!Q.empty())
    {
        int u, v;
        u = Q.front();
        Q.pop();
        inq[u] = 0;
        for (i = head[u]; i != -1; i = e[i].next)
        {
            v = e[i].y;
            if (relax(u, v, e[i].w) == 1 && !inq[v])
            {
                Q.push(v);
                inq[v] = 1;
            }
        }
    }
    for (int i = 0; i <= n; i++)
    {
        mp[0][i] = dis[i];
        // printf("%d ", dis[i]);
    }
    return;
}
int main()
{
#ifdef DeBUGs
    freopen("C:\\Users\\Sky\\Desktop\\1.in", "r", stdin);
#endif
    int T;
    scanf("%d", &T);
    while (T--)
    {

        scanf("%d%d", &n, &m);
        int a, b, v;
        memset(mp, INF, sizeof(mp));
        memset(e, -1, sizeof(e));
        memset(value, 0, sizeof(value));
        memset(dp, 0, sizeof(dp));
        memset(dis, INF, sizeof(dis));
        memset(head, -1, sizeof(head));
        int num = 0;
        for (int i = 0; i < m; i++)
        {
            scanf("%d%d%d", &a, &b, &v);
            mp[a][b] = mp[b][a] = min(mp[a][b], v);
        }
        for (int i = 0; i <= n; i++)
        {
            mp[i][i] = INF;
        }
        for (int i = 0; i <= n; i++)
        {
            for (int j = 0; j <= n; j++)
            {
                if (mp[i][j] != INF)
                {
                    AddEdge(i, j, mp[i][j], num++);
                }
            }
        }
        // for (int i = 0; i <= n; i++)
        // {
        //     printf("%d :", i);
        //     for (int j = head[i]; j != -1; j = e[j].next)
        //     {
        //         printf("%d ", e[j].y);
        //     }
        //     printf("\n");
        // }

        int RoadTotal = 0;
        int vtotal = 0;
        for (int i = 1; i <= n; i++)
        {
            scanf("%d", &value[i]);
            vtotal += value[i];
        }

        SPFA(0);
        for (int i = 0; i <= n; i++)
        {
            if (mp[0][i] != INF)
                RoadTotal += mp[0][i];
        }
        for (int i = 1; i <= n; i++)
        {
            for (int j = RoadTotal; j >= mp[0][i]; j--)
            {
                dp[j] = max(dp[j], dp[j - mp[0][i]] + value[i]);
            }
        }

        int d = vtotal / 2 + 1;
        int flag = true;
        for (int i = 0; i <= RoadTotal; i++)
        {
            if (dp[i] >= d)
            {
                flag = false;
                printf("%d\n", i);
                break;
            }
        }
        if (flag)
            printf("impossible\n");
    }

    return 0;
}