fork download
copy 
  1. program oli3_riconnessioneconbfs; (* ricerca del numero di componenti connessi su  grafo semplice risolto con lista                                di adiacenza e bfs*)
  2. const MAXN =100000;
  3.       Qsize=200000;
  4. var
  5.    N, M, ricorda, conta,contacomponenti,a ,b, h,j: longint;
  6.    graph : array[0..MAXN-1] of array of longint;
  7.    gsize, gcapa: array[0..MAXN-1] of longint;
  8.    visited : array[0..MAXN-1] of boolean;
  9.    S,E,dist : array[0..MAXN-1] of longint;
  10.    q1, q2 : array[0..QSIZE-1] of longint;
  11.    uscita: boolean;
  12.  
  13. procedure bfs(b : longint; var res : array of longint);
  14.  var qhead, qcount, first, second, j : longint;
  15.  
  16.  begin
  17.    q1[0] := b; q2[0] := 0;
  18.    qhead := 0; qcount := 1;
  19.    while qcount > 0 do
  20.        begin
  21.          first := q1[qhead];
  22.          second := q2[qhead];
  23.          inc(qhead);
  24.          if qhead = QSIZE then
  25.          qhead := 0;
  26.          dec(qcount);
  27.          if visited[first] then
  28.          continue;
  29.          visited[first] := True; ricorda:=first;
  30.          conta:=conta+1; (*memorizza il numero di nodi visitati*)
  31.          res[first] := second;
  32.          for j:=0 to gsize[first]-1 do
  33.                  begin
  34.                  q1[(qhead + qcount) mod QSIZE] := graph[first][j];
  35.                  q2[(qhead + qcount) mod QSIZE] := second + 1;
  36.                  inc(qcount);
  37.                 end;
  38.        end;
  39.  end;
  40.  
  41.  
  42. begin
  43.    (*assign(input, 'input.txt'); reset(input);
  44.    assign(output, 'output.txt'); rewrite(output);*)
  45.    readln(N, M);
  46.    j:=1;
  47.    for h:=0 to M-1 do readln (S[h],E[h]);
  48.    while j<=M do begin
  49.      for h:=0 to N-1 do visited[h]:=false;
  50.      for h:=0 to N-1 do
  51.         begin
  52.          setlength(graph[h], 1);
  53.           (* all’inizio, la lista di adiacenza del nodo i ha dimensione 0
  54.             * e capacita’ 1.
  55.              *)
  56.          gsize[h] := 0;
  57.      gcapa[h] := 1;
  58.      dist[h] := maxlongint;
  59.   end;
  60.  for h:=0 to j-1 do
  61.       begin
  62.        a := S[h]; b := E[h];
  63.        (* se ho esaurito i posti nella lista di adiacenza del nodo a *)
  64.        if gsize[a] = gcapa[a] then
  65.             begin
  66.               (* allora raddoppio la sua capacita’ *)
  67.               gcapa[a] := gcapa[a] shl 1;
  68.               setlength(graph[a], gcapa[a]);
  69.             end;
  70.        graph[a][gsize[a]] := b;
  71.        inc(gsize[a]);
  72.        (* se ho esaurito i posti nella lista di adiacenza del nodo b *)
  73.        if gsize[b] = gcapa[b] then
  74.             begin
  75.               (* allora raddoppio la sua capacita’ *)
  76.               gcapa[b] := gcapa[b] shl 1;
  77.               setlength(graph[b], gcapa[b]);
  78.             end;
  79.        graph[b][gsize[b]] :=a;
  80.        inc(gsize[b]);
  81.     end;
  82.    contacomponenti:=1; conta:=0; 
  83.    bfs(0,dist);
  84.    while conta<N do
  85.                     begin 
  86.                         h:=0; uscita:=false;
  87.                         contacomponenti:=contacomponenti+1;
  88.                         while (uscita=false) and (h<N) do  if visited[h]=true then h:=h+1
  89.                                                                               else begin  uscita:=true;ricorda:=h; end;
  90.                         bfs(ricorda,dist);
  91.                     end; 
  92.  writeln (contacomponenti); j:=j+1; end;
  93. end.
Success #stdin #stdout 0.01s 5280KB
comments (?)
stdin
copy 
4 5
0 2
1 3
3 1
1 2
2 3
stdout
copy 
3
2
2
1
1
https://ideone.com/j2faAt
language:
Pascal (fpc 3.0.4)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!