摘要:
思路:类似背包,直接搞#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define u64 unsigned lo... 阅读全文
摘要:
思路:把所有最短路找出来,然后跑一次就好了。把所有最短路找出来大概就是,把边反向,然后从e跑最短路。然后正向从s跑最短路。然后从s开始,每次跟着最短路(字典序最小)走。判断一条边是不是最短路,也就是dis[u]+d[v]+hehe=D#include#include#include#include#... 阅读全文
摘要:
思路:使用A*算法的搜索#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define u64 unsigned l... 阅读全文
摘要:
6300 Signed Binary Representation of IntegersComputing ax mod n for large integers x and n is the most time-consuming process in most public-keycrypto... 阅读全文