test/verify/yukicoder-1602.test.cpp

• View this file on GitHub
• Last update: 2024-05-01 23:44:47+09:00
• Problem: https://yukicoder.me/problems/no/1602

Depends on

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

Code

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

#include "../../template/template.hpp"

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

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";
  }
}

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

#line 1 "template/template.hpp"
#include <bits/stdc++.h>

using namespace std;

using int64 = long long;

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 {
  explicit 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)};
}
#line 4 "test/verify/yukicoder-1602.test.cpp"

#line 1 "graph/shortest-path/shortest-nonzero-path.hpp"
/**
 * @brief Shortest Nonzero Path(群ラベル制約付き単一始点最短路)
 */
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};
}
#line 6 "test/verify/yukicoder-1602.test.cpp"

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";
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	extreme1.txt	AC	6 ms	4 MB
g++	extreme2.txt	AC	6 ms	4 MB
g++	extreme3.txt	AC	7 ms	4 MB
g++	extreme4.txt	AC	8 ms	4 MB
g++	extreme5.txt	AC	8 ms	4 MB
g++	extreme6.txt	AC	9 ms	4 MB
g++	extreme7.txt	AC	147 ms	25 MB
g++	extreme8.txt	AC	138 ms	25 MB
g++	extreme9.txt	AC	279 ms	26 MB
g++	large1.txt	AC	241 ms	26 MB
g++	large2.txt	AC	214 ms	26 MB
g++	large3.txt	AC	222 ms	26 MB
g++	large4.txt	AC	209 ms	26 MB
g++	large5.txt	AC	216 ms	26 MB
g++	large6.txt	AC	212 ms	26 MB
g++	large7.txt	AC	196 ms	26 MB
g++	large8.txt	AC	205 ms	26 MB
g++	large9.txt	AC	211 ms	26 MB
g++	middle1.txt	AC	10 ms	4 MB
g++	middle2.txt	AC	9 ms	4 MB
g++	middle3.txt	AC	9 ms	4 MB
g++	middle4.txt	AC	9 ms	4 MB
g++	middle5.txt	AC	9 ms	4 MB
g++	middle6.txt	AC	9 ms	4 MB
g++	middle7.txt	AC	9 ms	4 MB
g++	middle8.txt	AC	9 ms	4 MB
g++	middle9.txt	AC	9 ms	4 MB
g++	sample1.txt	AC	6 ms	4 MB
g++	sample2.txt	AC	6 ms	4 MB
g++	sample3.txt	AC	6 ms	4 MB
g++	small1.txt	AC	7 ms	4 MB
g++	small2.txt	AC	7 ms	4 MB
g++	small3.txt	AC	6 ms	4 MB
g++	small4.txt	AC	6 ms	4 MB
g++	small5.txt	AC	6 ms	4 MB
g++	small6.txt	AC	6 ms	4 MB
g++	small7.txt	AC	7 ms	4 MB
g++	small8.txt	AC	6 ms	4 MB
g++	small9.txt	AC	6 ms	4 MB
clang++	extreme1.txt	AC	7 ms	4 MB
clang++	extreme2.txt	AC	6 ms	4 MB
clang++	extreme3.txt	AC	6 ms	4 MB
clang++	extreme4.txt	AC	8 ms	4 MB
clang++	extreme5.txt	AC	8 ms	4 MB
clang++	extreme6.txt	AC	10 ms	4 MB
clang++	extreme7.txt	AC	155 ms	25 MB
clang++	extreme8.txt	AC	126 ms	25 MB
clang++	extreme9.txt	AC	213 ms	26 MB
clang++	large1.txt	AC	201 ms	26 MB
clang++	large2.txt	AC	198 ms	26 MB
clang++	large3.txt	AC	199 ms	26 MB
clang++	large4.txt	AC	224 ms	26 MB
clang++	large5.txt	AC	204 ms	26 MB
clang++	large6.txt	AC	195 ms	26 MB
clang++	large7.txt	AC	204 ms	26 MB
clang++	large8.txt	AC	205 ms	26 MB
clang++	large9.txt	AC	196 ms	26 MB
clang++	middle1.txt	AC	9 ms	4 MB
clang++	middle2.txt	AC	9 ms	4 MB
clang++	middle3.txt	AC	8 ms	4 MB
clang++	middle4.txt	AC	8 ms	4 MB
clang++	middle5.txt	AC	8 ms	4 MB
clang++	middle6.txt	AC	8 ms	4 MB
clang++	middle7.txt	AC	8 ms	4 MB
clang++	middle8.txt	AC	8 ms	4 MB
clang++	middle9.txt	AC	9 ms	4 MB
clang++	sample1.txt	AC	6 ms	4 MB
clang++	sample2.txt	AC	6 ms	4 MB
clang++	sample3.txt	AC	6 ms	4 MB
clang++	small1.txt	AC	6 ms	4 MB
clang++	small2.txt	AC	6 ms	4 MB
clang++	small3.txt	AC	6 ms	4 MB
clang++	small4.txt	AC	6 ms	4 MB
clang++	small5.txt	AC	6 ms	4 MB
clang++	small6.txt	AC	6 ms	4 MB
clang++	small7.txt	AC	6 ms	4 MB
clang++	small8.txt	AC	6 ms	4 MB
clang++	small9.txt	AC	6 ms	4 MB

Back to top page