=====比赛信息===== * **日期:2020.8.6** * **比赛地址:** [[https://codeforces.com/group/azDPdoF24f/contest/290092/standings/groupmates/true|传送门]] * **做题情况:lxh(A),tyx(C),gyp(G)** =====题解===== ====A - ==== ===solved by === ===题意=== ===数据范围=== ===题解=== ====B - ==== ===solved by === ===题意=== ===数据范围=== ===题解=== ====C - Crazy Dreamoon==== ===solved by tyx=== ===题意=== 给出$N$条线段,问有多少个格子被至少一条线段穿过了 ===数据范围=== $N \le 2000$,所有的坐标在$[0,2000]$ ===题解=== 直接枚举每一条线段横坐标移动1的时候纵坐标覆盖了哪些格子,最后统计答案。不过由于没注意线段输入的顺序WA了6次 ====D - ==== ===solved by === ===题意=== ===数据范围=== ===题解=== ====E - ==== ===solved by === ===题意=== ===数据范围=== ===题解=== ====F - ==== ===solved by === ===题意=== ===数据范围=== ===题解=== ====G - ==== ===solved by === ===题意=== ===数据范围=== ===题解=== ====H - ==== ===solved by === ===题意=== ===数据范围=== ===题解=== ====I - ==== ===solved by === ===题意=== ===数据范围=== ===题解=== ====J - ==== ===solved by === ===题意=== ===数据范围=== ===题解=== ====K - ==== ===solved by === ===题意=== ===数据范围=== ===题解=== =====Replay===== 第一小时:看完题后gyp开始想J,lxh开始想A,tyx开始想C并发现C比较简单,写完后却WA 第二小时:tyx的C一直WA,gyp开始帮tyx找精度问题,tyx开始想I,gyp发现了tyx的C题的问题并通过 第三小时:CF炸了导致tyx不知道I是否正确,lxh写出A上交,tyx开始想E 第四小时:CF的评测恢复,tyx发现I题WA了以后重新开始想I,lxh之前交的A通过,gyp写出了G但是TLE 第五小时:gyp想出了G的问题并通过,tyx并没能写出I =====总结===== * 写题的时候要尽可能注意数据可能出现的形式