# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167158 | Lightning | Evacuation plan (IZhO18_plan) | C++17 | 4046 ms | 21880 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 <algorithm>
#include <vector>
#include <set>
using namespace std;
typedef pair <int, int> pii;
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define mkp make_pair
#define F first
#define S second
const int N = 1e5 + 5;
const int INF = 1e9 + 5;
int n, m, k, q;
vector <pii> g[N];
vector <int> new_gr[N];
set <pii> st;
int dist[N], up[N][18], pr[N], tin[N], tout[N], tiktak;
bool was[N];
void dijkstra() {
while(sz(st)) {
int v = st.begin() -> S;
st.erase(st.begin());
for(pii it : g[v]) {
int w = it.F;
int to = it.S;
if(dist[to] > dist[v] + w) {
st.erase(mkp(dist[to], to));
dist[to] = dist[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... |