# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
729024 | MilosMilutinovic | Passport (JOI23_passport) | C++14 | 1413 ms | 90756 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;
const int inf=0x3f3f3f3f;
int n,q,l[800005],r[800005],dl[800005],dr[800005],dis[800005],idx[200005];
vector<int> g[800005];
void bfs(int* d)
{
set<pair<int,int>> st;
for(int i=1;i<=n;i++) st.emplace(d[i],i);
while(!st.empty())
{
auto it=st.begin();
int x=it->second;
st.erase(it);
if(x<=n)
{
for(int y=idx[x];y>=1;y/=2)
{
if(d[n+y]>d[x])
{
if(st.find({d[n+y],n+y})!=st.end()) st.erase(st.find({d[n+y],n+y}));
d[n+y]=d[x];st.emplace(d[n+y],n+y);
}
}
}
else
{
for(int y:g[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... |