Effervescence-CSDN博客

原创 Codeforces Round #441 (Div. 1, by Moscow Team Olympiad) E. Delivery Club

E. Delivery ClubProblem Statement Petya and Vasya got employed as couriers. During the working day they are to deliver packages to n different points on the line. According to the company’s inter

2017-10-21 15:53:40 698 1

原创 Codeforces Round #441 (Div. 1, by Moscow Team Olympiad) F. Royal Questions

F. Royal QuestionsProblem Statement In a medieval kingdom, the economic crisis is raging. Milk drops fall, Economic indicators are deteriorating every day, money from the treasury disappear. To r

2017-10-20 22:45:02 362

原创 Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) F. High Cry

F. High CryProblem Statement Disclaimer: 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 Mo

2017-10-20 19:29:45 341

原创 Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) E. National Property

E. National PropertyProblem Statement You all know that the Library of Bookland is the largest library in the world. There are dozens of thousands of books in the library. Some long and un

2017-10-20 18:32:25 301

原创 Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) D. Sorting the Coins

D. Sorting the CoinsProblem Statement

2017-10-19 17:51:48 288

原创 Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) C. Classroom Watch

C. Classroom WatchProblem Statement Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this

2017-10-19 15:28:10 363

原创 Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) B. Divisiblity of Differences

B. Divisiblity of DifferencesProblem Statement You are given a multiset of n integers. You should select exactly k of them in a such way that the difference between any two of them is divisible b

2017-10-18 19:27:58 248

原创 Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) A. Trip For Meal

A. Trip For MealProblem Statement Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and Eeyore, each of them lives

2017-10-18 19:12:58 448

原创 Codeforces Round #440 (Div. 2) C. Maximum splitting

C. Maximum splittingProblem Statement You are given several queries. In the i-th query you are given a single positive integer nin_i. You are to represent nin_i as a sum of maximum possible numbe

2017-10-18 18:39:58 266

原创 Codeforces Round #440 (Div. 2) B. Maximum of Maximums of Minimums

B. Maximum of Maximums of MinimumsProblem Statement You are given an array a1a_1, a2a_2, …, ana_n consisting of n integers, and an integer k. You have to split the array into exactly k non-empty

2017-10-18 18:21:32 265

原创 Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination) A. Search for Pretty Integers

A. Search for Pretty IntegersProblem Statement You are given two lists of non-zero digits. Let’s call an integer pretty if its (base 10) representation has at least one digit from the firs

2017-10-18 18:02:34 245

原创 Codeforces Round #440 (Div. 2, based on Technocup 2018 Elimination Round 2) 总结

啊..最近事情有点多导致没时间写CF的总结，现在来补一补吧.. 这场……打的其实并不怎么好，机房内好多dalao都做了4题，但是我只做出了前三题，还FST了一道B..不过我在比赛时候在room里hack了11个人的B，加了1100分..导致我FST了B之后还有rank180左右（hack真是好啊hhh..）最终rating+=30，目前rating=1848，“又”一次离紫名又近了一步（…）

2017-10-18 18:00:54 214

原创 HDU 2489 Minimal Ratio Tree（DFS+Kruskal最小生成树）

Minimal Ratio TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4790 Accepted Submission(s): 1535Problem Description For a tree, which nodes

2017-10-18 17:25:59 199

原创 HDU 1052 Tian Ji -- The Horse Racing(贪心)

Tian Ji – The Horse RacingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31951 Accepted Submission(s): 9696Problem Description Here is a famo

2017-10-18 17:23:45 288

原创 HDU 1043 Eight(经典八数码)(BFS+STL)

EightTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26254 Accepted Submission(s): 6980Special JudgeProblem Description The 15-puzzle has bee

2017-10-18 16:45:29 385

原创 LightOJ 1038 Race to 1 Again(概率期望DP)

题意给出一个数字n，我们可以选择1~n中可以被n整除的数字，然后用n出得到一个新的数字n1n_1；然后再找所有n1n_1的因子，用n1n_1除，直到得到1；问除的次数的期望值。思路对于一个数n，我们设dp[i]为i变到1的期望，我们可以根据期望从后往前推，则dp[i]=(dp[1]+dp[c1c_1]+…+dp[i]+num)/num。对于这个值我们进行扫一遍找因子然后

2017-10-18 16:28:14 405

原创 LightOJ 1094 Farthest Nodes in a Tree(dfs)

题意一句话题意：就是给出一颗树，让你求树的直径。思路这是一道大水题，只要dfs两遍就行了。对于第一遍dfs，随意找一个点，然后找到离这个点最远的一个点，再从这个最远的点再次dfs找到最远的距离，就是树的直径了。

2017-10-18 16:24:27 223

原创 HDU 1028 Ignatius and the Princess III（递推）

Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22918 Accepted Submission(s): 15987Problem Description "Well, it

2017-10-16 18:03:50 186

原创 SGU 199. Beautiful People（最长上升子序列nlogn LIS）

Problem Statement The most prestigious sports club in one city has exactly N members. Each of its members is strong and beautiful. More precisely, i-th member of this club (members being numbe

2017-10-16 18:01:00 1109

原创 POJ 1742 coins（背包+二进制优化+bitset）

coins

2017-10-16 17:37:59 401

原创 HDU 1010 Tempter of the Bone（DFS+暴力+标记）

Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 130557 Accepted Submission(s): 35207Problem Description The doggie found a

2017-10-16 17:34:34 194

原创 POJ 2255 Tree Recovery（递归）

Tree RecoveryTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 15683Accepted: 9677DescriptionLittle Valentine liked playing with binary trees very much. Her favorite game was constructing random

2017-10-16 16:45:52 316

原创 POJ 2413 How many Fibs?（高精度暴力）

How many Fibs?Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 12308Accepted: 4404DescriptionRecall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n>=3)

2017-10-16 16:38:39 324

原创 Codeforces Round #401 (Div. 2) A. Shell Game

A. Shell GameProblem Statement Bomboslav likes to look out of the window in his room and watch lads outside playing famous shell game. The game is played by two persons: operator and player. Oper

2017-10-13 18:27:32 268

原创 Codeforces Round #401 (Div. 2) (Virtual participation) 总结

这场比赛……看了看评论，好像是传说中的Div 3???（23333）。这场比赛D和E好像都比平常的Div 2的D和E简单…（不过E题std好像是LIS+线段树？？但是可以用贪心水过去2333）..我写了一个小时就写完了5道题，然后比赛结束惊奇地发现一共大约有200~300人AK……（好像果然是传说中的Div 3啊233）赛后总结：在打比赛的时候……我C题想到一个优化，但是认为原来那个

2017-10-13 18:20:11 312

转载 POJ 2411 Mondriaan's Dream（状压DP）

Mondriaan’s DreamTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 17936Accepted: 10285DescriptionSquares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after prod

2017-10-13 17:50:35 130

原创 Educational Codeforces Round 30 D. Merge Sort

D. Merge SortProblem Statement Merge sort is a well-known sorting algorithm. The main function that sorts the elements of array a with indices from [l, r) can be implemented as follows:

2017-10-13 13:13:11 313

原创 Educational Codeforces Round 30 C. Strange Game On Matrix

C. Strange Game On MatrixProblem Statement Ivan is playing a strange game. He has a matrix a with n rows and m columns. Each element of the matrix is equal to either 0 or 1. Rows and colum

2017-10-13 12:43:50 408

原创 Educational Codeforces Round 30 B.Balanced Substring

B. Balanced SubstringProblem Statement You are given a string s consisting only of characters 0 and 1. A substring [l, r] of s is a string slsl + 1sl + 2...srs_ls_{l + 1}s_{l + 2}... s_r, and its

2017-10-13 11:16:58 404

原创 Educational Codeforces Round 30 A. Chore

A. ChoreProblem Statement Luba has to do n chores today. i-th chore takes ai units of time to complete. It is guaranteed that for every the condition ai ≥ ai - 1 is met, so the sequence is sorte

2017-10-13 11:13:27 666

原创 Educational Codeforces Round 30 总结

这场edu打的还可以……6题做了4题(虽然听说E挺水，但我来不及做了QAQ)..我在D题上卡了好久，而且一共有4次罚时，基本都是手残打错导致的..这样如果去OI怎么办啊QAQ..以后打完代码一定要好好检查几遍，多造几组数据测一测……确认应该没啥问题了再交..这样在cf上打比赛的时候也会少很多罚分，rank也会高一点了（雾）最终rank：177，solved 4 out of 6。

2017-10-13 11:03:41 295

原创 POJ 1308 && HDU 1325 Is It A Tree?（并查集）

Language:DefaultIs It A Tree?Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 34386Accepted: 11650DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or

2017-10-12 07:44:28 522

原创【洛谷P3372】【模板】线段树1

好像好久没打线段树了手都生了..我再来重新打份模板（好像还没A过..23333）题目描述如题，已知一个数列，你需要进行下面两种操作： 1.将某区间每一个数加上x 2.求出某区间每一个数的和输入输出格式输入格式第一行包含两个整数N、M，分别表示该数列数字的个数和操作的总个数。第二行包含N个用空格分隔的整数，其中第i个数字表示数

2017-10-11 07:57:37 444

原创 Codeforces Round #439 (Div. 2) E. The Untended Antiquity

E. The Untended AntiquityProblem Statement Adieu l’ami. Koyomi is helping Oshino, an acquaintance of his, to take care of an open space around the abandoned Eikou Cram School building, Osh

2017-10-07 15:17:55 288

原创 Codeforces Round #439 (Div. 2) C. The Intriguing Obsession

C. The Intriguing ObsessionProblem Statement — This is not playing but duty as allies of justice, Nii-chan! — Not allies but justice itself, Onii-chan! With hands joined, go everywh

2017-10-07 15:05:11 580

原创 Codeforces Round #439 (Div. 2) B. The Eternal Immortality

B. The Eternal ImmortalityProblem Statement Even if the world is full of counterfeits, I still regard it as wonderful. Pile up herbs and incense, and arise again from the flames and ashes

2017-10-07 14:54:03 469

原创 Codeforces Round #439 (Div. 2) A. The Artful Expedient

A. The Artful ExpedientProblem StatementRock... Paper!After Karen have found the deterministic winning (losing?) strategy for rock-paper-scissors, her brother, Koyomi, comes up with a new game as a substit

2017-10-07 14:39:22 580

原创 Codeforces Round #439 (Div. 2) 总结

这场……前面有点意识模糊（虽然后面也没好起来233）..A题看了我大概10分钟..（这题意..一点也不清真啊喂）然后C题卡了大概一个小时……最后在1:58交了E过pp结果忘了rand的范围只有short..然后就挂掉了，之后改了一下就……A了… 最终rank：273，rating+=29，目前rating=1818。通过这场比赛……我发现我……解题能力还是不够……需要更多的练习QAQ.

2017-10-07 14:38:52 190

原创 Codeforces Round #438 (Div. 1 + Div. 2 combined) D. Huge Strings

D. Huge StringsProblem Statement You are given n strings s1s_1, s2s_2, …, sns_n consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings

2017-10-06 13:24:42 247

原创 Codeforces Round #438 (Div. 1 + Div. 2 combined) C. Qualification Rounds

C. Qualification RoundsProblem Statement Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they w

2017-10-06 12:57:42 247

空空如也

空空如也