MasterG

C. An impassioned circulation of affection time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Nadeko's birthday is approaching! As she decor

You have two strings SS and TT in all capitals. Now an efficient program is required to maintain a operation and support a query. The operation C~i~chC i ch with given integer ii and capital let

B. Math Show time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Polycarp takes part in a math show. He is given n tasks, each consists of k s

F. Random Query time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are given an array a consisting of n positive integers. You pick two

D. Monitor time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Recently Luba bought a monitor. Monitor is a rectangular matrix of size n × m.

Problem Description Beerus needs to sort an array of N integers. Algorithms are not Beerus's strength. Destruction is what he excels. He can destroy all unsorted numbers in the array simultaneously.

Description A county consists of n cities (labeled 1, 2, …, n) connected by some bidirectional roads. Each road connects a pair of distinct cities. A robot company has built maintenance points in s

Problem Description Tom owns a company and he is the boss. There are n staffs which are numbered from 1 to n in this company, and every staff has a ability. Now, Tom is going to assign a special task

一个车牌号由n位数字组成。如果一个车牌至少有k位数字是相同的，那么我们就说这个车牌漂亮的车牌。现在华沙想要改变他自己的车牌，使得他的车牌变得漂亮。当然，改车牌是要花钱的。每改变一位数字所要花费的费用等于当前位上的新旧数字之差的绝对值。那么总费用就是每位上所花费用的总和。 举例如下， 旧牌为0123，新牌为7765，那么对应第一位所花费用为|0-7|＝7，第二位为|1-7|＝6，第三位为