https://www.gravatar.com/avatar/8f3abece0f8608ce4b9c1e3212fd1b72?s=240&d=mp

CF525D-Arthur and Walls

CF525D-Arthur and Walls 题目: 题目描述: Finally it is a day when Arthur has enough money for buying an apartment. He found a great option close to the center of the city with a nice price. Plan of the apartment found by Arthur looks like a rectangle $ n×m $ consisting of squares of size $ 1×1 $ . Each of

CF662B-Graph Coloring

CF662B-Graph Coloring 题目: 题目描述: You are given an undirected graph that consists of $ n $ vertices and $ m $ edges. Initially, each edge is colored either red or blue. Each turn a player picks a single vertex and switches the color of all edges incident to it. That is, all red edges with an endpoint in this vertex change the color to

CF1120D-Power Tree

CF1120D-Power Tree 题目: 题目描述: You are given a rooted tree with $ n $ vertices, the root of the tree is the vertex $ 1 $ . Each vertex has some non-negative price. A leaf of the tree is a non-root vertex that has degree $ 1 $ . Arkady and Vasily play a strange game on the tree. The game consists of three