网络赛~CF - 随笔分类 - s1124yy

CF830A Office Keys(贪心)

摘要：CF830A Office Keys 【题目链接】 " CF830A Office Keys " 【题目类型】贪心 &题意：有n个人,k个钥匙,一个目的地,求让n个人都回到目的地的最短时间,每个人都要拿钥匙才能回目的地 &题解：这题做的时候没有认真想样例,如果仔细想的话就能发现n个人选的n个钥阅读全文

posted @ 2017-07-15 12:39 s1124yy 阅读(303) 评论(0) 推荐(0)

CF822D 贪心+递推

摘要：CF822D 【题目链接】 " CF822D " 【题目类型】贪心+递推 &题意：给你n个人,你可以把他们分组,但必须保持每组相等,分组之后每2个人会比赛,比如一组有i个人,那么就要比赛次,f[i]:表示当人数为i时,随意分组,比赛最少的次数.现在我们要求 &题解：这是cf评测机,所以只要可阅读全文

posted @ 2017-07-09 23:45 s1124yy 阅读(201) 评论(0) 推荐(0)

CF822C Hacker, pack your bags!(思维)

摘要：Hacker, pack your bags 【题目链接】 " Hacker, pack your bags " &题意：有n条线段(n &题解：只有2个线段,并且他们的和是定值x.但是还有另外一个条件,他们的区间不相交,这个我们可以通过排序左端点l来实现,当我们排序完l,那么任意一个r在这个l 阅读全文

posted @ 2017-07-09 11:06 s1124yy 阅读(336) 评论(0) 推荐(0)

Cf Round #403 B. The Meeting Place Cannot Be Changed(二分答案)

摘要：The Meeting Place Cannot Be Changed 我发现我最近越来越zz了,md 连调程序都不会了,首先要有想法,之后输出如果和期望的不一样就从输入开始一步一步地调啊,tmd现在输出不一样就知道在那等着,有毛用啊. 【题目链接】 " The Meeting Place Cann 阅读全文

posted @ 2017-03-08 00:43 s1124yy 阅读(194) 评论(0) 推荐(0)

Codeforces Round #402 D String Game(二分)

摘要：【题目类型】二分答案 &题解：只要你想到二分答案就不是难题了,但我当时确实是想不到. 【时间复杂度】$O(nlogn)$ &代码： c++ include include include include include include using namespace std; define IN 阅读全文

posted @ 2017-02-27 13:18 s1124yy 阅读(248) 评论(0) 推荐(0)

D Cloud of Hashtags Codeforces Round #401 (Div. 2)

摘要：Cloud of Hashtags 【题目链接】 " Cloud of Hashtags " &题意：给你一个n,之后给出n个串,这些串的总长度不超过5e5,你要删除最少的单词(并且只能是后缀),使得这些串是按字典序排列的. &题解：这也是个水题,当然了,是在你能想到的情况下,然而我还是没想到. 阅读全文

posted @ 2017-02-26 13:33 s1124yy 阅读(211) 评论(0) 推荐(0)

C Alyona and Spreadsheet Codeforces Round #401(Div. 2)(思维)

摘要：Alyona and Spreadsheet 这就是一道思维的题,谈不上算法什么的,但我当时就是不会,直到别人告诉了我,我才懂了的.唉为什么总是这么弱呢? 【题目链接】 " Alyona and Spreadsheet " &题意：给一n m的表,之后给T个询问,每个询问是r1和r2,问从r1行阅读全文

posted @ 2017-02-25 15:14 s1124yy 阅读(229) 评论(0) 推荐(0)

Codeforces Round #377 (Div. 2) D. Exams(二分答案)

摘要：D. Exams Problem Description： Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered fro 阅读全文

posted @ 2016-12-08 13:54 s1124yy 阅读(269) 评论(0) 推荐(0)

Codeforces Round #383 (Div. 2) D. Arpa's weak amphitheater and Mehrdad's valuable Hoses(分组背包+dsu)

摘要：D. Arpa's weak amphitheater and Mehrdad's valuable Hoses Problem Description： Mehrdad wants to invite some Hoses to the palace for a dancing party. Ea 阅读全文

posted @ 2016-12-07 17:01 s1124yy 阅读(233) 评论(2) 推荐(0)

Codeforces Round #381 (Div. 2)C. Alyona and mex(思维)

摘要：C. Alyona and mex Problem Description： Alyona's mother wants to present an array of n non negative integers to Alyona. The array should be special. Al 阅读全文

posted @ 2016-11-24 12:33 s1124yy 阅读(393) 评论(0) 推荐(0)

Codeforces Round #381 (Div. 2)B. Alyona and flowers(水题)

摘要：B. Alyona and flowers Problem Description： Let's define a subarray as a segment of consecutive flowers. The mother suggested some set of subarrays. Al 阅读全文

posted @ 2016-11-24 09:02 s1124yy 阅读(270) 评论(0) 推荐(0)

Codeforces Round #381 (Div. 2)A. Alyona and copybooks(dfs)

摘要：A. Alyona and copybooks Problem Description： Little girl Alyona is in a shop to buy some copybooks for school. She study four subjects so she wants to 阅读全文

posted @ 2016-11-24 08:40 s1124yy 阅读(587) 评论(3) 推荐(0)

Codeforces Round #378 (Div. 2) D - Kostya the Sculptor

摘要：Kostya the Sculptor 这次cf打的又是心累啊，果然我太菜，真的该认真学习，不要随便的浪费时间啦【题目链接】 " Kostya the Sculptor " &题意：给你n个长方体，你要使长方体的内切球有体积最大，有两种选择方案 ①只选1个长方体。 ②选2个长方体，黏到一起，但这阅读全文

posted @ 2016-11-02 01:52 s1124yy 阅读(316) 评论(2) 推荐(0)

Codeforces Round #373 (Div. 2)A B

摘要：Codeforces Round 373 (Div. 2) A. Vitya in the Countryside 这回做的好差啊，a想不到被hack的数据，b又没有想到正确的思维 = = 【题目链接】 " A. Vitya in the Countryside " 【题目类型】模拟 &题意：一个阅读全文

posted @ 2016-09-25 20:39 s1124yy 阅读(152) 评论(0) 推荐(0)

Codeforces Round #369 (Div. 2) C. Coloring Trees（dp）

摘要：Coloring Trees Problem Description： ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decide 阅读全文

posted @ 2016-08-31 20:23 s1124yy 阅读(260) 评论(0) 推荐(0)

Codeforces Round #368 (Div. 2) D. Persistent Bookcase

摘要：Persistent Bookcase Problem Description： Recently in school Alina has learned what are the persistent data structures: they are data structures that a 阅读全文

posted @ 2016-08-24 19:17 s1124yy 阅读(258) 评论(0) 推荐(0)

Educational Codeforces Round 16 E. Generate a String

摘要：Generate a String Problem Description： zscoder wants to generate an input file for some programming competition problem. His input is a string consist 阅读全文

posted @ 2016-08-23 17:44 s1124yy 阅读(143) 评论(0) 推荐(0)

Codeforces Round #367 (Div. 2) Hard problem

摘要：Hard problem 题意：有n个字符串，对第i个字符串进行反转操作代价为ci。要使n个字符串按照字典序从小到大排列，最小的代价是多少。题解：反转就是reverse操作，比如说45873反转之后只能是37845，不能是别的，当时就这没有理解好，所以没继续去想，其实可以假设这样，之后来一发阅读全文

posted @ 2016-08-12 17:01 s1124yy 阅读(238) 评论(0) 推荐(0)

Codeforces Round #366 (Div. 2) C Thor（模拟+2种stl）

摘要：Thor 题意：第一行n和q，n表示某手机有n个app，q表示下面有q个操作。操作类型1：app x增加一条未读信息。操作类型2：一次把app x的未读信息全部读完。操作类型3：按照操作类型1添加的顺序，按顺序读t条信息，注意这t条信息可能有的已经读过。如果读过也算前t条，会再读一遍。最后阅读全文

posted @ 2016-08-08 18:05 s1124yy 阅读(175) 评论(0) 推荐(0)

CF #365 (Div. 2) D - Mishka and Interesting sum 离线树状数组（转）

摘要：转载自：http://www.cnblogs.com/icode-girl/p/5744409.html 题目链接：CF #365 (Div. 2) D - Mishka and Interesting sum 题意：给出n个数和m个询问，(1 ≤ n, m ≤ 1 000 000) ，问在每个区间阅读全文

posted @ 2016-08-07 17:30 s1124yy 阅读(234) 评论(0) 推荐(0)

随笔分类 - 网络赛~CF