编程介的小学生 2017-08-01 16:57 采纳率: 20.5%
浏览 789
已采纳

Replica Placement

Problem Description
Topsky wants to build a content delivery network. It contains an origin server and some mirror servers as shown in figure 1. Original data is put at the origin server (root in figure 1) while replicas are put at some of the mirror servers (node 2 and 5 in figure 1). When a node issues a request of data, it will try to find its destination in following steps.
1. Check if there is a replica at its own place. If yes, the request meets. Otherwise do step 2.
2. Forward the request to its parent, and let its parent do step 1.

The cost of meeting the request C (v) is defined as the sum of weight of the edges along the road. If C (v) is not greater than an upper bound Q (v), then the retrieval cost is satisfied. Topsky further assumes a nonnegative cost S (v) which means the cost of storing data at node v. Note that the origin server is special, the cost of storing data at origin server is 0. Now Topsky wants to find the way of replicas placement such the retrieval cost of all nodes are satisfied while the total storage cost is minimal.

Input
The first line contains a single integer T (T <= 20), indicating the number of test cases.
Each case begins with three integers N (1<= N <= 1000) indicates the number of servers.
Then N lines follow. Each line contains four integers Fv (0 <= Fv <= N), Qv, Sv and Wv (0 <= Qv, Sv, Wv <= 105). In line i (1 <= i <= N), Fv is the father of node i (if Fv is 0, it means node i is the origin server, Qv is -1, Sv is 0 and Wv is 0), Qv is upper bound of retrieval cost, Sv is storing cost of node i and Wv is weight of this edge between node i and node Fv.

Output
For each test case, output the minimal storage cost in one line.

Sample Input
1
3
0 -1 0 0
1 1 1 1
2 1 1 1

Sample Output
1

  • 写回答

2条回答 默认 最新

  • threenewbee 2017-08-02 16:42
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(1条)

报告相同问题?

悬赏问题

  • ¥15 fpga自动售货机数码管(相关搜索:数字时钟)
  • ¥20 Python安装cvxpy库出问题
  • ¥15 用前端向数据库插入数据,通过debug发现数据能走到后端,但是放行之后就会提示错误
  • ¥15 python天天向上类似问题,但没有清零
  • ¥30 3天&7天&&15天&销量如何统计同一行
  • ¥30 帮我写一段可以读取LD2450数据并计算距离的Arduino代码
  • ¥15 C#调用python代码(python带有库)
  • ¥15 活动选择题。最多可以参加几个项目?
  • ¥15 飞机曲面部件如机翼,壁板等具体的孔位模型
  • ¥15 vs2019中数据导出问题