代码

#include <unordered_map>
#include "router.h"

std::unordered_map<long long, unsigned> M;

void ins(const RoutingTableEntry *e) {
	M[1LL*e->len<<32|e->addr] = e->nexthop;
}

void init(int n, int q, const RoutingTableEntry *tbl) {
	for (int i = 0; i < n; i++) {
		ins(tbl + i);
	}
}

unsigned query(unsigned addr) {
	
	for (int i = 32; i >= 0; i--) {
		if (M.count(1LL*i<<32|addr)) {
			return M[i<<32LL|addr];
		}
		addr &= (1u<<i-1)-1;
	}
	
	return 0;
}

评测结果