# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
556293 | Hanksburger | Evacuation plan (IZhO18_plan) | C++17 | 618 ms | 57144 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;
int dist[100005], par[100005], ans[100005];
vector<pair<int, int> > adj[100005];
priority_queue<pair<int, int> > pq;
vector<pair<int, int> > edge;
set<int> s[100005];
bool cmp(pair<int, int> x, pair<int, int> y)
{
return (min(dist[x.first], dist[x.second])>min(dist[y.first], dist[y.second]));
}
int findPar(int u)
{
if (par[u]==u)
return u;
par[u]=findPar(par[u]);
return par[u];
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, m, p, q;
cin >> n >> m;
for (int i=1; i<=m; i++)
{
int u, v, w;
cin >> u >> v >> w;
adj[u].push_back({v, w});
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |