CF758E:Broken Tree(DFS & 思维)
来源:互联网 发布:郑和 知乎 编辑:程序博客网 时间:2024/06/05 02:54
You are given a tree that has n vertices, which are numbered from 1 to n, where the vertex number one is the root. Each edge has weight wi and strength pi.
Botanist Innokentiy, who is the only member of the jury of the Olympiad in Informatics, doesn't like broken trees.
The tree is broken if there is such an edge the strength of which is less than the sum of weight of subtree's edges to which it leads.
It is allowed to reduce weight of any edge by arbitrary integer value, but then the strength of its edge is reduced by the same value. It means if the weight of the edge is 10, and the strength is 12, then by the reducing the weight by 7 its weight will equal 3, and the strength will equal 5.
It is not allowed to increase the weight of the edge.
Your task is to get the tree, which is not broken, by reducing the weight of edges of the given tree, and also all edged should have the positive weight, moreover, the total weight of all edges should be as large as possible.
It is obvious that the strength of edges can not be negative, however it can equal zero if the weight of the subtree equals zero.
The first line contains the integer n (1 ≤ n ≤ 2·105) — the number of vertices in the tree. The next n - 1 lines contains the description of edges. Each line contains four integers x, y, w, p (1 ≤ x, y ≤ n, 1 ≤ w ≤ 109, 0 ≤ p ≤ 109), where x and y — vertices which connect the edge (the vertex number x is the parent of the vertex number y), w and p are the weight and the strength of the edge, accordingly. It is guaranteed that the edges describe the tree with the root in the vertex 1.
If it is impossible to get unbroken tree from the given tree, print -1 in the only line.
Otherwise, the output data should contain n lines:
In the first line print the number n — the number of vertices on the tree.
In the next n - 1 lines print the description of edges of the resulting tree. Each line should contain four integers x, y, w, p(1 ≤ x, y ≤ n, 1 ≤ w ≤ 109, 0 ≤ p ≤ 109), where x and y — vertices, which the edge connects (the vertex number x is the parent of the vertex number y), w and p are the new weight and the strength of the edge, accordingly.
Print edges in the same order as they are given in input data: the first two integers of each line should not be changed.
31 3 5 73 2 4 3
31 3 5 73 2 4 3
41 3 2 33 4 5 13 2 3 3
-1
51 2 2 42 4 1 94 5 5 64 3 4 8
51 2 2 42 4 1 94 5 1 24 3 2 6
71 2 5 22 3 4 31 4 3 74 5 4 14 6 3 26 7 1 6
71 2 5 22 3 2 11 4 3 74 5 3 04 6 3 26 7 1 6
思路:直接不好算,先将所有边重量降到最低,然后再加到最高,前者从下往上,后者从上往下就能保证最优解。
# include <bits/stdc++.h>using namespace std;typedef long long LL;const int maxn = 2e5+30;struct node{ int u, v, next; LL w, p, c;}edge[maxn<<1];int Next[maxn], cnt=0;LL sum[maxn]={0};void link(int u, int v, LL w, LL p){ edge[cnt] = {u, v, Next[u], w, p, 0}; Next[u] = cnt++;}void dfs(int u){ for(int i=Next[u]; i!=-1; i=edge[i].next) { int v = edge[i].v; dfs(v);//先减儿子。 sum[u] += sum[v]; LL tmp = min({edge[i].w-1, edge[i].p, edge[i].p-sum[v]}); if(tmp < 0) {puts("-1");exit(0);} edge[i].w -= tmp;//后减自身。 edge[i].p -= tmp; edge[i].c = tmp; sum[u] += edge[i].w; }}LL dfs2(int u, LL x){ LL use = 0; for(int i=Next[u]; i!=-1; i=edge[i].next) { int v = edge[i].v; LL tmp = min(edge[i].c, x);//先加自身。 edge[i].w += tmp; edge[i].p += tmp; x -= tmp; use += tmp; LL val = dfs2(v, min(x, edge[i].p-sum[v]));//后加儿子。 x -= val; use += val; } return use;}int main(){ int n, a, b; LL c, d; scanf("%d",&n); memset(Next, -1, sizeof(Next)); for(int i=1; i<n; ++i) { scanf("%d%d%lld%lld",&a,&b,&c,&d); link(a, b, c, d); } dfs(1); dfs2(1, 1LL<<60); printf("%d\n",n); for(int i=0; i<cnt; ++i) printf("%d %d %lld %lld\n",edge[i].u, edge[i].v, edge[i].w, edge[i].p); return 0;};
- CF758E:Broken Tree(DFS & 思维)
- Codeforces 430C Xor-tree【Dfs+思维】
- Hrbust 2302 Another Tree【思维+Dfs】
- hdu2369 Broken Keyboard(类似dfs)
- Maze(codeforces377a)dfs,思维
- Codeforces 618D Hamiltonian Spanning Tree【思维+Dfs】
- Codeforces Round #358 (Div. 2)——C. Alyona and the Tree(树的DFS+逆向思维)
- Colorful Tree(逆向思维)
- 100. Same Tree (DFS)
- 101. Symmetric Tree(DFS)
- AtCoder:Hamiltonish Path(思维 & dfs)
- AtCoder:Fennec VS. Snuke(dfs & 思维)
- HDU4118:Holiday's Accommodation(思维 & dfs)
- CodeChef:Chef and Subsequences(思维 & dfs)
- HDU5527:Too Rich(DFS & 贪心 & 思维)
- BZOJ1064:假面舞会(DFS & 思维)
- UESTC 1051 Eggs broken【思维+期望Dp】
- Codeforces 682C Alyona and the Tree【Dfs+YY思维】好题
- SQL截非标准字符串:CHARINDEX函数调用方法
- 错误:找不到或无法加载主类
- 【R笔记】R机器学习(十四)——BP神经网络
- 光照模型
- mysql 取差集和取交集
- CF758E:Broken Tree(DFS & 思维)
- linux work 2 -vi
- Android开发 之 viewGroup视图动画
- kubernetes1.7新特:kubectl支撑中文字符集
- mysql5.6连接遇到的问题
- linux /sys目录下各个子目录的具体说明
- 最短路径问题
- StringUtils.join的用法:
- CSS基础语法