提交记录 13300
| 提交时间 |
评测时间 |
| 2020-08-01 10:04:26 |
2020-08-01 10:04:30 |
#include<bits/stdc++.h>
#include<arpa/inet.h>
#include"router.h"
using namespace std;
unordered_map<unsigned,unsigned>hop[33];
void init(int n,int q,const RoutingTableEntry*a){
for(int i=0;i<n;++i){
hop[a[i].len][htonl(a[i].addr)]=a[i].nexthop;
}
}
unsigned query(unsigned addr){
addr=htonl(addr);
for(int i=32;~i;--i){
if(hop[i].find(addr)!=hop[i].end())return hop[i][addr];
addr&=(unsigned)((1ll<<(32-i))-1);
}
return 0;
}
| Compilation | N/A | N/A | Compile OK | Score: N/A | 显示更多 |
| Testcase #1 | 38.29 us | 36 KB | Accepted | Score: 25 | 显示更多 |
| Testcase #2 | 151.359 ms | 42 MB + 320 KB | Accepted | Score: 25 | 显示更多 |
| Testcase #3 | 567.255 ms | 42 MB + 320 KB | Wrong Answer | Score: 0 | 显示更多 |
| Testcase #4 | 974.166 ms | 42 MB + 320 KB | Wrong Answer | Score: 0 | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2026-03-24 14:23:22 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠