# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38108 | nibnalin | Ferries (NOI13_ferries) | C++14 | 766 ms | 26996 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
using namespace std;
const int maxn = int(1e5)+5, inf = int(2e9)+5;
int D[maxn];
multiset<int> into[maxn];
vector<int> graph[maxn];
int main(void)
{
int n, m, a, b, c;
scanf("%d%d", &n, &m);
for(int i = 0;i < n;i++) D[i] = inf;
for(int i = 0;i < m;i++)
{
scanf("%d%d%d", &a, &b, &c);
a--, b--;
graph[b].push_back(a);
into[a].insert(c);
}
set<pair<int, int>> Q;
D[n-1] = 0;
Q.insert({D[n-1], n-1});
while(!Q.empty())
{
pair<int, int> top = *Q.begin();
Q.erase(Q.begin());
if(D[top.second] < top.first) continue;
//cout << top.first << " " << top.second << "\n";
for(auto it: graph[top.second])
{
//if(into[it].empty()) continue;
int w = *into[it].rbegin();
into[it].erase(into[it].find(w));
if(D[it] > D[top.second]+w)
{
D[it] = D[top.second]+w;
if(D[it] != inf) Q.erase({D[it], it});
Q.insert({D[it], it});
}
}
}
printf("%d\n", D[0]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |