uvalive 7043(trie)

题意：给出n个IPv4的子网地址，格式是a-b-c-d/l，a b c d l都是十进制数，然后l是网络地址的长度，最长到32，要求输出最低限度的所有的未能划分出的子网地址，这些子网和给出的n个子网没有交集，这些地址和给出的n个地址能组成完整的网络地址。
题解：把给出的所有子网地址建字典树，然后暴力递归找所有未被包含在已有子网里的子网地址。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int N = 500005;
char str[40];
int n, cnt, ch[N][2], val[N], sz, ans[40];
struct IP {
    int a, b, c, d, l;
    IP(int a, int b, int c, int d, int l):a(a), b(b), c(c), d(d), l(l) {}
};
vector<IP> res;

void solve(int x) {
    for (int i = 7; i >= 0; i--) {
        if (x & (1 << i))
            str[cnt++] = '1';
        else
            str[cnt++] = '0';
    }
}

void insert(char *s, int len) {
    int u = 0;
    for (int i = 0; i < len; i++) {
        int k = s[i] - '0';
        if (!ch[u][k]) {
            memset(ch[sz], 0, sizeof(ch[sz]));
            val[sz] = 0;
            ch[u][k] = sz++;
        }
        u = ch[u][k];
    }
    val[u] = 1;
}

void query(int u, int cur) {
    if (val[u])
        return;
    for (int i = 1; i >= 0; i--) {
        ans[cur] = i;
        if (!ch[u][i]) {
            int a[4];
            for (int j = 0; j <= 3; j++) {
                int temp = 0, st = j * 8, en = j * 8 + 7;
                for (int k = st; k <= en; k++)
                    temp = temp * 2 + ans[k];
                a[j] = temp;
            }
            res.push_back(IP(a[0], a[1], a[2], a[3], cur));
        }
        else
            query(ch[u][i], cur + 1);
    }
}

int main() {
    int t, cas = 1;
    scanf("%d", &t);
    while (t--) {
        res.clear();
        sz = 1;
        memset(ch[0], 0, sizeof(ch[0]));
        scanf("%d", &n);
        if (n == 0) {
            printf("Case #%d\n1\n0.0.0.0/0\n", cas++);
            continue;
        }
        int a, b, c, d, l;
        for (int i = 0; i < n; i++) {
            scanf("%d.%d.%d.%d/%d", &a, &b, &c, &d, &l);
            cnt = 0;
            solve(a), solve(b), solve(c), solve(d);
            str[cnt] = 0;
            insert(str, l);
        }
        query(0, 0);
        int len = res.size();
        printf("Case #%d:\n%d\n", cas++, len);
        for (int i = 0; i < len; i++)
            printf("%d.%d.%d.%d/%d\n", res[i].a, res[i].b, res[i].c, res[i].d, res[i].l + 1);
    }
    return 0;
}