晚上躺在床上的时候,思维随机发散,想到了独立集。但当时有点太发散了,意识到是独立集之后也没会做,有点纠结独立集结论的正确性。第二天起床,立马意识到了这是一张二分图,又简单证了一下独立集的结论,就投给杜老师了。 其实后面还出了一个题,我自己感觉非常深刻,是个不可多得的好题,但杜老师已经不缺投了...
大概是赛前一个月，我得知本次 EC Final 还会办一场华为挑战赛。不过我发现 DOMJudge 并不能支持华为...
大概是赛前一个月，我得知本次 EC Final 还会办一场华为挑战赛。不过我发现DOMJudge并不能支持华为挑...
B. Binary String 给定一个01串a0a1⋯an−1,定义一次变换如下:对于所有0≤i<n,若ai=0且a(i+1)modn=1,交换ai和a(i+1)modn。求有多少个本质不同的01串满足能够从a变换若干次得到,答案对998244353取模。 1≤n≤107。 很炫酷的题。 以下的 “段” 均指长度大于1的0或1的连续段。手玩一下能够...
(VSC) topologies and the unique features of current-source converter approaches – today solely employed in thyristor-based high-power medium-voltage motor drives - and AC/AC matrix converter concepts over state-of-the-art ...
EC-Final银奖 7月20日,第46届国际大学生程序设计竞赛EC-Final(ICPC Asia-East Continental Final Contest)顺利举办。我院18级学生杜昊、18级学生徐润天、20级学生何云康组成的“朱朱带我们圆梦华五吧”代表队(指导教师:蒋敏)在比赛中沉着冷...
As a final point, if any malicious actor would be able to obtain access to your labs computer infrastructure, it is likely that they will be able to use this to access information actually available via external providers or services. So total risk should always include the local lab security...
Gym - 101775J(2017 EC final) - 差分序列 点击这里 解题思路: 差分序列:b[i] = a[i] - a[i-1] 原序列为: 1 4 5 8 7 差分后: 1 3 1 3 -1 -7,多出来的以为可以看做0 - a[n]. 差分序列的性质:前i项和等于原序列的a[i],这个很容易就能证明...
The network training parameters were fine-tuned through multiple experiments to optimize the model’s convergence speed and detection performance. The initial and final learning rates were set to account for rapid convergence at the beginning of training and fine optimization at later stages. A batch...
CF388C&&2018EC Final D题——博弈&&水题 一下两个题目都是按堆取石子,轮流取,每个人都贪心的取即可,感觉都不像博弈。 CF388C 有n排石子,每排有若干堆。Ciel可以选择一排,拿走这一排的第一堆石子。Jiro可以选择一排,拿走这一排的最后一堆石子。两个人都想要让自己的石子数量最多。问两个人最后的石子...