提交记录 10865
| 提交时间 |
评测时间 |
| 2019-10-06 19:49:51 |
2020-08-01 02:35:10 |
#include "router.h"
#include <cstdio>
#include <arpa/inet.h>
int n;
const RoutingTableEntry *a;
void init(int _n, int _q, const RoutingTableEntry *_a)
{
n = _n, a = (RoutingTableEntry *)_a;
}
unsigned query(unsigned addr)
{
addr = htonl(addr);
unsigned table_addr = 0;
unsigned nexthop = 0;
int len = -1;
// for (int i = n; i--;)
for (int i = 0; i < n; ++i)
if (a[i].len == 0 && len == -1)
nexthop = a[i].nexthop, len = 0;
else if ((len == -1 || a[i].len > len) && ((addr ^ htonl(a[i].addr)) & -(1 << 32 - a[i].len)) == 0)
{
nexthop = a[i].nexthop, len = a[i].len;
table_addr = htonl(a[i].addr);
}
// printip("table_addr", table_addr);
// printf("len = %d\n", len);
return nexthop;
}
| Compilation | N/A | N/A | Compile OK | Score: N/A | 显示更多 |
| Testcase #1 | 13.02 us | 24 KB | Accepted | Score: 25 | 显示更多 |
| Testcase #2 | 3.438 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-28 19:52:34 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠