提交记录 14325
| 提交时间 |
评测时间 |
| 2020-09-23 11:50:32 |
2020-09-23 11:51:07 |
#include "router.h"
#include <arpa/inet.h>
class RoutingTableEntry_z
{
public:
unsigned addr;
unsigned char len;
unsigned nexthop;
unsigned mask;
void set(RoutingTableEntry fr)
{
len = fr.len;
mask = -1;
mask >>= (32 - len);
mask <<= len;
nexthop = fr.nexthop;
addr = ntohl(fr.addr);
}
bool check(unsigned checkaddr)
{
if (addr & mask == checkaddr & mask)
return true;
return false;
}
}table[827090];
int N;
void init(int n, int q, const RoutingTableEntry *a) {
N = n;
for (int i = 0; i < n; i++)
table[i].set(a[i]);
}
unsigned query(unsigned addr) {
addr = ntohl(addr);
int len = -1;
unsigned nexthop = 0;
for (int i = 0; i < N; i++)
{
if (table[i].check(addr) && table[i].len > len)
{
len = table[i].len;
nexthop = table[i].nexthop;
}
}
// int ret = -1;
// for (int l = 0, r = N - 1; l <= r;)
// {
// int mid = (l + r) >> 1;
// if (table[mid].check(addr))
// {
// ret = mid;
// l = mid + 1;
// }
// else if (table[mid].addr < addr) l = mid + 1;
// else r = mid - 1;
// }
// return ret == -1 ? 0 : table[ret].nexthop;
return nexthop;
}
| Compilation | N/A | N/A | Compile OK | Score: N/A | 显示更多 |
| Testcase #1 | 13.41 us | 28 KB | Accepted | Score: 25 | 显示更多 |
| Testcase #2 | 5.247 ms | 22 MB + 112 KB | Wrong Answer | Score: 0 | 显示更多 |
| Testcase #3 | 30 s | 22 MB + 108 KB | Time Limit Exceeded | Score: 0 | 显示更多 |
| Testcase #4 | 30 s | 22 MB + 108 KB | Time Limit Exceeded | Score: 0 | 显示更多 |
Judge Duck Online | 评测鸭在线
Server Time: 2026-03-22 18:07:33 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠