codeforces round 285 div285 Misha and Forest
2015-01-16 10:07
447 查看
C. Misha and Foresttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's define a forest as a non-directed acyclic graph (also without loops and parallel edges). One day Misha played with the forest consisting of n vertices.For each vertex v from 0 to n - 1 hewrote down two integers,degreev and sv,were the first integer is the number of vertices adjacent to vertex v, and the second integer is the XOR sum of the numbers of verticesadjacent to v (if there were no adjacent vertices, he wrote down 0).Next day Misha couldn't remember what graph he initially had. Misha has values degreev and sv left,though. Help him find the number of edges and the edges of the initial graph. It is guaranteed that there exists a forest that corresponds to the numbers written by Misha.InputThe first line contains integer n (1 ≤ n ≤ 216),the number of vertices in the graph.The i-th of the next lines contains numbers degreei and si (0 ≤ degreei ≤ n - 1, 0 ≤ si < 216),separated by a space.OutputIn the first line print number m, the number of edges of the graph.Next print m lines, each containing two distinct numbers, a and b (0 ≤ a ≤ n - 1, 0 ≤ b ≤ n - 1),corresponding to edge (a, b).Edges can be printed in any order; vertices of the edge can also be printed in any order.Sample test(s)input
32 31 01 0output
21 02 0input
21 11 0output
10 1NoteThe XOR sum of numbers is the result of bitwise adding numbers modulo 2. This operation exists in many modern programming languages. For example,in languages C++, Java and Python it is represented as "^", and in Pascal — as "xor".原题链接:http://codeforces.com/contest/501/problem/C题目大意:输入数据是个森林,要你输出所有的边。变相的拓扑排序。。
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <set>#include <queue>#include <vector>using namespace std;#define maxn 70000#define inf 0x7ffffffint n;struct Node{int index;int de;int sum;};Node arr[maxn];queue<Node> q;int main(){scanf("%d",&n);int degree = 0;while(!q.empty()){q.pop();}for(int i = 0; i < n; i++){int x,y;scanf("%d%d",&x,&y);arr[i].index = i;arr[i].de = x;arr[i].sum = y;degree += x;if(x == 1){q.push(arr[i]);}}printf("%d\n",degree/2);while(!q.empty()){Node tmp = q.front();q.pop();arr[tmp.index].de = 0;if(arr[tmp.sum].de != 0){printf("%d %d\n",tmp.index,tmp.sum);}arr[tmp.sum].de--;arr[tmp.sum].sum ^= tmp.index;if(arr[tmp.sum].de == 1){q.push(arr[tmp.sum]);}}return 0;}
相关文章推荐
- Codeforces Round #285 (Div. 2) C. Misha and Forest
- Codeforces Round #285 (Div. 2) C. Misha and Forest
- Codeforces Round #285 (Div. 2) C. Misha and Forest
- Codeforces Round #285 (Div. 2) C. Misha and Forest
- B. Misha and Changing Handles(Codeforces Round 285(div2))
- Codeforces Round #285 (Div.1 B & Div.2 D) Misha and Permutations Summation --二分+树状数组
- Codeforces Round #285 (Div. 1)B. Misha and Permutations Summation(数学+数据结构打脸)
- Codeforces Round #285 (Div. 2) ---B. Misha and Changing Handles
- Codeforces Round #285 (Div. 2) D. Misha and Permutations Summation 康托展开 树状数组+二分
- Codeforces Round #425 (Div. 2) Problem D Misha, Grisha and Underground (Codeforces 832D) - 树链剖分 - 树状数组
- Codeforces Round #425 (Div. 2) D. Misha, Grisha and Underground
- CodeFroces # 285 DIV2 C. Misha and Forest
- Codeforces #285 C Misha and Forest 队列维护 解题报告
- Codeforces Round #425 (Div. 2) D.Misha, Grisha and Underground
- Codeforces Round #425 (Div. 2) D.Misha, Grisha and Underground
- Codeforces Round #293 (Div. 2) A. Vitaly and Strings(思路)
- Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals) A. Andryusha and Socks
- Codeforces Round #201 (Div. 1) A. Alice and Bob(数学)
- Codeforces Round #371 (Div. 2) C. Sonya and Queries (map)
- Codeforces AIM Tech Round (Div. 1) A Graph and String 想法