Welcome to yjjr's blog!

标签：线段求交，STL，二分题目[题目传送门](http://codeforces.com/contest/1061/problem/D）题意给出要看的nnn个电视节目，和每个节目开始结束时间分别为lil_ili​和rir_iri​，每次申请一个新的电视的花费为X+(ri−li)×YX+(r_i-l_i)\times YX+(ri​−li​)×Y，如果两个节目有交集，就必须用两个电视看，现...

标签：模拟题目题目传送门“QAQ” is a word to denote an expression of crying. Imagine “Q” as eyes with tears and “A” as a mouth.Now Diamond has given Bort a string consisting of only uppercase English letters of leng

标签：dfs题目题面传送门What are you doing at the end of the world? Are you busy? Will you save us?Nephren is playing a game with little leprechauns.She gives them an infinite array of strings, f0… ∞.f0 is “What

标签：模拟题目题面传送门Are you going to Scarborough Fair?Parsley, sage, rosemary and thyme.Remember me to one who lives there.He once was the true love of mine.Willem is taking the girl to the highest building in

标签：模拟，数学题目题面传送门— Thanks a lot for today.— I experienced so many great things.— You gave me memories like dreams… But I have to leave now…— One last request, can you…— Help me solve a Codeforces problem

A题面传送门题意给定长度为N的字符串，进行m次操作，每次将l−>rl->r范围内为C1C_1的字符改成C2C_2，输出操作完的字符串数据范围1≤n,m≤1001\le n,m\le 100分析注意使用string，模拟水题吧code#include<iostream>#include<cstdio>#include<cstdlib>#include<cstring>#include<cmat

标签：记忆化搜索，模拟，位运算You are given n stringss1, s2, ..., sn consisting of characters 0 and 1.m operations areperformed, on each of them you concatenate two existing strings into a new one.On thei-th

标签：博弈论Leha somehow found an array consisting of n integers. Looking at it, he came up with a task. Twoplayers play the game on the array. Players move one by one. The first playercan choose for hi

标签：模拟Rock... Paper!After Karen have found the deterministicwinning (losing?) strategy for rock-paper-scissors, her brother, Koyomi, comesup with a new game as a substitute. The game works as follo

标签：模拟，数学Even if the world is full of counterfeits,I still regard it as wonderful.Pile up herbs and incense, and arise againfrom the flames and ashes of its predecessor — as is known to many, theph

标签：数学，快速幂题目题目传送门Ralph has a magic field which is divided into n × m blocks. That is to say, there are n rows and m columns on the field. Ralph can put an integer in each block. However, the magic field

标签：模拟，数学题目题目传送门In a dream Marco met an elderly man with a pair of black glasses. The man told him the key to immortality and then disappeared with the wind of time.When he woke up, he only remembered t

标签：二分，树题目题目传送门Ralph is in the Binary Country. The Binary Country consists of n cities and (n - 1) bidirectional roads connecting the cities. The roads are numbered from 1 to (n - 1), the i-th road conn

标签：DP题目题目传送门题意给出序列aia_iai​，询问有多少个a的子序列b满足，对于任意bib_ibi​，b[i]mod&amp;ThinSpace;&amp;ThinSpace;i=0b[i]\mod i=0b[i]modi=0分析简单DPf[i][j]=f[i−1][j−1]+f[i−1][j](a[i]mod&amp;ThinSpace;&amp;ThinSpace;j=0...

标签：模拟题意给了n个初始状态为正面的煎饼（雾？？反正可以这样理解），每次可以选择区间[i−k,i+k][i−k,i+k][i-k,i+k]内的煎饼翻一面，问最少可以花费多少次把所有煎饼都翻成反面题解分类讨论当k=0k=0k=0时，需要翻n次当n≤2×k+1n≤2×k+1n\leq2\times k+1时，只需要中间的翻一次当n&gt;2×k+1n&gt;2×k+1n...

CSDN失踪人口回归了，毕竟还是要准备SOI的，从今天开始重新写题解了A. Palindrome Dance题意给出一串由0,1,2表示的数字，0和1分别表示不同的颜色，2表示无色，和两种变色的花费，现在使这串数字变为回文串，使得总花费最小题解从左到右，分几种情况讨论下就好了，分类讨论code#include&amp;amp;amp;lt;iostream&amp;amp;amp;gt;#inc...

A. Left-handers, Right-handers and Ambidexters题意：l个人会用左手打球，r个人会用右手打球，a个人两只手都能打球，需要组建一个球队，保证球队中一半人会用左手打球，另一半会右手打球，最大化球队总人数模拟就行吧#include&lt;iostream&gt;#include&lt;cstdio&gt;#include&lt;cstdli...

话说好久没打CF div 2了自从上次lxl毒瘤round惨掉rating之后，三个月没打CF这场质量一般吧，水题偏多A. Olympiad题意：找出除了0有多少个不同的数？（应该是这样的题面吧，雾）#include&lt;iostream&gt;#include&lt;cstdio&gt;#include&lt;cstdlib&gt;#include&lt;cmat...

标签：数论，分治题目题目传送门1.1 backgrounds 小O是一个很萌很萌的女孩子 1.2 content 作为一个很萌很萌的女孩子，小O有很多很多美丽的宝石。 有一天，小O将她的宝石排成了一排一共n堆，第一堆有1个宝石，之后 每一堆的宝石数目是前一堆的两倍。 但是小O发现她的宝石不够用了，于是小O决定将每堆的宝石数量对一 个正整数M取模。 趁小O出去玩的时候，小Y偷偷地把

标签：STL，数据结构题目题目传送门Vasya has an array of integers of length n.Vasya performs the following operations on the array: on each step he finds the longest segment of consecutive equal integers (the leftmost,

标签：数学，找规律题目题目传送门There are n shovels in Polycarp’s shop. The i-th shovel costs i burles, that is, the first shovel costs 1 burle, the second shovel costs 2 burles, the third shovel costs 3 burles, and s

标签：数学— This is not playing but duty as allies ofjustice, Nii-chan!— Not allies but justice itself, Onii-chan!With hands joined, go everywhere at a speedfaster than our thoughts! This time, the F

标签：模拟，标记法Koyomi is helping Oshino, an acquaintanceof his, to take care of an open space around the abandoned Eikou Cram Schoolbuilding, Oshino's makeshift residence.The space is represented by a r

标签：二分A gamefield is a strip of 1 × n squarecells. In some cells there are Packmen, in some cells — asterisks, othercells are empty.Packmancan move to neighboring cell in 1 time unit.If there is an

标签：模拟 There are n student groups at the university.During the study day, each group can take no more than 7 classes. Seven time slots numberedfrom 1 to 7 are allocated for the classes.Theschedul

标签：DPPolycarpplans to conduct a load testing of its new project Fakebook. He already agreedwith his friends that at certain points in time they will send requests toFakebook. The load testing will

标签：bfs,队列TheBerland's capital has the form of a rectangle with sizes n × m quarters. Allquarters are divided into three types:·  regular (labeled with the character '.') — such quarters do not pro

标签：贪心，hashIn theevening Polycarp decided to analyze his today's travel expenses on publictransport.The bussystem in the capital of Berland is arranged in such a way that each bus runsalong the rou

标签：模拟，计算几何Vasya cameup with his own weather forecasting method. He knows the information about theaverage air temperature for each of the last n days. Assume that the average air temperaturefor ea

标签：二分，DPYou are given an array ofn integersa1... an. The cost of a subsegment is thenumber of unordered pairs of distinct indices within the subsegment thatcontain equal elements. Split the given

标签：位运算Snark and Philip are preparing theproblemset for the upcoming pre-qualification round for semi-quarter-finals.They have a bank ofn problems, and they want to select any non-emptysubset of

标签：模拟，平面几何Have you ever tried to explain to thecoordinator, why it is eight hours to the contest and not a single problem hasbeen prepared yet? Misha had. And this time he has a really strong excuse

标签：贪心，模拟A new dogshow on TV is starting next week. On the show dogs are required to demonstratebottomless stomach, strategic thinking and self-preservation instinct. You andyour dog are invited to

标签：dfsRecallthat the bracket sequence is considered regular if it is possible to insertsymbols '+' and '1' into it so that the result is a correctarithmetic expression. For example, a sequence "((

标签：递推，DPIvan hasan array consisting of n differentintegers. He decided to reorder all elements in increasing order. Ivan lovesmerge sort so he decided to represent his array with one or several in

标签：模拟Where do odds begin, and where do they end?Where does hope emerge, and will they ever break?Given an integer sequencea1, a2, ..., an of lengthn. Decide whether it is possible to divide it

标签：模拟，计算几何Connect the countless points with lines,till we reach the faraway yonder.There are n points on a coordinateplane, thei-th of which being (i, yi).Determine whether it's possible to dr

标签：模拟From beginning till end, this message hasbeen waiting to be conveyed.For a given unordered multiset ofnlowercase English letters ("multi" means that a letter may appearmore than once), we t

标签：模拟Wherever the destination is, whoever wemeet, let's render this song together.On a Cartesian coordinate plane lies arectangular stage of sizew × h, represented by a rectangle withcorners (0,

标签：模拟For a given positive integer n denote its k-rounding as the minimum positiveinteger x, such that x ends with k or more zeros in base 10and is divisible by n.For example, 4-rounding of 3