代码

#include "router.h"
#include <arpa/inet.h>

struct pp {pp* left, *right; unsigned refer;} pool[9999999]; int ppcnt=0;
pp* insert(pp*& pos) {if(!pos)pos=pool+ ++ppcnt; return pos;}
pp& insert(int depth, unsigned pos) {pp* p=pool; for(int i=0; i<pos; ++i) {
p=insert(pos&0x80000000?p->right:p->left), pos<<=1;
}
return *p;
}
void init(int n, int q, const RoutingTableEntry *a) {
	for(int i=0; i<n; ++i) insert(a[i].len,htonl(a[i].addr)).refer=a[i].nexthop;
}

unsigned query(unsigned addr) {addr=htonl(addr);
	unsigned res=0;pp* p=pool;
	do {
		if(p->refer)res=p->refer;p=addr&0x80000000?p->right:p->left;

}
	while(p);return res;
}

评测结果