二分匹配
coldfresh
那我们开始吧
展开
-
过山车 HDU - 2063 (二分匹配)
RPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD或PQK做partner,Grass只愿意和linle或LL做partner,PrincessSnow愿意和水域浪子或伪酷儿做partner。考虑到原创 2017-08-14 14:42:16 · 364 阅读 · 0 评论 -
Tour HDU - 3488(带权二分匹配)(最小花费最大流)
In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have a chance to have a tour in the kingdom. The route should be原创 2017-11-07 14:37:47 · 393 阅读 · 0 评论 -
A new Graph Game HDU - 3435 (二分匹配思想)(最小花费最大流)
传送门 题目同上 史上速度最快ac#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<queue>using namespace std;const int maxn=2005;//点的最大上线const int maxx=44005;//边的最大上线const int INF=1<原创 2017-11-07 15:05:30 · 255 阅读 · 0 评论 -
网络流四·最小路径覆盖 HihoCoder - 1394
传送门怎么说呢,其实这个最小覆盖路径问题是转化成二分匹配问题,而解决匹配问题的则是通过网络流来实现,也就是说在这里网洛流作为一个实现的手段来看待,实际我们要解决的建图的问题。这个就很简单了#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<queue>#define INF 0x3f3f3f3原创 2017-11-03 15:13:25 · 284 阅读 · 0 评论 -
Machine Schedule POJ - 1325 (二分匹配)
As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of the constraints that...原创 2018-04-11 11:26:58 · 227 阅读 · 0 评论 -
The Accomodation of Students HDU - 2444(二分匹配判断+最大匹配)
There are a group of students. Some of them may know each other, while others don’t. For example, A and B know each other, B and C know each other. But this may not imply that A and C know each other....原创 2018-04-26 14:58:20 · 317 阅读 · 0 评论 -
Battle ships HDU - 5093(二分图最大匹配)
Dear contestant, now you are an excellent navy commander, who is responsible of a tough mission currently. Your fleet unfortunately encountered an enemy fleet near the South Pole where the geographi...原创 2018-07-16 20:18:26 · 224 阅读 · 0 评论 -
【Codeforces-741C】Arpa’s overnight party and Mehrdad’s silent entering(二分图的定义)
这题是个好题,考察了二分图的定义,此题实际上可以忽略三个人坐相同颜色的问题,我们按照相2i−1和2i2i-1和2i2i−1和2i连边,然后相应男女连边,这样构成的图是一个二分图,每个点的出度都为2,不存在奇环,这样做了以后能保证答案一定有解。#include<iostream>#include<cstdio>#include<algorithm>#i...原创 2019-04-15 15:56:26 · 327 阅读 · 0 评论