| 25 | } |
| 26 | |
| 27 | int* pars(int n, vi *adj) { |
| 28 | int *res = new int[n]; |
| 29 | memset(res, -1, n << 2); |
| 30 | for (int i = 0; i < n; i++) { |
| 31 | for (int j = 0; j < size(adj[i]); j++) { |
| 32 | res[adj[i][j]] = i; |
| 33 | } |
| 34 | } |
| 35 | return res; |
| 36 | } |
| 37 | |
| 38 | pair<vi*, int> random_tree(int n) { |
| 39 | vi *adj = new vi[n]; |