wust_cyh

B. Magic, Wizardry and Wonderstime limit per test：2 secondsmemory limit per test：256 megabytesinput：standard inputoutput：standard outputVasya the Great Magician and Conju

Simply SyntaxTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5618 Accepted: 2510DescriptionIn the land of Hedonia the official language is Hedonian. A Hed

C. Bertown Subwaytime limit per test：1 secondmemory limit per test：256 megabytesinput：standard inputoutput：standard outputThe construction of subway in Bertown is almost

B. Balanced Substringtime limit per test：1 secondmemory limit per test：256 megabytesinput：standard inputoutput：standard outputYou are given a string s consisting only of

B. Chtholly's requesttime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard output— Thanks a lot for today.— I experience

C. Anagram Searchtime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputA string t is called an anagram of the string

B. Quantity of Stringstime limit per test：2 secondsmemory limit per test：256 megabytesinput：standard inputoutput：standard outputJust in case somebody missed it: this wint

C. Cutting Figuretime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputYou've gotten an n × m sheet of squared paper.

题目链接题意：给出一个n*m的矩阵，矩阵上每个点有一种植物，有T次操作，对于每次操作给出两个殿P1，P2，v，要求给以P1为左上角以P2为右下角的子矩阵中每个植物施种类为v的化肥，如果化肥种类和植物种类不一样，这该点的植物会立马死亡，求T次操作结束之后死亡的植物数量。这题比赛时没想到解题方法，赛后看题解大概有三种解法：​    一：二维树状数组​    二：线段树+扫瞄线​  ...