codeforces 501C. Misha and Forest

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

Examples

input

Copy

3
2 3
1 0
1 0

output

Copy

2
1 0
2 0

input

Copy

2
1 1
1 0

output

Copy

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个顶点 接下来n行都有两个数 第一个是与此顶点相连的点  第二个与此顶点相连的点的XOR和，然后输出图中所有边

思路：我们发现当d[u]==1 的时候， 我们就能确定一条边及u--v v为s[u]  然后s[v]^=u d[v]--  将u点移除 相应的与u相连的v s[v] d[v]都移除u这个点。

我们一直处理度为1的点就可以了

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(a,b) memset(a,b,sizeof(a))
#define P pair< int , int >
#define pb push_back
#define eps 1e-6
#define MOD 1e9+7
#define pll pair<int ,int >
const int maxn= 100000+10;
const int INF = 0x3f3f3f3f;
vector< pll > e;
int d[maxn],s[maxn];
int main()
{
    int n,u,v;
    cin>>n;
    queue<int> q;
    for(int i=0;i<n;i++)
    {
        cin>>d[i]>>s[i];
        if(d[i]==1)
            q.push(i);
    }
    while(!q.empty())
    {
        int u=q.front();
        q.pop();
        if(d[u]==1)
        {
            int v=s[u];
            e.pb(make_pair(u,v));
            d[v]--;
            s[v]^=u;
            if(d[v]==1)
                q.push(v);
        }
    }
        cout<<e.size()<<endl;
        for(auto x:e)
            cout<<x.first<<" "<<x.second<<endl;
}

View Code

 

 

 

 PS：摸鱼怪的博客分享，欢迎感谢各路大牛的指点~

转载于:https://www.cnblogs.com/MengX/p/9329834.html