Code: Select all
while (casos--){
//
//
scanf("%d %d", &pessoas, &pares);
// initialize grafo here
}
Code: Select all
#include <cstdio>
#include <vector>
#include <queue>
std::vector<int> a[1009];
std::queue<int> Q;
int D[1009];
bool color[1009];
void Bfs(int s)
{
int u, v;
color[s] = true;
D[s] = 0;
Q.push(s);
while(!Q.empty())
{
u = Q.front();
Q.pop();
for(int i = 0; i < a[u].size(); ++i)
{
v = a[u][i];
if(!color[v])
{
color[v] = true;
D[v] = D[u]+1;
Q.push(v);
}
}
}
}
int main()
{
int t;
scanf("%d", &t);
//getchar();
//getchar();
for(int i = 0; i < t; ++i)
{
int n, m;
scanf("%d %d", &n, &m);
for(int j = 0; j < n; ++j)
{
color[j] = false;
D[j] = 0;
a[j].clear();
}
int u, v;
for(int j = 0; j < m; ++j)
{
scanf("%d %d", &u, &v);
a[u].push_back(v);
a[v].push_back(u);
}
Bfs(0);
for(int j = 1; j < n; ++j)
printf("%d\n", D[j]);
printf("\n");
}
return 0;
}
There is a extra line at the end of your output. You should only print a blank line between two cases.karo9 wrote:Hi
Can someone help me with this task. I've tried different implementation of bfs but none worked:( here is example :WACode: Select all
#include <cstdio> #include <vector> #include <queue> std::vector<int> a[1009]; std::queue<int> Q; int D[1009]; bool color[1009]; void Bfs(int s) { int u, v; color[s] = true; D[s] = 0; Q.push(s); while(!Q.empty()) { u = Q.front(); Q.pop(); for(int i = 0; i < a[u].size(); ++i) { v = a[u][i]; if(!color[v]) { color[v] = true; D[v] = D[u]+1; Q.push(v); } } } } int main() { int t; scanf("%d", &t); //getchar(); //getchar(); for(int i = 0; i < t; ++i) { int n, m; scanf("%d %d", &n, &m); for(int j = 0; j < n; ++j) { color[j] = false; D[j] = 0; a[j].clear(); } int u, v; for(int j = 0; j < m; ++j) { scanf("%d %d", &u, &v); a[u].push_back(v); a[v].push_back(u); } Bfs(0); for(int j = 1; j < n; ++j) printf("%d\n", D[j]); printf("\n"); } return 0; }
Code: Select all
Got AC!!! Yaeeeeeee!!
While(1) Return Thanks! :D