Submission #1777277
Source Code Expand
#include <iostream> #include <vector> using namespace std; typedef long long ll; const ll INF = (1LL << 50) * -1; struct edge { int from, to, cost; }; int main(void) { int n, m; cin >> n >> m; vector<edge> graph(m); vector<ll> distance(n, INF); distance[0] = 0; for (int i = 0; i < m; i++) { cin >> graph[i].from; cin >> graph[i].to; graph[i].from--; graph[i].to--; cin >> graph[i].cost; } vector<bool> initial(n, 1); for (int loop = 0; loop < n - 1; loop++) { for (int i = 0; i < m; i++) { if (distance[graph[i].from] == INF) continue; if (distance[graph[i].to] < distance[graph[i].from] + graph[i].cost) { distance[graph[i].to] = distance[graph[i].from] + graph[i].cost; } } } vector<bool> update(0, n); for (int loop = 0; loop < n - 1; loop++) { for (int i = 0; i < m; i++) { if (distance[graph[i].from] == INF) continue; if (distance[graph[i].to] < distance[graph[i].from] + graph[i].cost) { distance[graph[i].to] = distance[graph[i].from] + graph[i].cost; if (graph[i].to == n - 1) { cout << "inf" << endl; return 0; } } } } cout << distance[n - 1] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Score Attack |
User | comethelp |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1275 Byte |
Status | AC |
Exec Time | 13 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 | 4 ms | 256 KB |
subtask_1_13.txt | AC | 1 ms | 256 KB |
subtask_1_14.txt | AC | 4 ms | 256 KB |
subtask_1_15.txt | AC | 6 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 | 6 ms | 256 KB |
subtask_1_19.txt | AC | 5 ms | 256 KB |
subtask_1_2.txt | AC | 4 ms | 256 KB |
subtask_1_20.txt | AC | 1 ms | 256 KB |
subtask_1_21.txt | AC | 4 ms | 256 KB |
subtask_1_22.txt | AC | 13 ms | 256 KB |
subtask_1_23.txt | AC | 1 ms | 256 KB |
subtask_1_24.txt | AC | 5 ms | 256 KB |
subtask_1_25.txt | AC | 3 ms | 256 KB |
subtask_1_26.txt | AC | 4 ms | 256 KB |
subtask_1_27.txt | AC | 6 ms | 256 KB |
subtask_1_3.txt | AC | 3 ms | 256 KB |
subtask_1_4.txt | AC | 4 ms | 256 KB |
subtask_1_5.txt | AC | 2 ms | 256 KB |
subtask_1_6.txt | AC | 4 ms | 256 KB |
subtask_1_7.txt | AC | 4 ms | 256 KB |
subtask_1_8.txt | AC | 4 ms | 256 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |