# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1172484 | Hanksburger | Olympic Bus (JOI20_ho_t4) | C++20 | 1096 ms | 10824 KiB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
vector<pair<int, pair<int, int> > > adj[205], rev[205];
int dist[205][205], d[205], final[205];
map<pair<int, int>, int> ans1, ans2;
set<pair<int, int> > edges1, edges2;
pair<int, int> pre[205][205];
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
for (int i=1; i<=m; i++)
{
int u, v, c, d;
cin >> u >> v >> c >> d;
adj[u].push_back({v, {c, d}});
rev[v].push_back({u, {c, d}});
}
for (int i=1; i<=n; i++)
dist[1][i]=1e18;
dist[1][1]=0;
for (int i=1; i<=n; i++)
{
int u, mn=1e18+1;
for (int j=1; j<=n; j++)
{
# | 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... |