# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
601361 | narvalo | Ferries (NOI13_ferries) | C++17 | 147 ms | 30164 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 <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = (int)1e18;
int ferries(int n , int m , vector<int> a , vector<int> b , vector<int> c) {
vector<vector<pair<int , int>>> adj(n);
for (int i = 0 ; i < m ; i++) {
a[i] -= 1 , b[i] -= 1;
adj[a[i]].emplace_back(b[i] , c[i]);
}
vector<int> dp(n , -1) , vis(n);
function<long long(int)> Solve = [&](int node) -> long long {
if (node == n - 1) {
return 0;
}
if (vis[node] == 1) {
return -1;
}
if (dp[node] != -1) {
return dp[node];
}
vis[node] = 1;
vector<int> d , s;
for (auto x : adj[node]) {
int g = Solve(x.first);
if (g != -1) {
# | 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... |