fork download
  1. use std::collections::{BTreeSet, HashMap};
  2. fn f<'a>(a: &[&'a str]) -> Vec<Vec<&'a str>> { // '
  3. fn g(mut a: Vec<BTreeSet<usize>>) -> Vec<BTreeSet<usize>> {
  4. for i in 0..a.len() {
  5. for j in 0..a.len() {
  6. if i != j && !a[i].is_disjoint(&a[j]) {
  7. let js = a[j].clone();
  8. a[i].extend(js);
  9. a.remove(j);
  10. return g(a);
  11. }
  12. }
  13. }
  14. a
  15. }
  16. let h = a.iter().map(|&s| s.split('=')).flatten().rev().enumerate().map(|(p, s)| (s, a.len() * 2 - p)).collect::<HashMap<_, _>>();
  17. let a = a.iter().map(|&s| s.split('=').map(|k| *h.get(k).unwrap()).collect::<BTreeSet<_>>()).collect();
  18. let hi = h.iter().map(|(&k, &v)| (v, k)).collect::<HashMap<_, _>>();
  19. g(a).iter().map(|set| set.iter().map(|i| *hi.get(i).unwrap()).collect()).collect()
  20. }
  21. fn main() {
  22. let v = ["a1=a2", "b1=b2", "b3=b2", "c1=c2", "e1=e2",
  23. "a3=a4", "c3=c4", "e1=e3", "a2=a4", "c3=c1",
  24. "b3=a4", "c2=d1", "a4=a5", "d2=c1", "b4=b3", "d3=c3"];
  25. println!("{:?}", f(&v));
  26. }
Success #stdin #stdout 0.01s 5300KB
stdin
Standard input is empty
stdout
[["a1", "a2", "b1", "b2", "b3", "a3", "a4", "a5", "b4"], ["c1", "c2", "c3", "c4", "d1", "d2", "d3"], ["e1", "e2", "e3"]]