Submission #2095114
Source Code Expand
#include<bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++) #define all(c) begin(c),end(c) const ll INF = ll(1e16); const ll mod = ll(1e9 + 7); const int MAX_E = 2000; const int MAX_V = 1000; struct edge { int from, to; ll cost; }; edge es[MAX_E]; ll d[MAX_V]; int V, E; //s番目の頂点から各頂点への最短距離 void bellman_ford(int s) { d[s] = 0; int cnt = 0; while (cnt<V) { bool update = false; for (int i = 0; i < E; i++) { edge e = es[i]; if (d[e.from] != INF&&d[e.to] > d[e.from] + e.cost) { d[e.to] = d[e.from] + e.cost; update = true; } } cnt++; if (!update)break; } } int main() { cin >> V >> E; rep(i, E) { int a, b, c; cin>>a>>b>>c; es[i].from = --a; es[i].to = --b; es[i].cost = -c; } for (int i = 0; i < V; i++)d[i] = INF; bellman_ford(0); ll mem = -d[V - 1]; bellman_ford(0); if (mem < -d[V - 1])cout << "inf" << endl; else cout << -d[V - 1] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Score Attack |
User | agis |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1134 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_2.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_1.txt | AC | 2 ms | 256 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 2 ms | 256 KB |
subtask_1_12.txt | AC | 7 ms | 256 KB |
subtask_1_13.txt | AC | 1 ms | 256 KB |
subtask_1_14.txt | AC | 7 ms | 256 KB |
subtask_1_15.txt | AC | 10 ms | 256 KB |
subtask_1_16.txt | AC | 1 ms | 256 KB |
subtask_1_17.txt | AC | 1 ms | 256 KB |
subtask_1_18.txt | AC | 2 ms | 256 KB |
subtask_1_19.txt | AC | 3 ms | 256 KB |
subtask_1_2.txt | AC | 2 ms | 256 KB |
subtask_1_20.txt | AC | 1 ms | 256 KB |
subtask_1_21.txt | AC | 2 ms | 256 KB |
subtask_1_22.txt | AC | 3 ms | 256 KB |
subtask_1_23.txt | AC | 1 ms | 256 KB |
subtask_1_24.txt | AC | 3 ms | 256 KB |
subtask_1_25.txt | AC | 4 ms | 256 KB |
subtask_1_26.txt | AC | 2 ms | 256 KB |
subtask_1_27.txt | AC | 7 ms | 256 KB |
subtask_1_3.txt | AC | 2 ms | 256 KB |
subtask_1_4.txt | AC | 2 ms | 256 KB |
subtask_1_5.txt | AC | 3 ms | 256 KB |
subtask_1_6.txt | AC | 7 ms | 256 KB |
subtask_1_7.txt | AC | 2 ms | 256 KB |
subtask_1_8.txt | AC | 2 ms | 256 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |