网站首页
编程语言
数据库
系统相关
其他分享
编程问答
Cangqian
2024-10-03
The 3rd Universal Cup. Stage 8: Cangqian
Preface战术最失败的一集,徐神从开场就被模拟题关住了,直到4h30min的时候才放出来然后剩下的题也开的不顺,最后感觉好多题都没写就7题下班了这场也是延续了之前几场的一贯画风,最后1h我在狂暴鸿儒一个题,然后挂飞了也没过,赛后稍微一想就发现又犯了个唐氏错误A.Bingo沟槽的
2024-09-11
The 3rd Universal Cup. Stage 8: Cangqian
C.ChallengeNPC考虑构造一个二分图,左边是\(1,3,5,7\)右侧是\(2,4,6,8\)。最优解肯定是一边全1,一边全2。如果\(1,2\)之间不连边,这\(2\)就会被染色为1,因此只要让\(2,3\)连边,\(3\)会被染色为\(2\),然后\(1,4\)连边,\(4\)也会被染色为\(5\),这时只要让\(2,5\)和\(4,5\)连边,\(5\)就
2024-09-09
The 3rd Universal Cup. Stage 8: Cangqian
题解:https://files.cnblogs.com/files/clrs97/ZJCPC24_Tutorial.pdf Code:A.Bingo#include<bits/stdc++.h>usingnamespacestd;stringn;intm;typedeflonglongll;llsum[1000005];intpw[1000005];boolall[1000005];intsol[1000020];voidsolv()