This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub kmyk/competitive-programming-library
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_B"
#ifdef USE_SPFA
#include "../graph/shortest_path_faster_algorithm.hpp"
auto BELLMAN_FORD = shortest_path_faster_algorithm;
#else
#include "../graph/bellman_ford.hpp"
auto BELLMAN_FORD = bellman_ford_shortest_path;
#endif
#include <algorithm>
#include <iostream>
#include "../utils/macros.hpp"
using namespace std;
int main() {
// input
int v, e, root; cin >> v >> e >> root;
vector<vector<pair<int, int64_t> > > g(v);
REP (j, e) {
int s, t, dist; cin >> s >> t >> dist;
g[s].emplace_back(t, dist);
}
// solve
auto dist = BELLMAN_FORD(root, g);
// output
if (count(ALL(dist), LLONG_MIN)) {
cout << "NEGATIVE CYCLE" << endl;
} else {
REP (i, v) {
if (dist[i] == LLONG_MAX) {
cout << "INF" << endl;
} else {
cout << dist[i] << endl;
}
}
}
return 0;
}
Traceback (most recent call last):
File "/opt/hostedtoolcache/Python/3.9.6/x64/lib/python3.9/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
File "/opt/hostedtoolcache/Python/3.9.6/x64/lib/python3.9/site-packages/onlinejudge_verify/languages/cplusplus.py", line 187, in bundle
bundler.update(path)
File "/opt/hostedtoolcache/Python/3.9.6/x64/lib/python3.9/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 400, in update
raise BundleErrorAt(path, i + 1, "unable to process #include in #if / #ifdef / #ifndef other than include guards")
onlinejudge_verify.languages.cplusplus_bundle.BundleErrorAt: graph/bellman_ford.test.cpp: line 3: unable to process #include in #if / #ifdef / #ifndef other than include guards