codeforces
文章平均质量分 81
wchhlbt
这个作者很懒,什么都没留下…
展开
-
codeforces 876E National Property (建图)
题目原文:E. National Propertytime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputYou all know that the Librar原创 2017-10-26 20:23:28 · 334 阅读 · 0 评论 -
codeforces 803F Coprime Subsequences (容斥原理)
题目原文:http://codeforces.com/problemset/problem/803/FF. Coprime SubsequencesLet's call a non-empty sequence of positive integersa1, a2...akcoprime if the greatest common divisor of all原创 2017-05-01 11:13:59 · 956 阅读 · 0 评论 -
codeforces 803E Roma and Poker (dp)
题目原文:http://codeforces.com/contest/803/problem/EE. Roma and PokerEach evening Roma plays online poker on his favourite website. The rules of poker on this website are a bit strange: there原创 2017-05-01 10:43:05 · 399 阅读 · 0 评论 -
codeforces 785D Anton and School - 2(组合恒等式)
题目大意:http://codeforces.com/problemset/problem/785/D As you probably know, Anton goes to school. One of the school subjects that Anton studies is Bracketology. On the Bracketology lessons students usua原创 2017-03-18 16:10:22 · 973 阅读 · 0 评论 -
codeforces 788C The Great Mixing (bitset优化dp、bfs)
题目原文 http://codeforces.com/problemset/problem/788/CSasha and Kolya decided to get drunk with Coke, again. This time they have k types of Coke. i-th type is characterised by its carbon dioxide concentra原创 2017-03-31 17:17:20 · 1568 阅读 · 0 评论 -
codeforces 788B Weird journey (欧拉路)
题目原文:http://codeforces.com/problemset/problem/788/BB. Weird journeyLittle boy Igor wants to become a traveller. At first, he decided to visit all the cities of his motherland — Uzhlyandia.原创 2017-03-31 17:55:55 · 917 阅读 · 0 评论 -
codeforces 777E Hanoi Factory (栈+贪心)
题目原文:http://codeforces.com/contest/777/problem/EOf course you have heard the famous task about Hanoi Towers, but did you know that there is a special factory producing the rings for this wonderful原创 2017-02-25 14:12:57 · 1444 阅读 · 0 评论 -
codeforces 776C Molly's Chemicals (数学+二分法)
题目原文:Molly Hooper hasn different kinds of chemicals arranged in a line. Each of the chemicals has an affection value, The i-th of them has affection value ai.Molly wants Sherlock to fall i原创 2017-02-24 14:18:40 · 509 阅读 · 0 评论 -
codeforces 709D Recover the String (构造+模拟)
题目原文:For each strings consisting of characters '0' and '1' one can define four integersa00,a01,a10 and a11, where axy is the number of subsequences of length2 of the strings eq原创 2017-02-23 13:58:44 · 419 阅读 · 0 评论 -
codeforces 560C Gerald's Hexagon (数学+思维)
题目原文:http://codeforces.com/contest/560/problem/CGerald got a very curious hexagon for his birthday. The boy found out that all the angles of the hexagon are equal to. Then he measured the leng原创 2017-05-11 20:01:39 · 295 阅读 · 0 评论 -
codeforces 560E Gerald and Giant Chess (dp + 组合数)
题目原文:http://codeforces.com/contest/560/problem/EE. Gerald and Giant ChessGiant chess is quite common in Geraldion. We will not delve into the rules of the game, we'll just say that the gam原创 2017-05-11 20:18:32 · 374 阅读 · 0 评论 -
codeforces 676B Pyramid of Glasses(模拟题)
传送门:http://codeforces.com/contest/676/problem/BB. Pyramid of Glassestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMary原创 2016-06-01 21:49:17 · 1164 阅读 · 2 评论 -
codeforces 876F High Cry (思维,位运算)
D. High CryDisclaimer: there are lots of untranslateable puns in the Russian version of the statement, so there is one more reason for you to learn Russian :)Rick and Morty like to go to原创 2017-11-01 15:59:50 · 356 阅读 · 0 评论 -
codeforces 712D Memory and Scores (dp)
D. Memory and ScoresMemory and his friend Lexa are competing to get higher score in one popular computer game. Memory starts with score a and Lexa starts with score b. In a single turn, both原创 2017-10-03 20:49:18 · 343 阅读 · 0 评论 -
codeforces 587B Duff in Beach (dp)
B. Duff in BeachWhile Duff was resting in the beach, she accidentally found a strange array b0, b1, ..., bl - 1 consisting of lpositive integers. This array was strange because it was extrem原创 2017-10-02 20:10:44 · 311 阅读 · 0 评论 -
codeforces 837D Round Subset (dp)
解题思路:题目有很明显的dp特征(涉及多种状态和状态之间的关系)。我们考虑状态的定义,很容易知道尾0的个数取决于因子2和5中次数较小的一个。设状态 dp[i][j][k] 表示前i个数中选取j个并且这j个数的乘积包含的5的幂次为k的情况下 乘积包含2的最大幂次最后的答案就是遍历第三维的取值,找到2和5最小值最大的情况。需要注意的是,如果直接开成这样的三维数组可能会MLE,所以我们可原创 2017-09-30 16:04:22 · 233 阅读 · 0 评论 -
codeforces 854D Jury Meeting (思维、尺取)
题目原文: http://codeforces.com/problemset/problem/853/BB. Jury MeetingCountry of Metropolia is holding Olympiad of Metrpolises soon. It mean that all jury members of the olympiad should m原创 2017-09-14 20:55:25 · 383 阅读 · 0 评论 -
codeforces 401D Roman and Numbers (数位dp)
题目大意http://codeforces.com/problemset/problem/401/DD. Roman and NumbersRoman is a young mathematician, very famous in Uzhland. Unfortunately, Sereja doesn't think so. To make Sereja chang原创 2017-09-14 13:57:56 · 491 阅读 · 0 评论 -
codeforces 818E Card Game Again (尺取法)
题目原文:http://codeforces.com/contest/818/problem/EE. Card Game AgainVova again tries to play some computer card game.The rules of deck creation in this game are simple. Vova is given a原创 2017-08-02 11:51:54 · 1416 阅读 · 0 评论 -
codeforces 787A The Monster (猜想 + 证明)
解题思路:这次是第二次做这道题,第一次做是这场比赛的时候,当时没怎么多想,因为是div2A,就感觉一定可以暴力解决,当时脑洞一开,觉得如果存在解就一定存在小于等于N的解。赛后看题解的时候,发现题解和我的思路是一致的。开始寻求合理的证明,最开始一直往拓展欧几里得的方面去想,然后越想越复杂,一度放弃了。这次和别人讨论这道题的时候突然发现了一个很简单的想法。首先我们假设存在一组解(i,j原创 2017-08-08 11:09:03 · 310 阅读 · 0 评论 -
codeforces 768B (推理+归纳)
题目原文:Jon fought bravely to rescue the wildlings who were attacked by the white-walkers at Hardhome. On his arrival, Sam tells him that he wants to go to Oldtown to train at the Citadel to become原创 2017-02-21 17:10:09 · 481 阅读 · 0 评论 -
codeforces 768D Jon and Orbs (概率dp)
题目原文:Jon Snow is on the lookout for some orbs required to defeat the white walkers. There arek different types of orbs and he needs at least one of each. One orb spawns daily at the base of a Weir原创 2017-02-21 16:53:41 · 402 阅读 · 0 评论 -
codeforces 699B One Bomb (思维)
B - One BombCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u uDebug DescriptionInputOut原创 2016-07-31 21:42:31 · 380 阅读 · 0 评论 -
codeforces 96B Lucky Numbers (全排列)
DescriptionPetya loves lucky numbers. Everybody knows that positive integers are lucky if their decimal representation doesn't contain digits other than 4 and 7. For example, numbers 47, 744原创 2016-07-26 16:53:19 · 655 阅读 · 0 评论 -
CodeForces 581C Developing Skills
C. Developing Skillstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya loves computer games. Finally a game that h原创 2016-05-22 20:40:14 · 430 阅读 · 0 评论 -
codeforces 677 B Vanya and Food Processor (模拟)
codeforces #355 B(Div 2)http://http://codeforces.com/contest/677/problem/BB. Vanya and Food Processortime limit per test1 secondmemory limit per test256 megabytesinputstandard inputout原创 2016-06-02 09:27:22 · 468 阅读 · 0 评论 -
codeforces 676C Vasya and String(尺取法)
C. Vasya and Stringtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputHigh school student Vasya got a string of length n a原创 2016-06-01 21:42:41 · 649 阅读 · 0 评论 -
codeforces 447C DZY Loves Sequences(最长上升子序列变体)
DescriptionDZY has a sequence a, consisting of n integers.We'll call a sequence ai, ai + 1, ..., aj(1 ≤ i ≤ j ≤ n) a subsegment of the sequence a. The value(j - i + 1) denotes the length o原创 2016-05-07 20:12:30 · 457 阅读 · 0 评论 -
Educational Codeforces Round 6 620C Pearls in a Row
codeforces 620C原创 2016-02-16 16:04:25 · 479 阅读 · 0 评论 -
codeforces 614A Link/Cut Tree
codeforces 614B原创 2016-02-11 21:02:42 · 332 阅读 · 0 评论 -
codeforces 699C Vacations (贪心)
解题思路:直接判断每一天的情况,能不休息尽量不让他休息,分情况讨论一下~#include //using namespace std;int a[105];int ans;int main(){ int n,i; cin>>n; for(i=1;i<=n;i++) cin>>a[i]; for(i=1;i<n;i++) {原创 2016-07-31 21:56:16 · 1253 阅读 · 0 评论 -
codeforces 697C Lorenzo Von Matterhorn(二叉树LCA)
Lorenzo Von MatterhornBarney lives in NYC. NYC has infinite number of intersections numbered with positive integers starting from 1. There exists a bidirectional road between intersections原创 2016-08-19 22:22:59 · 714 阅读 · 0 评论 -
codeforces 702C Cellular Network(二分+尺取)
Cellular NetworkYou are given n points on the straight line — the positions (x-coordinates) of the cities and m points on the same line — the positions (x-coordinates) of the cellular原创 2016-08-20 17:09:12 · 452 阅读 · 0 评论 -
codeforces 748D Santa Claus and a Palindrome (构造+贪心+数据结构)
题目大意:给定 n 个字符串,每个字符串有一个价值 val,让你通过这些给定的字符串拼出一个总价值最大的回文串(palindrome)。所有字符串长度相同。解题思路:总体上是一种贪心的想法。 1、先将所有的字符串尽量两两配对形成回文串,保证每两个字符组成的回文串的总价值大于零。 2、考虑比较特殊的情况,最后形成的回文串中间可以原创 2016-12-26 17:08:27 · 1136 阅读 · 0 评论 -
codeforces 743D Chloe and pleasant prizes (DFS/树形DP)
D. Chloe and pleasant prizes传送门:http://codeforces.com/contest/743/problem/DGenerous sponsors of the olympiad in which Chloe and Vladik took part allowed all the participants to choose a prize for原创 2016-12-17 22:11:10 · 504 阅读 · 0 评论 -
codeforces 722D Generating Sets (二叉树 + 贪心)
解题思路: 可以根据题中所给的操作构造出一个二叉树,题目中要求的就是将所有的元素溯源,并且最后得到的值不互相重复的序列。并且要求所得序列的最大值最小,所以考虑贪心的想法,每一次对最大的值进行操作,将它上升到与他在同一条链上最近的无重叠元素的点,用set判断当前节点的值是否存在,循环对这个set内的元素进行操作,直到最大的一个元素无法被操作截至。AC代码:#include using n原创 2016-10-02 15:06:21 · 758 阅读 · 0 评论 -
codeforces 722C Destroying Array ( 并查集 / Multiset )
题目大意 : 给定一个乱序的数列,每次从中删去一个元素(留下空位),问剩下的连续子段和(中间不包括被删除的元素)的最大值。解题思路:1、正向思维:也就是正向模拟这个过程,考虑如何实现,一个Multiset保存当前所有的连续字段和,另开一个set保存每一段闭区间,要保证每次切断一个区间,加两个新区间进去,删去一个当前的连续字段和,加上两个心得连续字段和。2、逆向思维:如果正向进行这个原创 2016-10-02 14:54:09 · 440 阅读 · 0 评论 -
codeforces 719C Efim and Strange Grade (复杂模拟)
C. Efim and Strange GradeEfim just received his grade for the last test. He studies in a special school and his grade can be equal to any positive decimal fraction. First he got disappoi原创 2016-09-24 17:00:53 · 1101 阅读 · 0 评论 -
codefoces 706C Hard problem (dp/dfs)
C. Hard problemhttp://codeforces.com/problemset/problem/706/CVasiliy is fond of solving different tasks. Today he found one he wasn't able to solve himself, so he asks you to help.Vasiliy is原创 2016-08-12 20:16:06 · 341 阅读 · 0 评论 -
codeforces 691C Exponential notation(思维 + 比较精妙的模拟)
C. Exponential notationYou are given a positive decimal numberx.Your task is to convert it to the "simple exponential notation".Letx = a·10b, where 1 ≤ a , then in general case the "si原创 2016-08-12 16:52:33 · 792 阅读 · 0 评论