test/verify/yukicoder-1602.test.cpp

• View this file on GitHub
• Last update: 2026-08-10 15:44:16+00:00
• Problem: https://yukicoder.me/problems/no/1602

Depends on

• Shortest Nonzero Path(群ラベル制約付き単一始点最短路) (graph/shortest-path/shortest-nonzero-path.hpp)

Code

// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/1602

#include <cstdint>
#include <iostream>
#include <limits>
#include <string>

#include "../../graph/shortest-path/shortest-nonzero-path.hpp"

using namespace std;

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_t, 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] >= numeric_limits<int64_t>::max())
      cout << -1 << "\n";
    else
      cout << ret[i] << "\n";
  }
}

#line 1 "test/verify/yukicoder-1602.test.cpp"
// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/1602

#include <cstdint>
#include <iostream>
#include <limits>
#include <string>

#line 2 "graph/shortest-path/shortest-nonzero-path.hpp"

#include <algorithm>
#include <functional>
#line 6 "graph/shortest-path/shortest-nonzero-path.hpp"
#include <queue>
#include <tuple>
#include <utility>
#include <vector>

/**
 * @brief Shortest Nonzero Path(群ラベル制約付き単一始点最短路)
 */
template <typename T, typename S, typename F>
struct ShortestNonzeroPath {
 private:
  constexpr static T INF = std::numeric_limits<T>::max();
  struct edge {
    int to;
    T cost;
    S label;
  };
  std::vector<std::vector<edge> > g;
  F f;
  std::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 {
    std::vector<T> dist;
    std::vector<int> depth, parent;
    std::vector<S> label;
  };

  SP dijkstra(int s) {
    int n = (int)g.size();
    using pi = std::pair<T, int>;
    std::vector<T> dist(n, INF);
    std::vector<int> depth(n, -1), parent(n, -1);
    std::vector<S> label(n, S());
    std::priority_queue<pi, std::vector<pi>, std::greater<> > que;
    dist[s] = T(0);
    depth[s] = 0;
    que.emplace(0, s);
    while (not que.empty()) {
      T cost;
      int u;
      std::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};
  }

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

    uf.assign(n, -1);
    using pi = std::tuple<T, int, int>;
    std::priority_queue<pi, std::vector<pi>, std::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);
          }
        }
      }
    }
    std::vector<T> dist(n, INF);
    std::vector<int> bs;
    while (not que.empty()) {
      T cost;
      int u0, i;
      std::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};
}
#line 9 "test/verify/yukicoder-1602.test.cpp"

using namespace std;

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_t, 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] >= numeric_limits<int64_t>::max())
      cout << -1 << "\n";
    else
      cout << ret[i] << "\n";
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	extreme1	AC	2 ms	4 MB
g++	extreme2	AC	2 ms	4 MB
g++	extreme3	AC	2 ms	4 MB
g++	extreme4	AC	6 ms	4 MB
g++	extreme5	AC	6 ms	4 MB
g++	extreme6	AC	7 ms	4 MB
g++	extreme7	AC	351 ms	25 MB
g++	extreme8	AC	346 ms	25 MB
g++	extreme9	AC	472 ms	26 MB
g++	large1	AC	437 ms	26 MB
g++	large2	AC	440 ms	26 MB
g++	large3	AC	439 ms	26 MB
g++	large4	AC	407 ms	26 MB
g++	large5	AC	407 ms	26 MB
g++	large6	AC	385 ms	26 MB
g++	large7	AC	371 ms	26 MB
g++	large8	AC	328 ms	26 MB
g++	large9	AC	329 ms	25 MB
g++	middle1	AC	7 ms	4 MB
g++	middle2	AC	7 ms	4 MB
g++	middle3	AC	7 ms	4 MB
g++	middle4	AC	6 ms	4 MB
g++	middle5	AC	7 ms	4 MB
g++	middle6	AC	6 ms	4 MB
g++	middle7	AC	6 ms	4 MB
g++	middle8	AC	6 ms	4 MB
g++	middle9	AC	6 ms	4 MB
g++	sample1	AC	2 ms	4 MB
g++	sample2	AC	2 ms	4 MB
g++	sample3	AC	2 ms	3 MB
g++	small1	AC	2 ms	4 MB
g++	small2	AC	2 ms	4 MB
g++	small3	AC	2 ms	3 MB
g++	small4	AC	2 ms	4 MB
g++	small5	AC	2 ms	3 MB
g++	small6	AC	2 ms	4 MB
g++	small7	AC	2 ms	4 MB
g++	small8	AC	2 ms	4 MB
g++	small9	AC	2 ms	4 MB
clang++	extreme1	AC	2 ms	4 MB
clang++	extreme2	AC	2 ms	4 MB
clang++	extreme3	AC	2 ms	4 MB
clang++	extreme4	AC	6 ms	4 MB
clang++	extreme5	AC	6 ms	4 MB
clang++	extreme6	AC	7 ms	4 MB
clang++	extreme7	AC	315 ms	25 MB
clang++	extreme8	AC	319 ms	25 MB
clang++	extreme9	AC	399 ms	26 MB
clang++	large1	AC	388 ms	26 MB
clang++	large2	AC	392 ms	26 MB
clang++	large3	AC	382 ms	26 MB
clang++	large4	AC	354 ms	26 MB
clang++	large5	AC	361 ms	26 MB
clang++	large6	AC	365 ms	26 MB
clang++	large7	AC	340 ms	25 MB
clang++	large8	AC	331 ms	26 MB
clang++	large9	AC	351 ms	25 MB
clang++	middle1	AC	7 ms	4 MB
clang++	middle2	AC	7 ms	4 MB
clang++	middle3	AC	7 ms	4 MB
clang++	middle4	AC	6 ms	4 MB
clang++	middle5	AC	6 ms	4 MB
clang++	middle6	AC	6 ms	4 MB
clang++	middle7	AC	6 ms	4 MB
clang++	middle8	AC	7 ms	4 MB
clang++	middle9	AC	6 ms	4 MB
clang++	sample1	AC	2 ms	4 MB
clang++	sample2	AC	2 ms	4 MB
clang++	sample3	AC	2 ms	4 MB
clang++	small1	AC	2 ms	4 MB
clang++	small2	AC	2 ms	4 MB
clang++	small3	AC	2 ms	4 MB
clang++	small4	AC	2 ms	4 MB
clang++	small5	AC	2 ms	4 MB
clang++	small6	AC	2 ms	4 MB
clang++	small7	AC	2 ms	4 MB
clang++	small8	AC	2 ms	4 MB
clang++	small9	AC	2 ms	4 MB

Back to top page