The incorrect test #22 has been fixed.

In my case WA 10 was caused by one directional roads, not <->.
"In a country, there is a number of cities connected by unidirectional roads"

From your words I can conclude what though your solution doesn't output any loops, It has some other bugs :) Leave you mail, may be I can help you.

I had problems with WA#9 and WA#10 due to bugs in my code, nothing conceptual. My solution considers loops, but the way it selects path for the answer, it will never attempt to backtrace a loopy one.

Edited by author 13.07.2008 23:58

Test 21 seems to be OK. Check carefully that your route has cost and time no more than MAX.

Oh, it is really super bug!
This code:
struct Pair
{
    int vert;
    int cost;

    bool operator < (const Pair & other) const
    {
        return ((vert < other.vert) || ((vert == other.vert)&&(cost < other.cost)));
    }

    bool operator == (const Pair & other) const
    {
        return ((vert == other.vert) && (cost == other.cost));
    }

    void set(int v, int c)
    {
        vert = v;
        cost = c;
    }
};
got WA # 9.

But this:
struct Pair
{
    int vert;
    int cost;

    bool operator < (const Pair & other) const
    {
        return ((vert < other.vert) || ((vert == other.vert)&&(cost < other.cost)));
    }

    bool operator == (const Pair & other) const
    {
        return ((vert == other.vert) && (cost == other.cost));
    }

    void set(int v, int c)
    {
        vert = v;
        cost = c;
    }

    void operator = (const Pair & other)
    {
        vert = other.vert;
        cost = other.cost;
    }
};

got Accepted!

Intel C++ compiler really differs from the others :)

Edited by author 19.02.2007 20:03