codeforces 501C Misha and Forest(思维题)

题目链接

Misha and Forest

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 - 1 he 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 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.

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个点的森林图，点的编号为0到n-1。已知每个点的度，每个点的所有相邻点的异或值。输出这个图的边。

题解：由于图是个森林，所以一定存在度为1的点，而度为1的点相邻的点只有一个，我们就可以确定与它相邻的点。删除这个度为1的点以后，更新与它相邻的点的度和相应的异或值。继续找度为1的点，直到所有的点都被删除。这时我们就求出整个图了。

代码如下：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<stdlib.h>
#include<vector>
#define inff 0x3fffffff
#define nn 110000
#define mod 1000000007
typedef long long LL;
const LL inf64=inff*(LL)inff;
using namespace std;
int d[nn],s[nn];
int n;
queue<int>que;
vector<pair<int,int> >ans;
void solve()
{
    ans.clear();
    while(que.size())
        que.pop();
    int i;
    for(i=0;i<n;i++)
    {
        if(d[i]==1)
        {
            que.push(i);
        }
    }
    int sta;
    int ix;
    while(que.size())
    {
        sta=que.front();
        que.pop();
        if(d[sta]==0)
            continue;
        ans.push_back(make_pair(sta,s[sta]));
        d[sta]--,d[s[sta]]--;
        ix=s[sta];
        s[ix]^=sta;
        if(d[ix]==1)
        {
            que.push(ix);
        }
    }
}
int main()
{
    int i;
    while(scanf("%d",&n)!=EOF)
    {
        for(i=0;i<n;i++)
        {
            scanf("%d%d",&d[i],&s[i]);
        }
        solve();
        int la=ans.size();
        printf("%d\n",la);
        for(i=0;i<la;i++)
        {
            printf("%d %d\n",ans[i].first,ans[i].second);
        }
    }
    return 0;
}