test/verify/aoj-alds-1-11-c.test.cpp

View this file on GitHub
Last update: 2026-08-10 10:55:59+00:00
Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_11_C

Depends on

Code

// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_11_C
// clang-format on

#include <iostream>
#include <limits>

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

using namespace std;

int main() {
  int N;
  cin >> N;
  Graph<> g(N);
  for (int i = 0; i < N; i++) {
    int U, K;
    cin >> U >> K;
    --U;
    for (int j = 0; j < K; j++) {
      int x;
      cin >> x;
      --x;
      g.add_directed_edge(U, x);
    }
  }
  auto d = bfs(g, 0);
  for (int i = 0; i < N; i++) {
    cout << i + 1 << " ";
    if (d[i] == numeric_limits<int>::max())
      cout << -1 << "\n";
    else
      cout << d[i] << "\n";
  }
}

#line 1 "test/verify/aoj-alds-1-11-c.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_11_C
// clang-format on

#include <iostream>
#include <limits>

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

#include <algorithm>
#line 5 "graph/shortest-path/bfs.hpp"
#include <queue>
#include <vector>

#line 2 "graph/graph-template.hpp"

#include <cstddef>
#line 6 "graph/graph-template.hpp"

template <typename T = int>
struct Edge {
  int from, to;
  T cost;
  int idx;

  Edge() = default;

  Edge(int from, int to, T cost = 1, int idx = -1)
      : from(from), to(to), cost(cost), idx(idx) {}

  operator int() const { return to; }
};

template <typename T = int>
struct Graph {
  std::vector<std::vector<Edge<T> > > g;
  int es;

  Graph() = default;

  explicit Graph(int n) : g(n), es(0) {}

  std::size_t size() const { return g.size(); }

  void add_directed_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es++);
  }

  void add_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es);
    g[to].emplace_back(to, from, cost, es++);
  }

  void read(int M, int padding = -1, bool weighted = false,
            bool directed = false) {
    for (int i = 0; i < M; i++) {
      int a, b;
      std::cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if (weighted) std::cin >> c;
      if (directed)
        add_directed_edge(a, b, c);
      else
        add_edge(a, b, c);
    }
  }

  inline std::vector<Edge<T> >& operator[](const int& k) { return g[k]; }

  inline const std::vector<Edge<T> >& operator[](const int& k) const {
    return g[k];
  }
};

template <typename T = int>
using Edges = std::vector<Edge<T> >;
#line 9 "graph/shortest-path/bfs.hpp"

/**
 * @brief BFS(幅優先探索)
 */
template <typename T>
std::vector<T> bfs(const Graph<T>& g, int s) {
  T max_cost = 0, beet = 0;
  for (auto& es : g.g) {
    for (auto& e : es) max_cost = std::max(max_cost, e.cost);
  }
  ++max_cost;
  const auto INF = std::numeric_limits<T>::max();
  std::vector<T> dist(g.size(), INF);
  std::vector<std::queue<int> > ques(max_cost + 1);
  dist[s] = 0;
  ques[0].emplace(s);
  for (T cost = 0; cost <= beet; cost++) {
    auto& que = ques[cost % max_cost];
    while (!que.empty()) {
      int idx = que.front();
      que.pop();
      if (dist[idx] < cost) continue;
      for (auto& e : g[idx]) {
        auto next_cost = cost + e.cost;
        if (dist[e.to] <= next_cost) continue;
        ;
        dist[e.to] = next_cost;
        beet = std::max(beet, dist[e.to]);
        ques[dist[e.to] % max_cost].emplace(e.to);
      }
    }
  }
  return dist;
}
#line 9 "test/verify/aoj-alds-1-11-c.test.cpp"

using namespace std;

int main() {
  int N;
  cin >> N;
  Graph<> g(N);
  for (int i = 0; i < N; i++) {
    int U, K;
    cin >> U >> K;
    --U;
    for (int j = 0; j < K; j++) {
      int x;
      cin >> x;
      --x;
      g.add_directed_edge(U, x);
    }
  }
  auto d = bfs(g, 0);
  for (int i = 0; i < N; i++) {
    cout << i + 1 << " ";
    if (d[i] == numeric_limits<int>::max())
      cout << -1 << "\n";
    else
      cout << d[i] << "\n";
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	1	AC	2 ms	4 MB
g++	2	AC	2 ms	4 MB
g++	3	AC	2 ms	3 MB
g++	4	AC	2 ms	4 MB
g++	5	AC	2 ms	4 MB
g++	6	AC	2 ms	4 MB
g++	7	AC	2 ms	4 MB
g++	8	AC	2 ms	4 MB
clang++	1	AC	2 ms	4 MB
clang++	2	AC	2 ms	4 MB
clang++	3	AC	2 ms	4 MB
clang++	4	AC	2 ms	4 MB
clang++	5	AC	2 ms	4 MB
clang++	6	AC	2 ms	4 MB
clang++	7	AC	2 ms	4 MB
clang++	8	AC	2 ms	4 MB