随笔分类 -  Contest——2018 牛客多校联合训练

2018 牛客多校 10
摘要：Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L 阅读全文
posted @ 2018-08-19 21:05 cxhscst2 阅读(152) 评论(0) 推荐(0)
2018 牛客多校 9
摘要：Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K 阅读全文
posted @ 2018-08-19 21:02 cxhscst2 阅读(120) 评论(0) 推荐(0)
2018 牛客多校 8
摘要：Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L 阅读全文
posted @ 2018-08-19 21:01 cxhscst2 阅读(78) 评论(0) 推荐(0)
2018 牛客多校 7
摘要：Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L 阅读全文
posted @ 2018-08-11 09:20 cxhscst2 阅读(113) 评论(0) 推荐(0)
2018 牛客多校 6
摘要：Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem K Problem L 阅读全文
posted @ 2018-08-11 09:19 cxhscst2 阅读(97) 评论(0) 推荐(0)
2018 牛客多校 5
摘要：Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J 阅读全文
posted @ 2018-08-03 17:05 cxhscst2 阅读(134) 评论(0) 推荐(0)
2018 牛客多校 4
摘要：Problem A 考虑用欧拉公式降幂 （因为这个模数是质数所以方便很多，不用考虑那些乱七八糟的情况） Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J Problem 阅读全文
posted @ 2018-07-29 14:59 cxhscst2 阅读(146) 评论(0) 推荐(0)
2018 牛客多校 3
摘要：Problem A DP，输出路径的时候减下去就可以了。 Problem B 如果一个点度数 $<= 2$，那么这个点肯定会被删掉。 考虑每个度数 $>= 3$的点为根并且不选这个根的情形，假设这个点有$sz$个儿子。 如果我在$sz$个分支里面只有 $<= 2$个分支里面的点被选择了。 那么首先其 阅读全文
posted @ 2018-07-29 14:58 cxhscst2 阅读(154) 评论(0) 推荐(0)
2018 牛客多校 2
摘要：Problem A Problem B 考虑第二种优惠，每一个物品如果原价购买了， 那么向可以免费拿的那个物品连一条边（在树上被指向的那个点是父亲） 如果不考虑环的话，考虑树上DP。 设$f[i][0]$表示买掉以$i$为根的子树需要的最小花费， 设$f[i][0]$表示买掉以$i$为根的子树并且$ 阅读全文
posted @ 2018-07-29 14:55 cxhscst2 阅读(183) 评论(0) 推荐(0)
2018 牛客多校 1
摘要：Problem A Problem B Problem C Problem D Problem E Problem F Problem G Problem H Problem I Problem J 阅读全文
posted @ 2018-07-29 14:53 cxhscst2 阅读(122) 评论(0) 推荐(0)