Submission #379529

#	Time	Username	Problem	Language	Result	Execution time	Memory
379529		SuhaibSawalha1	Connecting Supertrees (IOI20_supertrees)	C++14	96 / 100	311 ms	24188 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

struct DSU {

  vector<int> dsu, sz;

  DSU (int n) {
    dsu.resize(n);
    iota(dsu.begin(), dsu.end(), 0);
    sz.resize(n, 1);
  }

  int find (int u) {
    return u == dsu[u] ? u : dsu[u] = find(dsu[u]);
  }

  bool unite (int u, int v) {
    if ((u = find(u)) != (v = find(v))) {
      if (sz[u] < sz[v]) {
        swap(u, v);
      }
      dsu[v] = u;
      sz[u] += sz[v];
      return 1;
    }
    return 0;
  }
};
    
int construct(vector<vector<int>> p) {
  int n = p.size();
  vector<vector<int>> ans(n, vector<int>(n));
  DSU nodes(n);
  bool two = 0;
  auto sit = [&] (int i, int j, int t) {
    ans[i][j] = ans[j][i] = t;
  };
  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      if (p[i][j] == 1) {
        sit(i, j, nodes.unite(i, j));
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (p[i][j] == 0 && nodes.find(i) == nodes.find(j)) {
        return 0;
      }
    }
  }
  vector<vector<int>> c(n);
  for (int i = 0; i < n; ++i) {
    c[nodes.find(i)].push_back(i);
  }
  DSU cmp(n);
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      if (p[i][j] == 2) {
        cmp.unite(nodes.find(i), nodes.find(j));
      }
    }
  }
  vector<vector<int>> C(n);
  for (int i = 0; i < n; ++i) {
    C[cmp.find(i)].push_back(i);
  }
  for (int i = 0; i < n; ++i) {
    if (i != cmp.find(i)) {
      continue;
    }
    for (int j = 0; j < n; ++j) {
      if (nodes.find(i) != nodes.find(j) && cmp.find(i) == cmp.find(j) && p[i][j] != 2) {
        return 0;
      }
    }
    for (int j : c[i]) {
      for (int k = 0; k < n; ++k) {
        if ((p[k][i] == 2) ^ (p[j][k] == 2)) {
          return 0;
        }
      }
    }
    for (int j = 0; j < C[i].size(); ++j) {
      for (int k = j + 1; k < C[i].size(); ++k) {
        if (p[C[i][j]][C[i][k]] ^ 2) {
          return 0;
        }
      }
    }
    if (C[i].size() == 2) {
      return 0;
    }
    if (C[i].size() > 2) {
      sit(C[i][0], C[i][1], 1);
      sit(C[i][1], C[i][2], 1);
      for (int j = 3; j < C[i].size(); ++j) {
        sit(C[i][j], C[i][j - 1], 1);
      }
      sit(C[i].back(), C[i][0], 1);
    }
  }
  build(ans);
  return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:86:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for (int j = 0; j < C[i].size(); ++j) {
      |                     ~~^~~~~~~~~~~~~
supertrees.cpp:87:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |       for (int k = j + 1; k < C[i].size(); ++k) {
      |                           ~~^~~~~~~~~~~~~
supertrees.cpp:99:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |       for (int j = 3; j < C[i].size(); ++j) {
      |                       ~~^~~~~~~~~~~~~
supertrees.cpp:36:8: warning: unused variable 'two' [-Wunused-variable]
   36 |   bool two = 0;
      |        ^~~

• Subtask 1: 11 / 11
• Subtask 2: 10 / 10
• Subtask 3: 19 / 19
• Subtask 4: 35 / 35
• Subtask 5: 21 / 21
• Subtask 6: 0 / 4