HDU 3268/POJ 3835 Columbus’s bargain（最短路径+暴力枚举）（2009 Asia Ningbo Regional）

Description

On the evening of 3 August 1492, Christopher Columbus departed from Palos de la Frontera with a few ships, starting a serious of voyages of finding a new route to India. As you know, just in those voyages, Columbus discovered the America continent which he thought was India. 
Because the ships are not large enough and there are seldom harbors in his route, Columbus had to buy food and other necessary things from savages. Gold coins were the most popular currency in the world at that time and savages also accept them. Columbus wanted to buy N kinds of goods from savages, and each kind of goods has a price in gold coins. Columbus brought enough glass beads with him, because he knew that for savages, a glass bead is as valuable as a gold coin. Columbus could buy an item he need only in four ways below: 
1.  Pay the price all by gold coins.  2.  Pay by ONE glass bead and some gold coins. In this way, if an item’s price is k gold coins, Columbus could just pay k � 1 gold coins and one glass bead.  3.  Pay by an item which has the same price.  4.  Pay by a cheaper item and some gold coins. 
Columbus found out an interesting thing in the trade rule of savages: For some kinds of goods, when the buyer wanted to buy an item by paying a cheaper item and some gold coins, he didn’t have to pay the price difference, he can pay less. If one could buy an item of kind A by paying a cheaper item of kind B plus some gold coins less than the price difference between B and A, Columbus called that there was a “bargain” between kind B and kind A. To get an item, Columbus didn’t have to spend gold coins as many as its price because he could use glass beads or took full advantages of “bargains”. So Columbus wanted to know, for any kind of goods, at least how many gold coins he had to spend in order to get one � Columbus called it “actual price” of that kind of goods. 
Just for curiosity, Columbus also wanted to know, how many kinds of goods are there whose “actual price” was equal to the sum of “actual price” of other two kinds. 

 

Input

There are several test cases.  The first line in the input is an integer T indicating the number of test cases ( 0 < T <= 10).  For each test case:  The first line contains an integer N, meaning there are N kinds of goods ( 0 < N <= 20). These N kinds are numbered from 1 to N. 
Then N lines follow, each contains two integers Q and P, meaning that the price of the goods of kind Q is P. ( 0 <Q <=N, 0 < P <= 30 )  The next line is a integer M( 0 < M <= 20 ), meaning there are M “bargains”. 
Then M lines follow, each contains three integers N1, N2 and R, meaning that you can get an item of kind N2 by paying an item of kind N1 plus R gold coins. It’s guaranteed that the goods of kind N1 is cheaper than the goods of kind N2 and R is none negative and less than the price difference between the goods of kind N2 and kind N1. Please note that R could be zero. 

 

Output

For each test case:  Please output N lines at first. Each line contains two integers n and p, meaning that the “actual price” of the goods of kind n is p gold coins. These N lines should be in the ascending order of kind No. . 
Then output a line containing an integer m, indicating that there are m kinds of goods whose “actual price” is equal to the sum of “actual price” of other two kinds. 

题目大意：要买n种东东，每种东东有一个价格。可以用4种方式买这些东东：1、直接用金币全额购买（没用的条件……）；2、若东东k元，付k-1个金币加一个珠子买。；3、用一个东东加一些钱交换另一个东东。4：等价值的东东可以交换。问每个东东最少用多少钱可以卖到，有几个东东满足其实付等于另外两个东东的实付之和。

思路：图论水题。附加源点S，从S到每一个东东连边，代价为k-1（用珠子不用是浪费噢）；N1能外加x元换到N2，就从N1连边到N2，代价为x；价格相同的东东之间连双向边，代价为0。每个东东到源点的最短路径就是最少用的钱，就是实际代价。最后要算的m，这么小的范围，果断暴力$O(n^3)$枚举啦管他呢。

PS：无聊测试了一下输入前面的序号确实是按顺序给的（其实不给也没什么关系吧……）

代码（0MS）：

 #include <cstdio>
 #include <algorithm>
 #include <iostream>
 #include <cstring>
 using namespace std;

 const int MAXN = ;
 const int MAXE =  * MAXN * MAXN;
 const int INF = 0x3fff3fff;

 struct Node {
     int id, val;
     void read() {
         scanf("%d%d", &id, &val);
     }
     bool operator < (const Node &rhs) const {
         return id < rhs.id;
     }
 };

 Node a[MAXN];
 int dis[MAXN], head[MAXN], vis[MAXN];
 int next[MAXE], to[MAXE], cost[MAXE];
 int ecnt, n, m;

 void init() {
     memset(head, , sizeof(head));
     ecnt = ;
 }

 void add_edge(int u, int v, int c) {
     to[ecnt] = v; cost[ecnt] = c; next[ecnt] = head[u]; head[u] = ecnt++;
 }

 void Dijkstra(int st, int n) {
     memset(dis, 0x3f, sizeof(dis));
     memset(vis, , sizeof(vis));
     dis[st] = ;
     for(int x = ; x < n; ++x) {
         int u, minDis = INF;
         for(int i = ; i < n; ++i)
             if(!vis[i] && dis[i] < minDis) u = i, minDis = dis[i];
         vis[u] = true;
         for(int p = head[u]; p; p = next[p]) {
             int v = to[p];
             if(!vis[v] && dis[v] > dis[u] + cost[p]) dis[v] = dis[u] + cost[p];
         }
     }
 }

 void solve() {
     init();
     scanf("%d", &m);
     while(m--) {
         int u, v, c;
         scanf("%d%d%d", &u, &v, &c);
         add_edge(u, v, c);
     }
     int st = ;
     for(int i = ; i <= n; ++i) add_edge(st, i, a[i].val - );
     for(int i = ; i <= n; ++i) {
         for(int j = ; j <= n; ++j) {
             if(i == j || a[i].val != a[j].val) continue;
             add_edge(i, j, );
             add_edge(j, i, );
         }
     }
     Dijkstra(st, n + );
 }

 int main() {
     int T;
     scanf("%d", &T);
     while(T--) {
         scanf("%d", &n);
         for(int i = ; i <= n; ++i) a[i].read();
         sort(a + , a + n + );
         solve();
         for(int i = ; i <= n; ++i) printf("%d %d\n", i, dis[i]);
         int ans = ;
         memset(vis, , sizeof(vis));
         for(int i = ; i <= n; ++i) {
             for(int j = ; j <= n; ++j) {
                 if(i == j) continue;
                 for(int k = ; k <= n; ++k) {
                     if(k == i || k == j) continue;
                     if(vis[k] || dis[i] + dis[j] != dis[k]) continue;
                     vis[k] = true;
                     ++ans;
                 }
             }
         }
         printf("%d\n", ans);
     }
 }