結果

問題 No.1602 With Animals into Institute 2
コンテスト
ユーザー ei1333333
提出日時 2021-07-13 23:12:12
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 346 ms / 4,000 ms
コード長 5,903 bytes
コンパイル時間 2,627 ms
コンパイル使用メモリ 222,920 KB
最終ジャッジ日時 2025-01-23 00:57:35
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
// const int mod = 1e9 + 7;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}


template< typename T, typename S, typename F >
struct ShortestNonzeroPath {
private:
  constexpr static T INF = numeric_limits< T >::max();
  struct edge {
    int to;
    T cost;
    S label;
  };
  vector< vector< edge > > g;
  F f;
  vector< int > uf;

  int find_uf(int k) {
    if(uf[k] == -1) return k;
    return uf[k] = find_uf(uf[k]);
  }

  void unite_uf(int r, int c) {
    uf[c] = r;
  }

public:
  explicit ShortestNonzeroPath(int n, const F &f) : g(n), f(f) {}

  void add_undirected_edge(int u, int v, const T &cost, const S &label) {
    add_directed_edge(u, v, cost, label);
    add_directed_edge(v, u, cost, label);
  }

  void add_directed_edge(int u, int v, const T &cost, const S &label) {
    g[u].emplace_back((edge) {v, cost, label});
  }

  struct SP {
    vector< T > dist;
    vector< int > depth, parent;
    vector< S > label;
  };

  SP dijkstra(int s) {
    int n = (int) g.size();
    using pi = pair< T, int >;
    vector< T > dist(n, INF);
    vector< int > depth(n, -1), parent(n, -1);
    vector< S > label(n, S());
    priority_queue< pi, vector< pi >, greater<> > que;
    dist[s] = T(0);
    depth[s] = 0;
    que.emplace(0, s);
    while(not que.empty()) {
      T cost;
      int u;
      tie(cost, u) = que.top();
      que.pop();
      if(dist[u] < cost) {
        continue;
      }
      for(auto e : g[u]) {
        if(cost + e.cost < dist[e.to]) {
          dist[e.to] = cost + e.cost;
          depth[e.to] = depth[u] + 1;
          parent[e.to] = u;
          label[e.to] = f(label[u], e.label);
          que.emplace(dist[e.to], e.to);
        }
      }
    }
    return {dist, depth, parent, label};
  }

  vector< T > build(int s) {
    int n = (int) g.size();
    auto sp = dijkstra(s);

    uf.assign(n, -1);
    using pi = tuple< T, int, int >;
    priority_queue< pi, vector< pi >, greater<> > que;
    for(int u = 0; u < n; u++) {
      if(sp.dist[u] != INF) {
        for(int i = 0; i < (int) g[u].size(); i++) {
          auto &e = g[u][i];
          if(u < e.to and f(sp.label[u], e.label) != sp.label[e.to]) {
            que.emplace(sp.dist[u] + sp.dist[e.to] + e.cost, u, i);
          }
        }
      }
    }
    vector< T > dist(n, INF);
    vector< int > bs;
    while(not que.empty()) {
      T cost;
      int u0, i;
      tie(cost, u0, i) = que.top();
      que.pop();
      int v0 = g[u0][i].to;
      int u = find_uf(u0), v = find_uf(v0);
      while(u != v) {
        if(sp.depth[u] > sp.depth[v]) {
          bs.emplace_back(u);
          u = find_uf(sp.parent[u]);
        } else {
          bs.emplace_back(v);
          v = find_uf(sp.parent[v]);
        }
      }
      for(auto &x : bs) {
        unite_uf(u, x);
        dist[x] = cost - sp.dist[x];
        for(int j = 0; j < (int) g[x].size(); j++) {
          auto &e = g[x][j];
          if(f(sp.label[x], e.label) == sp.label[e.to]) {
            que.emplace(dist[x] + sp.dist[e.to] + e.cost, x, j);
          }
        }
      }
      bs.clear();
    }
    for(int i = 0; i < n; i++) {
      if(sp.label[i] != S() and sp.dist[i] < dist[i]) {
        dist[i] = sp.dist[i];
      }
    }
    return dist;
  }
};

template< typename T, typename S, typename F >
ShortestNonzeroPath< T, S, F > get_shortest_nonzero_path(int N, const F &f) {
  return ShortestNonzeroPath< T, S, F >{N, f};
}


int main() {
  int N, M, K;
  cin >> N >> M >> K;
  auto f = [](int a, int b) { return a ^ b; };
  auto g = get_shortest_nonzero_path< int64, int >(N, f);
  for(int i = 0; i < M; i++) {
    int a, b, c;
    string x;
    cin >> a >> b >> c >> x;
    --a, --b;
    int d = 0;
    for(int j = 0; j < K; j++) {
      if(x[j] == '1') d |= 1 << j;
    }
    g.add_undirected_edge(a, b, c, d);
  }
  auto ret = g.build(N - 1);
  for(int i = 0; i + 1 < N; i++) {
    if(ret[i] >= infll) cout << -1 << "\n";
    else cout << ret[i] << "\n";
  }
}
0