1a:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"CodeViewer"] 1c:I[48988,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","7961","static/chunks/7961-b9b64ba388cef309.js","3729","static/chunks/3729-8164898f6bdc738c.js","8720","static/chunks/8720-56867bcc82acef59.js","8324","static/chunks/8324-1983729ec379e9d8.js","9211","static/chunks/9211-c08bacb1ba75336f.js","9791","static/chunks/app/submission/%5Bid%5D/page-abe92e013e824763.js"],"TestCaseDisplay"] 1b:T517,#include #include #define INF 100000 using namespace std; int main() { int Size; cin >> Size; int NodeSize, LinkSize, WormSize; int Input[2]; for (int Case = 0; Case < Size; ++Case) { cin >> NodeSize >> LinkSize >> WormSize; vector> Floid(NodeSize, vector(NodeSize, INF)); for (int i = 0; i < NodeSize; ++i) { Floid[i][i] = 0; } for (int i = 0; i < LinkSize; ++i) { cin >> Input[0] >> Input[1]; cin >> Floid[Input[0] - 1][Input[1] - 1]; } for (int i = 0; i < WormSize; ++i) { cin >> Input[0] >> Input[1]; cin >> Floid[Input[0] - 1][Input[1] - 1]; Floid[Input[0] - 1][Input[1] - 1] *= -1; } for (int Mid = 0; Mid < NodeSize; ++Mid) { for (int Start = 0; Start < NodeSize; ++Start) { for (int End = 0; End < NodeSize; ++End) { if (INF == Floid[Start][Mid] || INF == Floid[Mid][End]) continue; Floid[Start][End] = min(Floid[Start][Mid] + Floid[Mid]

제출 #93282

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: