随笔分类 - codeforces补题
摘要：Codeforces Round #697 (Div. 3)补题 昨天晚上看到不计rating，加之评测机非常卡就没有再打了，今天把剩下三个题补了。 D. Cleaning the Phone $~~~~$晚上做的时候想复杂了，其实所有的convenience points只有两个值1和2，所以可以
阅读全文
摘要：E - Rotate and Flip 补题 ####题意 平面上有n个点，有m次操作，每次操作涉及点的绕原点旋转与关于直线对称。之后q次询问，每次询问某个点在某次操作后的坐标 ####题解 果然大一线代没学好后患无穷。每次操作可以视为点的坐标乘一个变换矩阵，左乘右乘都可以，这样第$i$次操作之后点
阅读全文
摘要：###1433F - Zero Remainder Sum $$动态规划，$dp[i][j][p][q]$表示在第$i$行，第$j$列，已经在这一行选取了$p$个元素，且目前的元素和对$k$取模是$q$时的最大和，首先有$dp[1][0][0][0]=0$。可以采用递推的方式由当前状态向下一个状态递
阅读全文
摘要："A. Orac and Factors" 一个偶数每次操作后都会加2，一个奇数第一次操作后会变成偶数 代码 pragma GCC optimize(2) include include include include include include include include include
阅读全文
摘要："A. Puzzle Pieces" 首先只有一行或只有一列是可以拼出来的。之后可以猜出剩下的情况只有2x2可以，拼图只有一条边凹进去，构造过程中不难发现这一点。比较简单的写法是判断m+n =mn 代码 pragma GCC optimize(2) include include include i
阅读全文
摘要："A. Candies" 等比数列求和之后得到k和x的式子，枚举k即可，因为是幂函数，k并不会很大 代码 include include include include include include include include include include include include d
阅读全文
摘要："A. Ichihime and Triangle" 输出以a c c为三条边的等边三角形即可 代码 include include include include include include include include include include include define INF
阅读全文
摘要："A. Little Artem" 不难发现，左上角是白色，其余是黑色就是满足题意的。。。 代码 include include include include include include include include include include include define INF 0x
阅读全文
摘要："A. Exercising Walk" 指定各个移动方向的移动次数，终点就是确定的，所以只要判断终点在不在范围之内，多余的步数让猫反复横跳就行了。要注意如果边界x1==x2，那么猫就不能左右移动，y轴也同理 代码 "B. Composite Coloring" 前十一个素数分别是2,3,5,7,1
阅读全文
posted @ 2020-04-01 21:48
DinoMax
摘要：这次div3打的过于自闭，各种进不去页面，各种WA，各种智障思路...... 下次网络再卡试试这个，或者挂个梯子吧。 赛后看题解发现交上去的题似乎都想麻烦了，于是决定重补一遍，洗心革面，重新做人。 Tutorial A 输入两个数a、b， 问a最少增加多少可以成为b的倍数。 假设a是kb+m,那么只
阅读全文
posted @ 2020-03-29 23:49
DinoMax
浙公网安备 33010602011771号