Pls... help me out with this problem
http://www.spoj.com/problems/ANGELS/
It uses bipartite matching i guess. But am not able to build the graph .
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Find user
→ Recent actions
Is there any condition for a graph to have a circuit that is both eulerian and hamiltonian ??
I came across this problem on Uva online judge from NWERC regional semilive 2010
I have thought about a method where map<vector<pair<int,int>>,int> dp stores the best possible score Jan for the state vector<pair<int,int>>.... but i dont know how to proceed further and feel that the method is inefficient...
please help......
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/05/2024 19:28:59 (i1).
Desktop version, switch to mobile version.
Supported by
