OJ Board

Code: Select all

var f, p, c, n, m, s, t, i, j, k : longint;
begin
  readln(c);
  for p := 1 to c do begin
    readln(n, m, s, t);
    while m >= 50000 do write;
    for f := 1 to m do readln(i, j, k);
  end;
end.

Code: Select all

var f, p, c, n, m, s, t, i, j, w : longint; 
begin 
  readln(c); 
  for p := 1 to c do begin 
    readln(n, m, s, t); 
    for f := 1 to m do begin
      readln(i, j, w); 
      while w > 10000 do write;
    end;
  end; 
end.

Code: Select all

#include<cstdio>
#include<list>
#include<queue>
using namespace std;

#define maxv 20010
#define INF 999999999

struct node{int v,cost;};

list<node> G[maxv];	
int D[maxv];
int V,E,S,T;

//*************************Dijkstra*************************//
class Qele				//Q elements
{ 
	public: int v; 
	bool operator<(const Qele &t)const{	return D[t.v]<D[v];}
};
void Dijkstra(int s)
{
	int c1,v;
   Qele A[maxv];
	for(c1=0;c1<V;c1++) D[c1]=INF;
	for(c1=0;c1<V;c1++) A[c1].v=c1;
   D[s]=0;
	list<node>::iterator Adj;

	for(c1=0;c1<V;c1++){
		make_heap(A+c1,A+V);
		v=A[c1].v;
		if(v==T) break;
		for(Adj=G[v].begin();Adj!=G[v].end();Adj++)
			if( D[Adj->v]>D[v]+Adj->cost)
				D[Adj->v]=D[v]+Adj->cost;
    }
}
//*************************Dijkstra*************************//

void Init()
{
	int c1;
	for(c1=0;c1<=V;c1++)
	{
		G[c1].clear();
		D[c1]=INF;
	}

}

int main()
{
	freopen("10986.txt","r",stdin);
	int c1,cas,casc=0,v1,v2,cost;
	node n;
	scanf("%d",&cas);
	for(casc=1;casc<=cas;casc++)
	{
		Init();

		scanf("%d %d %d %d",&V,&E,&S,&T);
		for(c1=0;c1<E;c1++)
		{
			scanf("%d %d %d ",&v1,&v2,&cost);

			n.cost=cost;
			n.v=v2;
			G[v1].push_back(n);
			n.v=v1;
			G[v2].push_back(n);
		}

		Dijkstra(S);
		if(D[T]==INF)
			printf("Case #%d: unreachable\n",casc);
		else
			printf("Case #%d: %d\n",casc,D[T]);

	}
	return 0;
}