#702561 (C++17) No.1690 Power Grid

• 問題: No.1690 Power Grid
• ユーザー: mai
• 提出日時: 2021-09-24 23:12:42
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 7,787 bytes
• コンパイル時間: 3,156 ms
• コンパイル使用メモリ: 224,344 KB
• 実行使用メモリ: 4,380 KB
• 最終ジャッジ日時: 2023-09-18 22:18:36
• 合計ジャッジ時間: 4,593 ms
• ジャッジサーバーID （参考情報）: judge12 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,380 KB
testcase_01	AC	1 ms; 4,380 KB
testcase_02	AC	2 ms; 4,380 KB
testcase_03	AC	2 ms; 4,380 KB
testcase_04	AC	2 ms; 4,380 KB
testcase_05	AC	1 ms; 4,376 KB
testcase_06	AC	39 ms; 4,380 KB
testcase_07	AC	39 ms; 4,380 KB
testcase_08	AC	38 ms; 4,380 KB
testcase_09	AC	38 ms; 4,376 KB
testcase_10	AC	3 ms; 4,380 KB
testcase_11	AC	3 ms; 4,380 KB
testcase_12	AC	2 ms; 4,376 KB
testcase_13	AC	2 ms; 4,376 KB
testcase_14	AC	6 ms; 4,380 KB
testcase_15	AC	3 ms; 4,376 KB
testcase_16	AC	45 ms; 4,376 KB
testcase_17	AC	27 ms; 4,380 KB
testcase_18	AC	13 ms; 4,380 KB
testcase_19	AC	50 ms; 4,380 KB
testcase_20	WA	-
testcase_21	AC	3 ms; 4,380 KB
testcase_22	AC	14 ms; 4,380 KB
testcase_23	AC	3 ms; 4,380 KB
testcase_24	WA	-
testcase_25	AC	3 ms; 4,380 KB
testcase_26	AC	3 ms; 4,380 KB
testcase_27	AC	1 ms; 4,380 KB

コンパイルメッセージ

メンバ関数 ‘int Unionfind::root(int)’ 内,
    inlined from ‘int Unionfind::size(int)’ at main.cpp:137:45,
    inlined from ‘ll solve(std::bitset<20>)’ at main.cpp:201:14:
main.cpp:136:47: 警告: ‘p’ may be used uninitialized [-Wmaybe-uninitialized]
  136 |   inline int root(int x) { return (int)(data[x] < 0 ? x : data[x] = root(data[x])); }
      |                                               ^
main.cpp: 関数 ‘ll solve(std::bitset<20>)’ 内:
main.cpp:198:7: 備考: ‘p’ はここで定義されています
  198 |   int p; repeat(i, N) if (ss[i]) { p = i; break; }
      |       ^

ソースコード

#pragma GCC optimize ("O3")
#include <bits/stdc++.h>

// clang-format off
using namespace std;
using ll = long long int;

#define all(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define increase(cnt,b,e) for(auto cnt=(b);(cnt)<(e);++(cnt))
#define decrease(cnt,b,e) for(auto cnt=(b);(e)<=(cnt);--(cnt))
const long long MD = 1000000007; const long double PI = 3.1415926535897932384626433832795L;
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); }
template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr>
inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); }template<typename T>
static ostream& operator<<(ostream& o, const std::vector<T>& v) {
  o << "[ "; for(const auto& e : v) o<<e<<' '; return o << ']';
}

template <typename I> struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} };
template<typename I> static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) {
  o << "[ "; iterate(i,f.b,f.e) o<<*i<<' '; return o << ']';
}
template <typename I> struct MyMatrixFormat{
  const I& p; long long n, m;
  MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){}
};
template<typename I> static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) {
  o<<'\n';
  repeat(i,(f.n)) {
    repeat(j,f.m) o<<f.p[i][j]<<' ';
    o<<'\n';
  }
  return o;
}
struct LOG_t { ~LOG_t() { cout << endl; } };
#define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ")
#define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w))
#define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e))
#define FMTV(v) FMTR(v.begin(),v.end())
#define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w))

#if defined(_WIN32) || defined(_WIN64)
#define getc_x _getc_nolock
#define putc_x _putc_nolock
#elif defined(__GNUC__)
#define getc_x getc_unlocked
#define putc_x putc_unlocked
#else
#define getc_x getc
#define putc_x putc
#endif
class MaiScanner {
  FILE* fp_;
  constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); }
public:
  inline MaiScanner(FILE* fp):fp_(fp){}
  template<typename T> void input_integer(T& var) noexcept {
    var = 0; T sign = 1;
    int cc = getc_x(fp_);
    for (; cc < '0' || '9' < cc; cc = getc_x(fp_))
      if (cc == '-') sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_))
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() noexcept { return getc_x(fp_); }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; }
  inline MaiScanner& operator>>(string& var) {
    int cc = getc_x(fp_);
    for (; !isvisiblechar(cc); cc = getc_x(fp_));
    for (; isvisiblechar(cc); cc = getc_x(fp_))
      var.push_back(cc);
    return *this;
  }
  template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
  FILE* fp_;
public:
  inline MaiPrinter(FILE* fp):fp_(fp){}
  template<typename T>
  void output_integer(T var) noexcept {
    if (var == 0) { putc_x('0', fp_); return; }
    if (var < 0)
      putc_x('-', fp_),
      var = -var;
    char stack[32]; int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10),
      var /= 10;
    while (stack_p)
      putc_x(stack[--stack_p], fp_);
  }
  inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; }
  template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr>
  inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; }
  inline MaiPrinter& operator<<(const char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; }
  inline MaiPrinter& operator<<(const string& str) {
    const char* p = str.c_str();
    const char* l = p + str.size();
    while (p < l) putc_x(*p++, fp_);
    return *this;
  }
  template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
};
MaiScanner scanner(stdin);
MaiPrinter printer(stdout);
// clang-format on

class Unionfind {
 public:
  vector<int> data;
  explicit Unionfind(int size) : data(size, -1) {}
  bool connect(int x, int y) {
    x = root(x);
    y = root(y);
    if (x != y) {
      if (data[y] < data[x])
        swap(x, y);
      data[x] += data[y];
      data[y] = (int)x;
    }
    return x != y;
  }
  inline bool same(int x, int y) { return root(x) == root(y); }
  inline int root(int x) { return (int)(data[x] < 0 ? x : data[x] = root(data[x])); }
  inline int size(int x) { return -data[root(x)]; }
};

class Graph2d {
 public:
  using W_T = ll;
  int n;
  vector<W_T> matrix;

  explicit Graph2d(int size) : n(size), matrix(size * size){};

  inline int size() const { return n; }
  void resize(int s) {
    n = s;
    matrix.resize(n * n);
  }
  void resize(int s, W_T val) {
    n = s;
    matrix.resize(n * n, val);
  }

  inline W_T& at(int y, int x) { return matrix[y * n + x]; }
  inline W_T& operator()(int y, int x) { return matrix[y * n + x]; }
  inline W_T at(int y, int x) const { return matrix[y * n + x]; }
  inline W_T operator()(int y, int x) const { return matrix[y * n + x]; }

  inline void connect(int u, int v, W_T dist = 1) { at(u, v) = at(v, u) = dist; }
  inline void connect_d(int from, int to, W_T dist = 1) {  // directedEdge u->v
    at(from, to) = dist;
  }
};

void warshall_floyd(Graph2d& g) {
  int i, j, k;
  for (i = 0; i < g.n; i++) {
    for (j = 0; j < g.n; j++) {
      for (k = 0; k < g.n; k++) {
        g(j, k) = std::min(g(j, k), g(j, i) + g(i, k));
      }
    }
  }
}

//

int N, M, K;
ll A[22];
vector<pair<int, pair<int, int>>> edges;

//

ll solve(bitset<20> ss) {
  Unionfind uf(N);
  ll total = 0;
  for (auto ee : edges) {
    if (!ss[ee.second.first] || !ss[ee.second.second])
      continue;
    if (uf.connect(ee.second.first, ee.second.second)) {
      total += ee.first;
    }
  }
  int p; repeat(i, N) if (ss[i]) { p = i; break; }
  // LOG << p;
  // LOG << uf.size(p);
  if (uf.size(p) == K) {
    repeat(i, N) if (ss[i]) total += A[i];
    return total;
  } else {
    return numeric_limits<ll>::max();
  }
}

int main() {
  scanner >> N >> M >> K;
  scanner.in(A, A+N);
  
  Graph2d g(N);
  fill(all(g.matrix), numeric_limits<ll>::max()/4);
  repeat(i, M) {
    int x, y, z;
    scanner >> x >> y >> z;
    --x; --y;
    g(x, y) = z;
    g(y, x) = z;
    // edges.emplace_back(z, make_pair(x, y));
  }
  warshall_floyd(g);
  repeat(y, N-1) {
    iterate(x, y+1, N) {
      edges.emplace_back(g(y, x), make_pair(y, x));
    }
  }
  sort(all(edges));
  
  ll best = numeric_limits<ll>::max();
  
  repeat(b, 1 << N) {
    auto s = bitset<20>(b);
    if (int(s.count()) != K) continue;
    chmin(best, solve(s));
  }
  
  cout << best << endl;
  
  return 0;
}