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:T70b,#include #include #include #include #include using namespace std; #define INF numeric_limits::max() typedef pair pii; int N, E, v1, v2; vector> graph; vector d; void input(); void dijkstra(int start); int main(){ ios::sync_with_stdio(0); cin.tie(NULL); input(); bool v1_v2_avlbl = true, v2_v1_avlbl = true; int v1_v2 = 0, v2_v1 = 0; dijkstra(1); if(d[v1] == INF) v1_v2_avlbl = false; if(d[v2] == INF) v2_v1_avlbl = false; v1_v2 += d[v1]; v2_v1 += d[v2]; dijkstra(v1); if(d[v2] == INF){ v1_v2_avlbl = false; v2_v1_avlbl = false; } v1_v2 += d[v2]; v2_v1 += d[v2] + d[N]; dijkstra(v2); if(d[N] == INF) v2_v1_avlbl = false; v1_v2 += d[N]; if(!v1_v2_avlbl && !v2_v1_avlbl) cout << -1 << '\n'; else if(!v1_v2_avlbl) cout << v2_v1 << '\n'; else if(!v2_v1_avlbl) cout << v1_v2 << '\n';

제출 #114136

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: