Codeforces Round #285 (Div. 2)-C. 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

3
2 3
1 0
1 0

output

2
1 0
2 0

input

2
1 1
1 0

output

1
0 1

找到所有的叶子，他的s值就是父节点，把父节点的degree减1,s值异或子节点的值，再找到所有叶子，循环操作

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#define maxn 100005
#define MOD 1000000007
using namespace std;
typedef long long ll;

int d[maxn], s[maxn];
vector<int> v[2];
vector<int> edge[maxn];
int main(){
	
//	freopen("in.txt", "r", stdin); 
	int n, ans = 0;
	scanf("%d", &n);
	for(int i = 0; i < n; i++){
	 scanf("%d%d", d+i, s+i);
	 if(d[i] == 1)
	  v[0].push_back(i); 
   }
   int k = 0;
   while(v[k].size()){
   	for(int i = 0; i < v[k].size(); i++){
   		int h = v[k][i];
   		if(d[h] == 0)
   		 continue;
   	    d[s[h]]--;
   	    s[s[h]] ^= h;
   	    edge[h].push_back(s[h]);
   	    ans++;
   	    if(d[s[h]] == 1){
   	    	v[k^1].push_back(s[h]);
   	    } 
   	}
   	v[k].clear();
   	k ^= 1;
   }
   printf("%d\n", ans);
   for(int i = 0; i < n; i++)
    for(int j = 0; j < edge[i].size(); j++)
	 printf("%d %d\n", i, edge[i][j]);
   return 0; 
}