Добро пожаловать всем!
Недавно я узнал, MaxFlow, MinCostMaxFlow и Matching...
Где я могу решать проблемы в соответствие?
Спасибо ...
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
Добро пожаловать всем!
Недавно я узнал, MaxFlow, MinCostMaxFlow и Matching...
Где я могу решать проблемы в соответствие?
Спасибо ...
nerd
|
13 лет назад,
#
|
+3
why i'm getting minuses? because of my poor english?
→
Ответить
|
cmd
|
13 лет назад,
#
|
←
Rev. 2
→
0
Try reading it http://codeforces.com/blog/entry/1279?locale=ru . The post similiar to yours (about max flow related problems - matchings, max flow, min cost and etc.). It's in russian, but you can find the links on problems, which are commonly in english.
→
Ответить
|
nerd
|
13 лет назад,
#
|
0
http://informatics.mccme.ru/moodle/mod/statements/view3.php?id=437&chapterid=588
As i understood, here we are given N cubes{with 6 letters on each side} and name. We must answer, if we are able to gather name by using any letter from each cube? If so, how can I use matching here?
→
Ответить
|
cmd
|
13 лет назад,
#
^
|
0
We build graph with two sets of vertecies: 1) cubics, 2) every letter of name. We add edge between cubic i and letter j of name if there are exist letter j on cubic i. Now we just find max matching in bipartite graph. If the size of matching is equal to length of the name, then answer is yes.
→
Ответить
|
Название |
---|