代码

#include<bits/stdc++.h>
#include"router.h"
using namespace std;
const unsigned N=827300;
struct hasher{
	size_t operator()(const pair<unsigned,unsigned>&p)const{
		size_t tmp=hash<unsigned>()(p.first)+0x9e3779b9;
		return tmp^(hash<unsigned>()(p.second)+0x9e3779b9+(tmp<<6)+(tmp>>2));
	}
};
unordered_map<pair<unsigned,unsigned>,unsigned,hasher>hop;
unsigned next[N];
void init(int n,int q,const RoutingTableEntry*a){
	for(int i=0;i<n;++i){
		for(int j=1;j<=32-a[i].len;++j)hop[make_pair(a[i].addr&(1u<<j),32-j)]=a[i].nexthop;
	}
}
unsigned query(unsigned addr){
	unsigned len=31;
	while(addr){
		if(hop.find(make_pair(addr,len))!=hop.end())return hop[make_pair(addr,len)]； 
		addr>>=1;
		--len;
	}
	return 0;
}

评测结果