OJ Board

Hi all, isn't this only a BFS problem? I don't know why my code keep TLE. I even use C I/O but it still TLE.

here is the code:

#include<iostream>
#include<cstdio>
#include<queue>
#define INF (1<<29)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORN(i,a) FOR(i,0,a)
using namespace std ...

Hi, im new to UVa and finds that sometimes input-output here quite non-trivial.

I just want to work on this problem http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1219

but I can't code to detect the blank lines between each testcase. I ...

Hello all, just want to ask - I still got WA for this problem

I think my algo is correct, I just compute the distance between each points and do Prim's algorithm to get the MST.
I'm just confused with the output scenario with that "print blank line" rules.
for this input:


3

3
1.0 1.0
2.0 2.0
2 ...