OJ Board

windows2k,

In your DFS code seems that you aren't marking all nodes in the non-bipartite components. Try without recurtion.

Hi,

I was thinking about this problem but could not find a way to build the network with the problem constraints to find the matching.

Could someone give me a hint in how to do this??

Hello windows2k,

The output of my program for this input is: I used the algorithm that witto wrote above.

My accepted program outpus '0' for this input

turuthok,

I tried to submit 'Building Bridges' and got "Can't be Judged".

I used Submit-o-Matic, with Problem # 2721. (from acm.uva.es/archive).

I saw that this problem was submited at last 11 times!
( http://acm.uva.es/cgi-bin/OnlineJudge?ProblemStat:2721 )

I wanna know how submit these ...

I think Christopher is right. Lets look the definition of O notation.

f(x) = O(g(x)) if exists constant c and n0 > 0 such tath f(x) <= c.g(x) for any n >= n0.

Now lets see how many edges exists in a graph. In a complete graph with n vertex there are at most C(n, 2), or n choose 2, edges.

In that ...

Thank's Adrian for the C++ tip. I got AC now.

My code works fine for all examples in this topic but I still get WA. Can any one please tell me what's wrong??

[cpp]
#include <iostream>
#include <string>
#include <map>

using namespace std;

int main () {
int se = 0;

while (!cin.eof()) {
string s, os;
map<string, int> pal;
map<string ...

First read a line to find out the number 'n' of vertex. After that, you must read n^2 numbers, ignoring aditionals or unexpected '\n' :x . Then, read line by line to get the source and destination until a blank line....

Be caerful with "10-1" without space...

This is a multiple input problem too ...

I finally solved the problem.... My program was working fine but reading the input wasn

I'm trying to solve the problem 523 using djikstra algorithm. What I should print when there is no way from c to d???

Using Floyd I got WA too.

I read the comments of the problem and I thing my program is working fine for the (ugly) input.

Anyone can send me a input/output sample???

Thanks...