提交记录 10697
| 提交时间 |
评测时间 |
| 2019-09-27 10:29:03 |
2020-08-01 02:19:54 |
#include "router.h"
int n_entries;
unsigned one_bit_prefix[33], addr_mask[33];
RoutingTableEntry *routing_table;
void init(int n, int q, const RoutingTableEntry *a) {
n_entries = n;
routing_table = (RoutingTableEntry*) a;
for (unsigned i = 1; i <= 32; ++ i)
one_bit_prefix[i] = one_bit_prefix[i - 1] | (1ul << (32ul - i));
for (int i = 0; i < n_entries; ++ i)
routing_table[i].addr &= one_bit_prefix[routing_table[i].len];
}
unsigned query(unsigned addr) {
for (int i = 0; i <= 32; ++ i)
addr_mask[i] = addr & one_bit_prefix[i];
int max_length = -1;
unsigned nexthop;
for (int i = 0; i < n_entries; ++ i) {
if (addr_mask[routing_table[i].len] == routing_table[i].addr && routing_table[i].len > max_length) {
max_length = routing_table[i].len;
nexthop = routing_table[i].nexthop;
}
}
if (max_length == -1)
return 0;
return nexthop;
}
| Compilation | N/A | N/A | Compile OK | Score: N/A | 显示更多 |
| Testcase #1 | 12.13 us | 24 KB | Accepted | Score: 25 | 显示更多 |
| Testcase #2 | 3.684 ms | 9 MB + 500 KB | Accepted | Score: 25 | 显示更多 |
| Testcase #3 | 30 s | 9 MB + 496 KB | Time Limit Exceeded | Score: 0 | 显示更多 |
| Testcase #4 | 30 s | 9 MB + 496 KB | Time Limit Exceeded | Score: 0 | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2026-03-29 02:44:21 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠