diff options
| author | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 17:48:10 +0100 |
|---|---|---|
| committer | Gloria Mundi <gloria@gloria-mundi.eu> | 2024-11-16 18:01:53 +0100 |
| commit | e55df069a8f83b2c0c2b56c035f49e89516cdaaa (patch) | |
| tree | dd6767e3fc6ac8532661dc75886a3056804d1d46 /content/graph/virtualTree.cpp | |
| parent | 72bd993483453ed8ebc462f1a33385cd355d486f (diff) | |
minor fixes, let code breathe where possible
Diffstat (limited to 'content/graph/virtualTree.cpp')
| -rw-r--r-- | content/graph/virtualTree.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/content/graph/virtualTree.cpp b/content/graph/virtualTree.cpp index 6233b27..153ed0b 100644 --- a/content/graph/virtualTree.cpp +++ b/content/graph/virtualTree.cpp @@ -2,11 +2,11 @@ vector<int> in, out; void virtualTree(vector<int> ind) { // indices of used nodes - sort(all(ind), [&](int x, int y) {return in[x] < in[y];}); + sort(all(ind), [&](int x, int y) { return in[x] < in[y]; }); for (int i = 1, n = sz(ind); i < n; i++) { ind.push_back(lca(ind[i - 1], ind[i])); } - sort(all(ind), [&](int x, int y) {return in[x] < in[y];}); + sort(all(ind), [&](int x, int y) { return in[x] < in[y]; }); ind.erase(unique(all(ind)), ind.end()); int n = sz(ind); |