Codeforces Round #285 (Div. 2) C. Misha and Forest

最新推荐文章于 2022-11-22 23:15:14 发布

HonorKy

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量636

点赞数

分类专栏： Codeforces & Topcoder 文章标签： codeforces 异或运算

本文链接：https://blog.csdn.net/ShiAokai/article/details/42819929

版权

Codeforces & Topcoder 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Let'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 - 1he wrote 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 vertices adjacent 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 andsv 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.

Input

The 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.

Output

In 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 
   
3
2 3
1 0
1 0

     output 
   
2
1 0
2 0

     input 
   
2
1 1
1 0

     output 
   
1
0 1

Note

The 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".

题意：有一无环森林，N个顶点；给出每个顶点的度，和与之相连所有顶点号的异或和；输出所有遍。

题解：叶子节点的异或值是他的父节点,依次去除叶子并维持余下的森林个点的的度与异或和；

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cctype>
#include <queue>
#include <vector>
#define INF 0x7fffffff
#define eps (1e-9)
#define lenq 2<<16
#define maxn 199999999
#define clearto(s,x) memset(s,x,sizeof(s))
using namespace std;

int n, m, tot=0;
int deg[1025400],xors[102400];
int edge[2][1025400];
queue<int> que;

int main()
{
    //freopen("E:\DATA.txt","r",stdin);
    //int TT=1,tt=1;     scanf("%d",&TT);
    int i=0,j=0,k=0,t=0;
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d %d",°[i],&xors[i]);
        if(deg[i]==1)  que.push(i);
    }
    while(!que.empty())
    {
        int chl=que.front();   que.pop();
        if(deg[chl]==0)        continue;    //考虑最后一个可能出现进队后，度变零

        int fa=xors[chl];      //对于只有一个顶点与它相邻的叶子，xors就是邻点
        edge[0][tot]=chl;
        edge[1][tot]=fa;       tot++;
                                            //去除这片叶子并维持余下森林的 deg和xors
        deg[fa]--;   xors[fa] ^=chl;        // XOR：a^b=c 则a^c=b  b^c=a;
                                            //由于old^chl =new ;即有 new^chl = old ;
        if(deg[fa]==1)    que.push(fa);
    }
    printf("%d\n",tot);
    for(i=0;i<tot;i++){
        printf("%d %d\n",edge[0][i],edge[1][i]);
    }
    return 0;
}