Cod sursa(job #1339215)
Utilizator | berindeie virgil vergilius_be | Data | 10 februarie 2015 19:24:49 |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.77 kb |
program pas;
var a:array[1..100,1..100] of integer;
n,m,s,x,y,min,i,j:integer;
{ viz,cod:array[1..100] of integer;}
f,g:text;
{procedure bf(n:integer);
var x,i:integer;
begin
viz[n]:=1;
cod[n]:=n;
end; }
begin
assign(f,'bfs.in');
reset(f);
assign(g,'bfs.out');
rewrite(g);
readln(f,n,m,s);
for i:=1 to m do
begin
readln(f,x,y);
a[x,y]:=1;
end;
for i:=1 to n do
begin
if i=s then
write(g,0,' ')
else
if a[s,i]=1 then
write(g,'1',' ')
else
write(g,'-1',' ');
end;
writeln(g);
close(f);
close(g);
end.