Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include<limits>
- #include <queue>
- #include <string>
- #include <vector>
- using namespace std;
- #define size 1001
- vector <int> parent(size); // родитель
- vector <int> child(size); // ребенок
- int dead[size]; // мертвые внутри
- void dfs(int d, int f)
- {
- dead[d] = 1;
- if (!f)
- {
- for (int i = 0; i < parent[u].size(); i++)
- {
- if (!dead[parent[d][i]])dfs(parent[u][i], f);
- }
- }
- else
- {
- for (int i = 0; i < child[u].size(); i++)
- {
- if (!dead[child[d][i]])dfs(child[u][i], f);
- }
- }
- }
- int main()
- {
- int n; // кол-во жителей
- cin >> n;
- int b, c;
- while (1)
- {
- int i = 0;
- ++i;
- cin >> b >> c;
- if ((b < 1) || (c < 1))
- {
- break;
- }
- parent.push_back(b);
- cout << parent[i] << endl;
- child.push_back(c);
- cout << child[i] << endl;
- cin.ignore(numeric_limits<streamsize>::max(), '\n');
- cin.clear();
- cin.get();
- }
- while (1)
- {
- int p, i;
- ++i;
- cin >> p;
- if (p < 1)
- {
- break;
- }
- dead[i] = p;
- cin.ignore(numeric_limits<streamsize>::max(), '\n');
- cin.clear();
- cin.get();
- }
- bool dead = false;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement