Day -2(1月23日) 今天并不属于WC的日程,我写这些,只是为了感慨一下过去的一年.2015年,可以说是我的OI史上最惨烈的一年,一年下来没有一次好成绩: HAOI2015:预测:30+50+0+10+30=120.结果:0+0+0+0+0=0. NOI2015同步赛:预测:......结果:......Fe滚粗 NOIP2015:(!!!)预测:100+100+100+100+100+80=580.结果:100+100+0+60+0+30=290. 这些都是教训.我不想过多地反思,也不会

emmmm蒟蒻的我爆零啦!!T1码了个dijikstra然后T了,正解为Floyd.T2蒟蒻并不会,唯一会的只有暴力..T3写了个Trie然后MLE了,然而正解是 哈希.T4是蒟蒻唯一一道会的,然而却忘了开long long.手动GG.. <T1> 题意:在一个有向图中,求从指定起点到指定终点的最小值,最小值定义为路径上的边权和减去路径上点权的最小值. 超时代码: #include<cstdio> #include<algorithm> #define maxn 300

我终于第一次打上了梦寐以求的橙色段,我想,至少证明了我不蠢吧,接下来就要学套路了,大概理一下接下来的时间安排和要做的事情吧. ICPC 实习 按照约定,应该跟着x老师做实习了. 知识 要全面系统地学习ICPC的知识,而不是像这样靠抖机灵上橙色,使用dalao们写的教学课件,持续的学习进度在下面更新. 课件链接:https://github.com/hzwer/shareOI 比赛 按照约定,暂时就不(强行熬夜)打CF了,学一些别的东西,集训队安排的训练也从今天开始略微认真一点做吧. 题单 要认真

貌似咕了三个半月了(gym101915里一道),今天又遇到一道(cf1105E),就学了学惹. 最大团定义:图上取尽可能多的点,这些点构成一个完全图. 最大独立集:图上取尽可能多的点,任意两点间不连接. 可以看出来   一个图的最大团==它的补图的最大独立集 叭 那么我们可以搜索哇!(我不会搜索哇) 一个最朴素的搜索思想:  维护几个点集,当前已选择的,可以选择的,然后每次从可选择的点集里选一个与当前已选择的点都有边的点加进来,然后更新可选择的点集. 这个复杂度就比较恐怖哇 简单的优化:对点排序

2018 Petrozavodsk Winter Camp, Yandex Cup contest link: 2018 Petrozavodsk Winter Camp, Yandex Cup diary:2019.7.14 team solution: 戳 solve 6 of 11, Rank 26 of 60 A B C D E F G H I J K O O O O O X O explanatory O:比赛中AC X:赛后卜了 ??:口头AC 原文地址:https://www.cn

Description Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue- The Lunar New Year was approaching, but unluckily the Little Cat still had schedules going here and there. Now, he ha

Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 16196   Accepted: 8059 Description Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue- The Lunar New Year wa

Language: Default Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 13847   Accepted: 6926 Description Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue- The

Buy Tickets Time Limit: 4000MS   Memory Limit: 65536K Total Submissions: 13277   Accepted: 6595 Description Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue- The Lunar New Year wa