Cod sursa(job #534088)
Utilizator | Vlad Eu freaking | Data | 15 februarie 2011 09:46:19 |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio>
#include <vector>
#include <deque>
#define NMAX 5000
#define push_back pb
vector<int> a[NMAX];
vector<int>::iterator it;
deque<int> dq;
void citire()
{
int t,f,i,k;
FILE *in = fopen( "sortaret.in ", "r" );
fscanf( in,"%i" "%i",&n &k);
sum=
for(i=1;i<=k;i++)
{
fscanf(in, "%i" "%i", &t &f)
a[t].pb(f);
}
}
void parcurgere()
{
}
int main()
{
citire();
}