提交记录 10316


用户 题目 状态 得分 用时 内存 语言 代码长度
user1 router32. 测测你的路由器 Accepted 100 1.872 s 65376 KB C++11 2.00 KB
提交时间 评测时间
2019-09-17 16:09:11 2020-08-01 02:07:34
#include <unordered_map>
#include <arpa/inet.h>
#include "router.h"

std::unordered_map<unsigned, unsigned> M[33] = {

std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),

std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),

std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),

std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),
std::unordered_map<unsigned, unsigned>(88888),

};

void ins(const RoutingTableEntry *e) {
	M[e->len][(e->addr)] = e->nexthop;
}

void init(int n, int q, const RoutingTableEntry *tbl) {
	for (int i = 0; i < n; i++) {
		ins(tbl + i);
	}
}

unsigned query(unsigned addr) {
	addr = (addr);
	
	for (int i = 32; i >= 0; i--) {
		if (M[i].count(addr) > 0) {
			return M[i][addr];
		}
		addr &= ~(1u << (32 - i^24));
	}
	
	return 0;
}

CompilationN/AN/ACompile OKScore: N/A

Testcase #13.434 ms23 MB + 240 KBAcceptedScore: 25

Testcase #2140.305 ms63 MB + 864 KBAcceptedScore: 25

Testcase #31.006 s63 MB + 864 KBAcceptedScore: 25

Testcase #41.872 s63 MB + 864 KBAcceptedScore: 25


Judge Duck Online | 评测鸭在线
Server Time: 2026-03-29 18:26:26 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠