qwesde

题目链接并查集入门#include<cstdio>#include<algorithm>#include<iostream>#include<cstring>#include<string>#include<cmath>#include<queue>#include<map>#include<set>#include<cstdlib>#include<vector>using

题意链接 题意：给出一个图，告诉每个点之间的边的颜色（有重边），问你任意两点之间有多少边连接。 解法：并查集处理，f[x][c]：表示与x 链接且颜色是c的顶点y AAA：姿势不对 会超时，正确的姿势是unordered_map,其暴力遍历的时候要循环小的#include<bits/stdc++.h>using namespace std;#define LL long long#de

思路：利用并查集缩点，把相等的点看成一个，然后他们的父亲的号，就相当于他们的新号#include<cstdio>#include<iostream>#include<algorithm>#include<cmath>#include<set>#include<map>#include<string>#include<cstring>#include<stack>#include<

1021. Deepest Root (25)时间限制1500 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueA graph which is connected and acyclic can be considered a tree. The height of the tree depend

Is It A Tree?Time Limit:1000MS    Memory Limit:10000KB    64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 1308DescriptionA tree is a well-known data structure that is either emp

04-2. File Transfer (25)时间限制150 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者CHEN, YueWe have a network of computers and a list of

小希的迷宫Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27063    Accepted Submission(s): 8353Problem Description上次Gardon的迷宫城堡小希玩了很久