# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
749905 | Cyber_Wolf | Passport (JOI23_passport) | C++17 | 1068 ms | 159308 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>
#pragma GCC optimize("Ofast")
using namespace std;
#define lg long long
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const lg N = 1e6+5;
vector<array<lg, 2>> adj[N];
lg dis[2][N], dist[N], id, n, in_queue[N];
void propagate(lg node, lg lr, lg hr, lg idx, lg lq, lg hq)
{
if(lq > hr || lr > hq) return;
if(lq <= lr && hr <= hq)
{
adj[node].push_back({idx, 0});
return;
}
lg mid = (lr+hr)/2;
propagate(node << 1, lr, mid, idx, lq, hq);
propagate(node << 1 | 1, mid+1, hr, idx, lq, hq);
return;
}
void dijkstra(lg t, lg src)
{
memset(dis[t], 0x3f, sizeof(dis[t]));
# | 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... |