test/aoj/grl/bellman_ford.test.cpp

• View this file on GitHub
• Last update: 2025-06-16 11:48:07+09:00
• Problem: https://onlinejudge.u-aizu.ac.jp/problems/GRL_1_B

Depends on

• ベルマンフォード法 (lib/graph/bellman_ford.hpp)
• 重み付きグラフ (lib/graph/graph.hpp)

Code

// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/GRL_1_B
#include "graph/bellman_ford.hpp"
#include <iostream>

int main(void) {
    int n, m, r;
    std::cin >> n >> m >> r;
    Graph<int> g(n);
    g.input_edge(m, 0);

    auto dist = bellman_ford(g, r);
    for (int i = 0; i < n; ++i) {
        if (dist[i] == std::numeric_limits<int>::lowest()) {
            std::cout << "NEGATIVE CYCLE\n";
            return 0;
        }
    }
    for (int i = 0; i < n; ++i) {
        if (dist[i] != std::numeric_limits<int>::max()) std::cout << dist[i] << '\n';
        else std::cout << "INF\n";
    }

    return 0;
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/resolver.py", line 291, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 242, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 479, in update
    self._resolve(pathlib.Path(included), included_from=path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 286, in _resolve
    raise BundleErrorAt(path, -1, "no such header")
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: graph/bellman_ford.hpp: line -1: no such header

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00	AC	2 ms	4 MB
g++	00_sample_01	AC	2 ms	4 MB
g++	00_sample_02	AC	2 ms	4 MB
g++	01_small_00	AC	2 ms	4 MB
g++	01_small_01	AC	2 ms	4 MB
g++	02_corner_00	AC	2 ms	4 MB
g++	02_corner_01	AC	2 ms	4 MB
g++	02_corner_02	AC	2 ms	4 MB
g++	02_corner_03	AC	2 ms	4 MB
g++	02_corner_04	AC	2 ms	4 MB
g++	02_corner_05	AC	2 ms	4 MB
g++	02_corner_06	AC	2 ms	4 MB
g++	03_medium_00	AC	2 ms	4 MB
g++	03_medium_01	AC	2 ms	4 MB
g++	03_medium_02	AC	2 ms	4 MB
g++	03_medium_03	AC	2 ms	4 MB
g++	04_rand_00	AC	2 ms	4 MB
g++	04_rand_01	AC	2 ms	3 MB
g++	04_rand_02	AC	2 ms	4 MB
g++	04_rand_03	AC	2 ms	4 MB
g++	04_rand_04	AC	2 ms	4 MB
g++	04_rand_05	AC	2 ms	4 MB
g++	04_rand_06	AC	2 ms	4 MB
g++	04_rand_07	AC	2 ms	4 MB
g++	05_dag_00	AC	2 ms	3 MB
g++	05_dag_01	AC	2 ms	4 MB
g++	05_dag_02	AC	2 ms	4 MB
g++	05_dag_03	AC	2 ms	4 MB
g++	06_ring_00	AC	2 ms	4 MB
g++	06_ring_01	AC	2 ms	4 MB
g++	06_ring_02	AC	2 ms	4 MB
g++	06_ring_03	AC	2 ms	4 MB
g++	07_large_00	AC	2 ms	4 MB
g++	07_large_01	AC	2 ms	4 MB
g++	07_large_02	AC	2 ms	4 MB
g++	07_large_03	AC	2 ms	4 MB
g++	08_maximum_00	AC	2 ms	3 MB
g++	08_maximum_01	AC	4 ms	4 MB
g++	08_maximum_02	AC	2 ms	4 MB
g++	08_maximum_03	AC	3 ms	4 MB

Back to top page