- 博客(262)
- 收藏
- 关注
原创 Codeforces Gym - 101234A Hacker Cups and Balls [二分+线段树]
Codeforces Gym - 101234A Hacker Cups and Balls [二分+线段树]
2018-03-01 21:50:26 841
原创 Codeforeces Gym - 101234G Dreamoon and NightMarket [想法]
Codeforeces Gym - 101234G Dreamoon and NightMarket [想法]
2018-03-01 19:34:49 497
原创 Codeforces Gym - 101234J Zero Game [单调队列]
Codeforces Gym - 101234J [单调队列]
2018-03-01 19:27:10 735
原创 Codeforces Gym 101064E A Word to Trump All [AC自动机+bfs]
Codeforces Gym 101064E A Word to Trump All [AC自动机+bfs]
2018-02-27 21:16:44 363
原创 Codeforeces Gym-101064I Protecting the Central Park [dfs]
Codeforeces Gym-101064I Protecting the Central Park [dfs]
2018-02-27 20:01:31 270
原创 CodeForces 932F Escape Through Leaf [set启发式合并+维护凸包+二分]
CodeForces 932F Escape Through Leaf [set启发式合并+维护凸包+二分]
2018-02-23 14:23:50 855
原创 CodeForces - 938D Buy a Ticket [Dijkstra]
CodeForces - 938D Buy a Ticket [Dijkstra]
2018-02-18 16:58:53 886
原创 求欧拉函数
int phi(int n) //直接得到 { int i,rea=n; for(i=2;i*i<=n;i++) { if(n%i==0) { rea=rea-rea/i; while(n%i==0) n/=i; } } ...
2018-02-17 18:21:02 239
原创 Gym-101667H Rock Paper Scissors [FFT]
Gym-101667H Rock Paper Scissors [FFT]
2018-02-14 15:57:14 1417
原创 EOJ Monthly 2018.2 (Good bye 2017) B. 无聊的游戏 [状压+SG函数]
EOJ Monthly 2018.2 (Good bye 2017) B. 无聊的游戏 [状压+SG函数]
2018-02-13 21:47:08 637
原创 Gym-101484K Counting Good Teams [高维前缀和]
Gym-101484K Counting Good Teams [高维前缀和]
2018-02-08 20:19:11 447
原创 Gym - 101492C Coprimes [bitset+质因素分解]
Gym - 101492C Coprimes [bitset+质因素分解]
2018-02-05 20:55:48 517
原创 2017ICPC南宁 M题 The Maximum Unreachable Node Set [二分图最大独立集]
2017ICPC南宁 M题 The Maximum Unreachable Node Set [二分图最大独立集]
2018-02-04 14:59:05 467
原创 gym 101158J - Cover the Polygon with Your Disk [模拟退火+多边形与圆面积交]
gym 101158J - Cover the Polygon with Your Disk [模拟退火+多边形与圆面积交]
2018-02-03 23:09:39 455
原创 Gym - 101158I Skinny Polygon [扩展欧几里得]
Gym - 101158I Skinny Polygon [扩展欧几里得]
2018-02-03 14:04:16 473
原创 Gym - 101158G Placing Medals on a Binary Tree [想法]
题意:有一颗无穷大的满二叉树,我们向树上某层节点放置奖牌,奖牌排斥的条件为:从该节点到根的路径上无其他奖牌。如果能放置则放置,否则不放跳过,并且要按照输入的顺序放置,每次输出Yes或者No。题解:我们可以得知,一个节点放置奖牌之后,这个节点的子树都不能放置奖牌,并且当两个相同深度的节点都放置奖牌之后,其父节点的子树不能放置奖牌。我们用1表示该节点的子树不能放置奖牌。我们可以维护这个序列。由...
2018-02-02 21:04:50 523 2
原创 Codeforces Round #459 (Div. 2)C The Monster [想法]
Codeforces Round #459 (Div. 2) The Monster [想法]
2018-01-30 20:39:31 295
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人