1106. Lowest Price in Supply Chain (25)

#include <iostream>
#include <vector>
#include <queue>using namespace std;double p, r;
vector<int> v[100010];
queue<int> q;
int flag, bfscount;void bfs()
{int qsize = q.size(), cur, vsize, i;while(qsize--){cur = q.front();q.pop();vsize = v[cur].size();if(vsize == 0){flag = 1;bfscount++;}else{for(i = 0; i < vsize; i++){q.push(v[cur][i]);}}}qsize = q.size();if(flag == 0 && qsize > 0){p *= r;bfs();}
}int main()
{int n;scanf("%d%lf%lf", &n, &p, &r);r = 1 + r / 100;int i, j, k, next;for(i = 0; i < n; i++){scanf("%d", &k);for(j = 0; j < k; j++){scanf("%d", &next);v[i].push_back(next);}}q.push(0);bfs();printf("%.4lf %d\n", p, bfscount);system("pause");return 0;
}