# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
736118 | nguyentunglam | Passport (JOI23_passport) | C++17 | 862 ms | 85324 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 fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
const int N = 8e5 + 10;
int f[N], g[N], h[N], p[N];
bool mark[N];
vector<ii> adj[N];
priority_queue<ii, vector<ii>, greater<ii> > q;
void calc(int start, int d[]) {
d[start] = 0;
q.push({0, start});
while (!q.empty()) {
int cost, u; tie(cost, u) = q.top(); q.pop();
if (d[u] != cost) continue;
for(auto &[v, w] : adj[u]) if (d[v] > d[u] + w) d[v] = d[u] + w, q.push({d[v], v});
}
}
void init(int s, int l, int r) {
if (l == r) {
mark[s] = 1;
p[l] = s;
return;
}
adj[s << 1].emplace_back(s, 0);
adj[s << 1 | 1].emplace_back(s, 0);
int mid = l + r >> 1;
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... |