2021年3月4日
2020 BIT冬训-图&&DFS&&BFS K - Harmonious Graph CodeForces - 1253D（并查集）
摘要： Problem Description You're given an undirected graph with n nodes and m edges. Nodes are numbered from 1 to n. The graph is considered harmonious if a 阅读全文
posted @ 2021-03-04 20:34 mikku 阅读(62) 评论(0) 推荐(0)
2020 BIT冬训-C++图&&DFS&&BFS J - Cyclic Components CodeForces - 977E
摘要： Problem Description You are given an undirected graph consisting of nn vertices and mm edges. Your task is to find the number of connected components 阅读全文
posted @ 2021-03-04 18:58 mikku 阅读(80) 评论(0) 推荐(0)