树

1、Codeforces 501C Misha and Forest

参考：http://blog.csdn.net/codebattle/article/details/42652037

题意：

给出树中每个点的度和与该点相邻的点的异或值，输出图的每条边

解题思路：

度为 1 的点为叶子节点，叶子节点相邻的点的异或值为它相邻的点

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <vector>
#include <stack>
#include <map>
#include <set>
#include <cmath>
#include <cctype>
#include <bitset>
#include <ctime>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define lson low, mid, _id<<1
#define rson mid+1, high, _id<<1|1

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> Pair;

const ll mod = 1e9 + 7;
const int INF = 0x7fffffff;

int n, edge = 0, degree, s;
vector<Pair> V;
queue<int> Q;

int main()
{
#ifdef __AiR_H
    freopen("in.txt", "r", stdin);
#endif // __AiR_H
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        scanf("%d %d", °ree, &s);
        V.push_back(make_pair(degree, s));
        if (V[i].first == 1) {
            Q.push(i);
        }
        edge += V[i].first;
    }
    edge /= 2;
    printf("%d\n", edge);
    while (!Q.empty()) {
        int f = Q.front();
        Q.pop();
        if (V[f].first == 0) {
            continue;
        }
        --V[f].first;
        int u = V[f].second;
        --V[u].first, V[u].second ^= f;
        if (V[u].first == 1) {
            Q.push(u);
        }
        printf("%d %d\n", f, u);
    }
    return 0;
}