codeforces 501C （拓扑排序另类）

Misha and Forest
Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit

Status
Description
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 Input
Input
3
2 3
1 0
1 0
Output
2
1 0
2 0
Input
2
1 1
1 0
Output
1
0 1
Hint
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），然后给你每个点的度数 and 每个点的相邻点标号的异或和，让你把每条边输出
题解：我的解法是根据异或的规则，两个不同的数相异或，再异或两个其中的一个，得到的值是另一个数 eg： a^b^a == b or a^b^b == a；然后从度数为 1 的点开始，一点点找下去。

#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
#define M 100010
struct node
{
    int dv, sv, rank;
};
vector<int> vec[M];
node no[M];
int n;
void topo()
{
    queue<int> q;
    for(int i=0; i<n; i++)//把所有度数为 1 的点都压入队列
    {
        if(no[i].dv == 1)
        {
            q.push(i);
        }
    }
    int u, v, ans = 0;
    while(!q.empty())
    {
        u = q.front();
        q.pop();
        if(no[u].dv != 1)   continue;//度数在变化过程中可能会变成零 
        v = no[u].sv;//找到其相连的那个点
        no[u].dv--;//度数减一
        vec[u].push_back(v);//方便输出
        ans++;
        no[v].dv--;
        no[v].sv = no[v].sv ^ u;
        if(no[v].dv == 1)   q.push(v);
    }
    printf("%d\n", ans);
    for(int i=0; i<n; i++)
    {
        if(vec[i].size())
        {
            for(int j=0; j<vec[i].size(); j++)
            {
                printf("%d %d\n", i, vec[i][j]);
            }
        }
    }
}
int main()
{
    while(scanf("%d", &n) != EOF)
    {
        for(int i=0; i<n; i++)
        {
            vec[i].clear();
            scanf("%d%d", &no[i].dv, &no[i].sv);
            no[i].rank = i;
        }
        if(n == 1)
        {
            printf("0\n");
            continue;
        }
        topo();
    }

    return 0;
}