This documentation is automatically generated by competitive-verifier/competitive-verifier
#include "daylight/graph/floyd.hpp"#include "daylight/base.hpp"
/// @brief ワーシャルフロイド法
/// @param WF 隣接行列(out:最短経路長)
vector<vll> floyd(vector<vll> WF) {
int n = SZ(WF);
REP(i, n) WF[i][i] = 0;
REP(k, n)
REP(i, n) {
if(WF[i][k] == LINF) continue;
REP(j, n) {
if(WF[k][j] == LINF) continue;
chmin(WF[i][j], WF[i][k] + WF[k][j]);
}
}
return WF;
}
Traceback (most recent call last):
File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
bundled_code = language.bundle(path, basedir=basedir)
File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
bundler.update(path)
File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 482, in update
self.update(
File "/home/runner/.local/lib/python3.10/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 477, in update
raise BundleErrorAt(
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: daylight/base.hpp: line 103: unable to process #include in #if / #ifdef / #ifndef other than include guards