CodeForces 260D Black And White Tree 贪心
2015-11-17 22:29
369 查看
按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 ci, si (0 ≤ ci ≤ 1, 0 ≤ 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 vi, ui, wi(1 ≤ vi, ui ≤ n, vi ≠ ui, 0 ≤ 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
output
input
output
#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 ci, si (0 ≤ ci ≤ 1, 0 ≤ 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 vi, ui, wi(1 ≤ vi, ui ≤ n, vi ≠ ui, 0 ≤ 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
相关文章推荐
- Android源码阅读与理解(二):Android系统Build流程详解
- android.support.design.widget.Snackbar 使用
- 随笔记录
- 用java代码实现观察者模式
- 不得不提的volatile及指令重排序(happen-before)
- 独立任务最优调度问题
- iOS category内部实现原理
- 十进制转换为二进制
- Ubuntu下使用Tasksel安装LAMP
- 反射
- ReentrantLock和synchronized的区别
- QString 和 TCHAR 的相互转换
- Android设计模式-----依赖注入
- Cocos2dx-OpenGL ES2.0教程:编写自己的shader(2)
- 关于python 科学计算库的下载
- 机器学习分类算法应该如何选择?
- 内部类(转)
- (转载)Cocos2dx-OpenGL ES2.0教程:编写自己的shader(2)
- UI基础__ NSMutableAttributedString
- java 解析properties文件的两种方法