CodeForces 260D Black And White Tree 贪心

原创 2015年11月17日 22:29:05

按s从小到大排序贪心地建边,并消耗完s。


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

int main() {
    static pair<int,int> v[2][100001];
    static int vv[2];
    int n,i,j,c,s;
    scanf("%d", &n);
    for(i=1;i<=n;i++) {
        scanf("%d%d",&c,&s);
        v[c][++vv[c]]=make_pair(s,i);
    }
    sort(v[0]+1,v[0]+1+vv[0]);
    sort(v[1]+1,v[1]+1+vv[1]);
    for(i=j=1;i<=vv[0]&&j<=vv[1];) {
        int t=min(v[0][i].first,v[1][j].first);
        printf("%d %d %d\n", v[0][i].second, v[1][j].second, t);
        v[0][i].first -= t;
        v[1][j].first -= t;
        if (v[0][i].first) j++;
        else if(v[1][j].first) i++;
        else if(i<vv[0]) i++;
        else j++;
    }
    return 0;
}


D. Black and White Tree
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

The board has got a painted tree graph, consisting of n nodes. Let us remind you that a non-directed graph is called a tree if it is connected and doesn't contain any cycles.

Each node of the graph is painted black or white in such a manner that there aren't two nodes of the same color, connected by an edge. Each edge contains its value written on it as a non-negative integer.

A bad boy Vasya came up to the board and wrote number sv near each node v — the sum of values of all edges that are incident to this node. Then Vasya removed the edges and their values from the board.

Your task is to restore the original tree by the node colors and numbers sv.

Input

The first line of the input contains a single integer n (2 ≤ n ≤ 105) — the number of nodes in the tree. Next n lines contain pairs of space-separated integers cisi (0 ≤ ci ≤ 10 ≤ si ≤ 109), where ci stands for the color of the i-th vertex (0 is for white, 1 is for black), and si represents the sum of values of the edges that are incident to the i-th vertex of the tree that is painted on the board.

Output

Print the description of n - 1 edges of the tree graph. Each description is a group of three integers viuiwi(1 ≤ vi, ui ≤ nvi ≠ ui0 ≤ wi ≤ 109), where vi and ui — are the numbers of the nodes that are connected by the i-th edge, and wi is its value. Note that the following condition must fulfill cvi ≠ cui.

It is guaranteed that for any input data there exists at least one graph that meets these data. If there are multiple solutions, print any of them. You are allowed to print the edges in any order. As you print the numbers, separate them with spaces.

Sample test(s)
input
3
1 3
1 2
0 5
output
3 1 3
3 2 2
input
6
1 0
0 3
1 8
0 2
0 3
0 0
output
2 3 3
5 3 3
4 3 2
1 6 0
2 1 0


版权声明:转载请注明 http://blog.csdn.net/huanghongxun/

相关文章推荐

Codeforces Round #158 (Div. 2)D. Black and White Tree(搜索 + 思维)

题目链接http://codeforces.com/contest/260/problem/D题目大意给你一棵树(注意不要出现环)的所有节点, 节点分为黑、白两类,只有不同颜色的节点才能相连, 每个节...

Codeforces Round #386 (Div. 2) D. Green and Black Tea 数论+贪心

题意:喝掉n袋茶,其中a袋绿茶b袋红茶,连续喝相同的茶最多k次,如果可以全喝完则输出喝茶的序列,如果不能则输出NO 数论+贪心 char a为个数多的那个茶的字母的代表,同理b为少的那个字母,aa为a...

Codeforces Round #386(Div. 2)D. Green and Black Tea【思维+构造】

D. Green and Black Tea time limit per test 1 second memory limit per test 256 megabytes i...

Codeforces Round #386 (Div. 2)D. Green and Black Tea

D. Green and Black Tea time limit per test 1 second memory limit per test 256 megabytes input ...

Codeforces Round #386 (Div. 2) D - Green and Black Tea

D. Green and Black Tea time limit per test 1 second memory limit per test 256 megabytes ...

【21.58%】【codeforces 746D】Green and Black Tea

time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard...

hdu 5905 Black White Tree 树dp

我们可以思考对一个子树如果他节点数固定那么黑点数一定是连续变化的,那我们可以很容易想到找到每个子树大小的黑点最大值和最小值也就是dp[i]表示子树大小为i的黑点最大值,dp1[i]为最小值,剩下的就是...

HDU 3911 Black And White

有原题的题。 自己写的时候,一直超时。悲催啊。 然后,上网看了下别人的解题报告,发现需要一个标记,用来表示是否需要翻转。这样,就不用每次都更新到连续的区间。(避免复杂度变高) ...

hdu 5583 Kingdom of Black and White【枚举】

Kingdom of Black and White Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K ...

cf 323A A. Black-and-White Cube 立体构造 不知道为什么当k为奇数时构造不出来 挺有趣的题目吧

A. Black-and-White Cube time limit per test 1 second memory limit per test 256 megabytes input st...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)