随笔分类 -  codeforces

上一页 1 2 3 4 5 6 7 ··· 11 下一页
[Codeforces Round #624 (Div. 3)] -E. Construct the Binary Tree （构造二叉树）
摘要：[Codeforces Round 624 (Div. 3)] E. Construct the Binary Tree （构造二叉树） E. Construct the Binary Tree time limit per test 2 seconds memory limit per test 阅读全文
posted @ 2020-03-13 17:33 茄子Min 阅读(225) 评论(0) 推荐(0)
[Codeforces Round #626 (Div. 2, based on Moscow Open Olympiad in Informatics)] -D. Present（异或性质，按位拆分，双指针）
摘要：[Codeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics)] D. Present（异或性质，按位拆分，双指针） D. Present time limit per test 3 seconds memor 阅读全文
posted @ 2020-03-11 18:21 茄子Min 阅读(168) 评论(0) 推荐(0)
[Codeforces Round #626 (Div. 2, based on Moscow Open Olympiad in Informatics)] -D. Present（异或性质，按位拆分，树桩数组）
摘要：[Codeforces Round 626 (Div. 2, based on Moscow Open Olympiad in Informatics)] D. Present（异或性质，按位拆分，树桩数组） D. Present time limit per test 3 seconds memo 阅读全文
posted @ 2020-03-11 17:52 茄子Min 阅读(247) 评论(0) 推荐(0)
[Educational Codeforces Round 83 ] E. Array Shrinking - (区间DP)
摘要：[Educational Codeforces Round 83 ] E. Array Shrinking (区间DP) E. Array Shrinking time limit per test 2 seconds memory limit per test 256 megabytes inpu 阅读全文
posted @ 2020-03-10 22:27 茄子Min 阅读(306) 评论(0) 推荐(0)
[CodeCraft-20 (Div. 2)]- E. Team Building （状压DP）
摘要：[CodeCraft 20 (Div. 2)] E. Team Building （状压DP） E. Team Building time limit per test 3 seconds memory limit per test 256 megabytes input standard inpu 阅读全文
posted @ 2020-03-05 22:20 茄子Min 阅读(460) 评论(0) 推荐(0)
[Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated]-E. Kuroni and the Score Distribution(构造)
摘要：[Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated] E. Kuroni and the Score Distribution(构造) Kuroni is the coordinator of the next Mathforces round writt 阅读全文
posted @ 2020-03-04 17:24 茄子Min 阅读(228) 评论(0) 推荐(0)
[Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated]-D. Kuroni and the Celebration（交互题+树的性质）
摘要：[Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated] D. Kuroni and the Celebration（交互题+树的性质） This is an interactive problem. After getting AC after 13 Tim 阅读全文
posted @ 2020-03-04 15:24 茄子Min 阅读(188) 评论(0) 推荐(0)
[Codeforces Round #622 (Div. 2)] - C2. Skyscrapers (hard version) （单调栈）
摘要：[Codeforces Round 622 (Div. 2)] C2. Skyscrapers (hard version) （单调栈） C2. Skyscrapers (hard version) time limit per test 3 seconds memory limit per tes 阅读全文
posted @ 2020-02-24 18:03 茄子Min 阅读(334) 评论(0) 推荐(0)
[Codeforces Round #620 (Div. 2)] E. 1-Trees and Queries（树，LCA，奇偶性）
摘要：[Codeforces Round 620 (Div. 2)] E. 1 Trees and Queries time limit per test 4 seconds memory limit per test 512 megabytes input standard input output s 阅读全文
posted @ 2020-02-17 21:42 茄子Min 阅读(262) 评论(0) 推荐(0)
[Educational Codeforces Round 82 (Rated for Div. 2)] D. Fill The Bag （二进制拆分，贪心）
摘要：[Educational Codeforces Round 82 (Rated for Div. 2)] D. Fill The Bag （二进制拆分，贪心） D. Fill The Bag time limit per test 2 seconds memory limit per test 25 阅读全文
posted @ 2020-02-14 23:09 茄子Min 阅读(194) 评论(0) 推荐(0)
[Codeforces Round #617 (Div. 3)] 题解 A,B,C,D，E1，E2，F
摘要：[Codeforces Round 617 (Div. 3)] 题解 A,B,C,D，E1，E2，F "1296A Array with Odd Sum" 思路： 如果一开始数组的sum和是奇数，那么直接YES， 否则：如果存在一个奇数和一个偶数，答案为YES，否则为NO 代码： B. Food B 阅读全文
posted @ 2020-02-05 23:21 茄子Min 阅读(536) 评论(0) 推荐(1)
[Codeforces Round #611 (Div. 3)] C. Friends and Gifts (随机大法好)
摘要：[Codeforces Round 611 (Div. 3)] C. Friends and Gifts (随机大法好) C. Friends and Gifts time limit per test 2 seconds memory limit per test 256 megabytes in 阅读全文
posted @ 2020-02-02 22:05 茄子Min 阅读(324) 评论(0) 推荐(0)
[Hello 2020] D. New Year and Conference (ST表，排序)
摘要：[Hello 2020] D. New Year and Conference (ST表，排序) D. New Year and Conference time limit per test 2 seconds memory limit per test 1024 megabytes input s 阅读全文
posted @ 2020-02-02 15:32 茄子Min 阅读(429) 评论(0) 推荐(0)
[Hello 2020] C. New Year and Permutation (组合数学)
摘要：[Hello 2020] C. New Year and Permutation (组合数学) C. New Year and Permutation time limit per test 1 second memory limit per test 1024 megabytes input st 阅读全文
posted @ 2020-02-01 16:27 茄子Min 阅读(299) 评论(0) 推荐(0)
[Educational Codeforces Round 81 (Rated for Div. 2)]E. Permutation Separation（线段树，思维，前缀和）
摘要：[Educational Codeforces Round 81 (Rated for Div. 2)]E. Permutation Separation（线段树，思维，前缀和） E. Permutation Separation time limit per test 2 seconds memo 阅读全文
posted @ 2020-02-01 00:23 茄子Min 阅读(554) 评论(2) 推荐(0)
Educational Codeforces Round 81 (Rated for Div. 2)] D. Same GCDs (数论，因子分解，容斥定理)
摘要：[Educational Codeforces Round 81 (Rated for Div. 2)] D. Same GCDs (数论，因子分解，容斥定理) D. Same GCDs time limit per test 2 seconds memory limit per test 256 阅读全文
posted @ 2020-01-31 13:30 茄子Min 阅读(300) 评论(0) 推荐(2)
Educational Codeforces Round 81 (Rated for Div. 2) C. Obtain The String(序列自动机，贪心)
摘要：[Educational Codeforces Round 81 (Rated for Div. 2) C. Obtain The String(序列自动机，贪心) C. Obtain The String time limit per test 1 second memory limit per 阅读全文
posted @ 2020-01-30 23:30 茄子Min 阅读(350) 评论(0) 推荐(0)
Educational Codeforces Round 81 B. Infinite Prefixes（数学，字符串，思维）
摘要：Educational Codeforces Round 81 B. Infinite Prefixes B. Infinite Prefixes time limit per test 2 seconds memory limit per test 256 megabytes input stan 阅读全文
posted @ 2020-01-30 18:39 茄子Min 阅读(305) 评论(0) 推荐(0)
Codeforces Round #615 (Div. 3) F. Three Paths on a Tree（树的直径，dfs）
摘要：Codeforces Round 615 (Div. 3) F. Three Paths on a Tree 题目链接：https://codeforces.com/contest/1294/problem/F time limit per test 2 seconds memory limit p 阅读全文
posted @ 2020-01-28 17:47 茄子Min 阅读(326) 评论(0) 推荐(0)
Codeforces Round #612 (Div. 2) C. Garland 动态规划
摘要：Codeforces Round 612 (Div. 2) C. Garland 动态规划 题目链接： https://codeforces.com/contest/1287/problem/C ​ C. Garland time limit per test 1 second memory lim 阅读全文
posted @ 2020-01-18 16:55 茄子Min 阅读(362) 评论(0) 推荐(0)

上一页 1 2 3 4 5 6 7 ··· 11 下一页