前言
这次ABC还是有一点难度的吧.
TaskA Security
Solution
直接模拟就好了.
Code
/*
mail: [email protected]
author: MLEAutoMaton
This Code is made by MLEAutoMaton
*/
#include
#include
#include
#include
#include
#include
#include
#include
TaskB Bite Eating
Solution
直接枚举删除那个然后判断就行了.
Code
/*
mail: [email protected]
author: MLEAutoMaton
This Code is made by MLEAutoMaton
*/
#include
#include
#include
#include
#include
#include
#include
#include
TaskC Anti-Division
Solution
求个\(gcd\)容斥就行了.
Code
/*
mail: [email protected]
author: MLEAutoMaton
This Code is made by MLEAutoMaton
*/
#include
#include
#include
#include
#include
#include
#include
#include
TaskD Megalomania
Solution
直接按照最晚完成时间排序然后模拟就行.
Code
/*
mail: [email protected]
author: MLEAutoMaton
This Code is made by MLEAutoMaton
*/
#include
#include
#include
#include
#include
#include
#include
#include
TaskE Friendships
Solution
考虑菊花图是最多的,那么一步一步往菊花图里面加边就行了.
Code
/*
mail: [email protected]
author: MLEAutoMaton
This Code is made by MLEAutoMaton
*/
#include
#include
#include
#include
#include
#include
#include
#include
TaskF Must Be Rectangular!
Solution
\(yyb\)就是神仙!!!
考虑把一个点的\(x,y\)分割,那么就相当于\(x\)->\(y\)连边,然后就有考虑一个联通块肯定可以搞成完全图,那么完全图的边数就是点数...
最后直接减去最初的点数就没了.
Code
/*
mail: [email protected]
author: MLEAutoMaton
This Code is made by MLEAutoMaton
*/
#include
#include
#include
#include
#include
#include
#include
#include