# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
9594 | ksmail12 | Your life (kriii2_Y) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
vector<bool> v;
int find(vector<vector<int> > &g, queue<int> &q, int level, int n){
if(q.empty()) return 0;
int curr;
queue<int> next;
while(!q.empty()) {
curr = q.front();
q.pop();
for(vector<int>::iterator it = g[curr].begin(); it!=g[curr].end();it++) {
if(*it == n && v[*it] == false) {
printf("%d\n", level+1);
return level;
}
if(!v[*it] && *it != n) {
v[*it] = true;
next.push(*it);
}
}
}
return find(g, next, level+1, n);
}