Lngxling的博客

C. Knight Tournamenttime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHooray! Berl II, the king of Berland i

I hope you know the beautiful Union-Find structure. In this problem, you’re to implement somethingsimilar, but not identical.The data structure you need to write is also a collection of disjoint s

B. Mr. Kitayuta's Colorful Graphtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr. Kitayuta has just bough

How Many TablesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34088    Accepted Submission(s): 17022Problem DescriptionToday is

The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 42212 Accepted: 20362DescriptionSevere acute respiratory syndrome (SARS), an atypical pneu

Wireless NetworkTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 30641 Accepted: 12741DescriptionAn earthquake takes place in Southeast Asia. The ACM

Assign the taskTime Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3624    Accepted Submission(s): 1498Problem DescriptionThere is

D. Vesselstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is a system of n vessels arranged one abov

并查集—常用来解决有关求连通分支的问题思想：用一个pre[n]数组将各个点联系起来函数：find(int x) join(int x,int y)int find (int x)//递归定义 { return pre[x]==xx:pre[x]=find(pre[x]);}int find(int x)//通常定义 { int r=x; wh

原题链接CodeForces - 505B Mr. Kitayuta’s Colorful Graph 一个无向图包含n个点m条边，顶点编号从1到n。 对于每条边有颜色ci， 连接着顶点 ai 和 b i. 下面有q个询问.每条询问有两个整数 — ui 和 vi.找到满足下面条件的颜色个数: 同一种颜色的路径连接顶点 ui 和 顶点 vi Input 第一行是两个整数 — n an

Language:DefaultFind them, Catch themTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 47233Accepted: 14548DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch a

食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 78828 Accepted: 23486Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编号。每个动