# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
255721 | karma | Evacuation plan (IZhO18_plan) | C++14 | 658 ms | 110108 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>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
//#define int int64_t
using namespace std;
const int N = int(5e5) + 7;
const int inf = 1e9 + 1;
typedef pair<ll, ll> pii;
int n, m, k, d[N], q, u, v, w;
vector<pii> adj[N];
struct TEdges {
int u, v, w;
TEdges() {u = v = w = 0;}
TEdges(int u, int v, int w): u(u), v(v), w(w) {}
bool operator < (const TEdges& x)const& {
return w > x.w;
}
};
vector<TEdges> edges;
priority_queue<pii, vector<pii>, greater<pii>> pq;
int lab[N];
int find(int x) {return lab[x] < 0? x: lab[x] = find(lab[x]);}
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... |