AK_HuangYC的博客

Problem Description某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通（但不一定有直接的道路相连，只要互相间接通过道路可达即可）。问最少还需要建设多少条道路？  Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是城镇数目N (

总结了一下PAT的题目，我们要静下心来，耐心的实现每一个细节，代码实现起来比较不会出bug并查集，我们可以一次一次完成，不要想着一部到位！！！This time, you are supposed to help us collect the data for family-owned property. Given each person's family

When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. A "social cluster" is a set of people who have some of th

You are given an array consisting of n non-negative integersa1, a2, ..., an.You are going to destroy integers in the array one by one. Thus, you are given the permutation of integers from1 to n

DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all com

题意是给出n个城市，n-1条路，每天会修路（删除原本的一条路，然后增添一条新路）这题的亮点就在路只有n-1条，要联通的话只能有一个祖先，且不存在回路...故只要删除有回路的，然后把每个不相连的路连接起来即可....Berland Government decided to improve relations with neighb

Problem DescriptionThese days, you can do all sorts of things online. For example, you can use various websites to make virtual friends. For some people, growing their social network (their friend

Berland has n cities connected by m bidirectional roads. No road connects a city to itself, and each pair of cities is connected by no more than one road. It is not guaranteed that you can get from

问题描述众所周知，萌萌哒六花不擅长数学，所以勇太给了她一些数学问题做练习，其中有一道是这样的：给出一张 nn 个点 n+1n+1 条边的无向图，你可以选择一些边（至少一条）删除。现在勇太想知道有多少种方案使得删除之后图依然联通。当然，这个问题对于萌萌哒六花来说实在是太难了，你可以帮帮她吗？输入描述第一行一个整数表示数据组数 T(T \leq 30)T(T≤30)。每

Problem DescriptionJohn are playing with blocks. There are N blocks (1 M X Y : Put the whole pile containing block X up to the pile containing Y. If X and Y are in the same pile, just ignore t

题意：题意：有n个人，给你m对关系，问有没有同性恋的。 Problem DescriptionBackground Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders

Problem DescriptionToday is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the fri

题目大意：有n次询问，给出a到b区间的总和，问这n次给出的总和中有几次是和前面已近给出的是矛盾的？？Problem DescriptionTT and FF are ... friends. Uh... very very good friends -________-bFF is a bad boy, he is always wooing TT to p

Problem Description上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路

有关系的并查集分在一组~01背包~每组选一个或全选~更新最优解即可~~Just to remind, girls in Arpa's land are really nice.Mehrdad wants to invite some Hoses to the palace for a dancing party. Each Hos has some weightwi a