终有绿洲摇曳在沙漠

1.题目描述： C. Socks time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Arseniy is already grown-up and indep

1.题目描述： 小希的迷宫 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 47213    Accepted Submission(s): 14677 Problem Description 上次Gar

1.题目描述： There are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your un

1.题目概述： 动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。  现有N个动物，以1－N编号。每个动物都是A,B,C中的一种，但是我们并不知道它到底是哪一种。 有人用两种说法对这N个动物所构成的食物链关系进行描述：  第一种说法是"1 X Y"，表示X和Y是同类。  第二种说法是"2 X Y"，表示X吃Y。  此人对N个动物，用上

1.题目描述： The Suspects Time Limit: 1000MS   Memory Limit: 20000K Total Submissions: 36019   Accepted: 17519 Description Severe acute respiratory syndrome (SARS), an

1.题目描述： Find them, Catch them Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 43863   Accepted: 13513 Description The police office in Tadu City decid

1.题目描述： Banana Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 2364   Accepted: 867 Description Consider a tropical forrest, represented as a matrix.

1.题目描述： Is It A Tree? Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 31399   Accepted: 10650 Description A tree is a well-known data structure

1.题目描述： tree Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1406    Accepted Submission(s): 635 Problem Description There is

1.题目描述： How Many Answers Are Wrong Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6989    Accepted Submission(s): 2587 Problem D

1.题目描述： B. Bear and Friendship Condition time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Bear

1.题目描述： C. Timofey and a tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Each New Year Timofey an

Journey to Tibet 题目链接 分类：dsu brute force 1.题意概述 ​ 给出你n(1≤n≤1000)n(1≤n≤1000)个寺庙的坐标，相邻两个寺庙，你最多只能走30km30km现在问你总哪个起点出发，能够走尽可能多的寺庙，相同则输出输入编号的最小值。 2.解题思路 这题本质是求最大的连通块，连通问题，我们都可以考虑用并查集维护，父亲就是集合里面id最小的，

E. Points, Lines and Ready-made Titles 分类： disjoint set math 1.题意概述 平面直角坐标系上有 n(1≤n≤105)n(1\leq n\leq 10^5) 个点，你可以在每个点画一条横线或一条竖线或者不划线。问你构成的图像有多少种不同的图？答案取模 109+710^9+7 。 2.解题思路 考虑这个画图的特殊性，问题可以转化为：这些点

题意： n (1≤n≤5⋅105)n\ (1\le n\le 5\cdot 10^5)n (1≤n≤5⋅105) 个点， k (1≤k≤n−1)k\ (1\le k\le n-1)k (1≤k≤n−1) 条未知权值的边，m (1≤m≤5⋅105)m\ (1\le m\le 5\cdot 10^5)m (1≤m≤5⋅105) 条已知权值的原...