cf 158div2 D. Black and White Tree
来源:互联网 发布:彩票选号优化方法 编辑:程序博客网 时间:2024/06/06 14:04
题意很简单,给出一个树中每个点相连的边的权值和,和点的颜色,一条边上颜色不同,求出原图……
因为条件很少,所以必然是个spj,所以可以直接贪心,然后把最后剩余的0边挂到任意一点上即可
/*author:jxylang:C/C++university:China,Xidian University**If you need to reprint,please indicate the source***/#include <iostream>#include <cstdio>#include <cstdlib>#include <algorithm>#include <vector>#define INF 1E9using namespace std;#define mp make_pair#define f first#define s secondvector<pair<int,int> >v[2];int main(){ int n,i,j,k,t; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d",&t,&k); v[t].push_back(mp(k,i+1)); } sort(v[0].begin(),v[0].end()); sort(v[1].begin(),v[1].end()); for(i=j=0;i<v[0].size()&&j<v[1].size();) { k=min(v[0][i].f,v[1][j].f); printf("%d %d %d\n",v[0][i].s,v[1][j].s,k); v[0][i].f-=k;v[1][j].f-=k; if(v[0][i].f)j++; else if(v[1][j].f)i++; else if(i<v[0].size()-1)i++; else j++; } return 0;}
- cf 158div2 D. Black and White Tree
- Codeforces 260D - Black and White Tree
- CodeForces 260D Black And White Tree 贪心
- [agc014d]Black and White Tree
- Codeforces Round #158 (Div. 2)D. Black and White Tree(搜索 + 思维)
- hdu5905 Black White Tree
- Black And White
- Black And White
- Black and white hdu3633
- hdu3911 Black And White
- hdu3911---Black And White
- HDU5113 Black And White
- Black And White HDU
- Black And White
- codeforces #386 div2 D. Green and Black Tea
- codeforce 386(div2) D. Green and Black Tea
- CF(#294 div2):D. A and B and Interesting Substrings
- White, Black and White Again )(CodeForces
- DevExpress GridControl复合表头(多行表头)设置
- 电子商务网站-产品详情页面 产品详情导航随着页面浮动,保持在页面顶端
- SMARTFORMS遇到的几个问题总结
- SERVICE_STATUS结构各成员解析
- spi.c
- cf 158div2 D. Black and White Tree
- Android 根文件系统启动过程(init进程 详细分析)
- linux-时间相关结构体和函数
- 萧山JS
- c++与c#中概念的不同理解
- WCF项目中客户端与服务器时间问题步无法连接的解决方案 (供自己以后参考)
- Java指点江山
- 自己搭建的hadoop集群的全过程记录
- C# Heap(ing) Vs Stack(ing) in .NET: Part I