Kirill and Company solution codeforces Kirill and Company solution codeforces – Kirill lives on a connected undirected graph of šnĀ vertices andĀ šmĀ edges at vertexĀ 11. One fine evening he gatheredĀ šfĀ friends, theĀ ši-th friend lives at the vertexĀ āšhi. So all friends are now in the vertexĀ 11, theĀ ši-th friend must get to his home to the vertexĀ āšhi. The evening is … Read more
Multi-Colored Segments solution codeforces Multi-Colored Segments solution codeforces – Dmitry has šnĀ segments of different colors on the coordinate axisĀ šš„Ox. Each segment is characterized by three integersĀ ššli,Ā ššriĀ andĀ ššciĀ (1ā¤ššā¤ššā¤109,1ā¤ššā¤š1ā¤liā¤riā¤109,1ā¤ciā¤n), whereĀ ššliĀ andĀ ššriĀ are are the coordinates of the ends of theĀ ši-th segment, andĀ ššciĀ is its color. Dmitry likes to find the minimum distances between segments. However, he considers pairs of segments of … Read more
Sending a Sequence Over the Network solution codeforces Sending a Sequence Over the Network solution codeforces – The sequence šaĀ is sent over the network as follows: sequenceĀ šaĀ is split into segments (each element of the sequence belongs to exactly one segment, each segment is a group of consecutive elements of sequence); for each segment, its length … Read more
Masha and a Beautiful Tree solution codeforces Masha and a Beautiful Tree solution codeforces – The girl named Masha was walking in the forest and found a complete binary tree of height šnĀ and a permutationĀ špĀ of lengthĀ š=2šm=2n. A complete binary tree of heightĀ šnĀ is a rooted tree such that every vertex except the leaves has exactly two … Read more
Minimize the Thickness solution codeforces Minimize the Thickness solution codeforces – You are given a sequence š=[š1,š2,ā¦,šš]a=[a1,a2,ā¦,an]Ā consisting ofĀ šnĀ positiveĀ integers. Let’s call a group of consecutive elements aĀ segment. EachĀ segmentĀ is characterized by two indices: the index of its left end and the index of its right end. Denote byĀ š[š,š]a[l,r]Ā aĀ segmentĀ of the sequenceĀ šaĀ with the left end inĀ šlĀ and the right end … Read more
Funny Permutation solution codeforces Funny Permutation solution codeforces – A sequence of šnĀ numbers is calledĀ permutationĀ if it contains all numbers fromĀ 11Ā toĀ šnĀ exactly once. For example, the sequencesĀ [3,1,4,2][3,1,4,2], [11] andĀ [2,1][2,1]Ā are permutations, butĀ [1,2,1][1,2,1],Ā [0,1][0,1]Ā andĀ [1,3,4][1,3,4]Ā are not. For a given numberĀ šnĀ you need to make a permutationĀ špĀ such that two requirements are satisfied at the same time: For each elementĀ ššpi, at least one of … Read more
Compare T-Shirt Sizes solution codeforces Compare T-Shirt Sizes solution codeforces – Two T-shirt sizes are given: šaĀ andĀ šb. The T-shirt size is either a stringĀ MĀ or a string consisting of several (possibly zero) charactersĀ XĀ and one of the charactersĀ SĀ orĀ L. For example, stringsĀ M,Ā XXL,Ā S,Ā XXXXXXXSĀ could be the size of some T-shirts. And the stringsĀ XM,Ā LL,Ā SXĀ are not sizes. The letterĀ MĀ stands for medium,Ā SĀ for small,Ā LĀ for … Read more
Swap and Take solution codeforces – You’re given an array consisting of šnĀ integers. You have to performĀ šnĀ turns. [Solution] Swap and Take solution codeforces Initially your score isĀ 00. On theĀ ši-th turn, you are allowed to leave the array as it is or swap any one pair ofĀ 22Ā adjacent elements in the array and change exactly one of … Read more
Equal Binary Subsequences solution codeforces – Everool has a binary string š sĀ of lengthĀ 2š2n. Note that a binary string is a string consisting of only charactersĀ 00Ā andĀ 11. He wants to partitionĀ š sĀ into twoĀ disjoint equalĀ subsequences. He needs your help to do it. [Solution] Equal Binary Subsequences solution codeforces You are allowed to do the following operationĀ exactlyĀ once. You can choose … Read more
Good Subarrays (Hard Version) solution codeforces – An array šbĀ of lengthĀ šmĀ isĀ goodĀ if for allĀ šiĀ theĀ ši-th element is greater than or equal toĀ ši. In other words,Ā šbĀ isĀ goodĀ if and only ifĀ ššā„šbiā„iĀ for allĀ šiĀ (1ā¤šā¤š1ā¤iā¤m). [Solution] Good Subarrays (Hard Version) solution codeforces You are given an arrayĀ šaĀ consisting ofĀ šnĀ positive integers, and you are askedĀ šqĀ queries. In each query, you are given two integersĀ špĀ andĀ š„xĀ (1ā¤š,š„ā¤š1ā¤p,xā¤n). You have … Read more