oj.uz

Submission #729023

# Submission time Handle Problem Language Result Execution time Memory
729023 2023-04-23T11:57:32 Z MilosMilutinovic Passport (JOI23_passport) C++14
48 / 100
 59 ms 38420 KB 
#include <bits/stdc++.h>
using namespace std;

const int inf=0x3f3f3f3f;
int n,q,l[700005],r[700005],dl[700005],dr[700005],dis[700005],idx[200005];
vector<int> g[700005];

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])
            {
                int f=d[x]+(y<=n);
                if(d[y]>f)
                {
                    if(st.find({d[y],y})!=st.end()) st.erase(st.find({d[y],y}));
                    d[y]=f;st.emplace(f,y);
                }
            }
        }
    }
}

void build(int v,int l,int r)
{
    if(l==r) {idx[l]=v;return;}
    int mid=l+r>>1;
    build(v*2,l,mid);
    build(v*2+1,mid+1,r);
}
void add(int v,int l,int r,int ql,int qr,int i)
{
    if(l>r||l>qr||r<ql) return;
    if(ql<=l&&r<=qr)
    {
        g[i].push_back(n+v);
        g[n+v].push_back(i);
        return;
    }
    int mid=l+r>>1;
    add(v*2,l,mid,ql,qr,i);
    add(v*2+1,mid+1,r,ql,qr,i);
}

signed main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d%d",&l[i],&r[i]);
    build(1,1,n);
    for(int i=1;i<=n;i++) add(1,1,n,l[i],r[i],i);
    for(int i=1;i<=700000;i++) dl[i]=dr[i]=dis[i]=inf;
    dl[1]=0;dr[n]=0;
    bfs(dl);bfs(dr);
    dl[1]=1;dr[n]=1;
    for(int i=1;i<=n;i++) dis[i]=dl[i]+dr[i];
    bfs(dis);
    for(int i=1;i<=n;i++) if(dis[i]>=inf) dis[i]=-1; else dis[i]--;
    scanf("%d",&q);
    while(q--)
    {
        int x;scanf("%d",&x);
        printf("%d\n",dis[x]);
    }
}

Compilation message

passport.cpp: In function 'void build(int, int, int)':
passport.cpp:46:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   46 |     int mid=l+r>>1;
      |             ~^~
passport.cpp: In function 'void add(int, int, int, int, int, int)':
passport.cpp:59:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   59 |     int mid=l+r>>1;
      |             ~^~
passport.cpp: In function 'int main()':
passport.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
passport.cpp:67:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     for(int i=1;i<=n;i++) scanf("%d%d",&l[i],&r[i]);
      |                           ~~~~~^~~~~~~~~~~~~~~~~~~~
passport.cpp:77:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |     scanf("%d",&q);
      |     ~~~~~^~~~~~~~~
passport.cpp:80:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |         int x;scanf("%d",&x);
      |               ~~~~~^~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 24916 KB Output is correct
2 Correct 12 ms 24856 KB Output is correct
3 Correct 12 ms 24916 KB Output is correct
4 Runtime error 59 ms 38420 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 24932 KB Output is correct
2 Correct 13 ms 24972 KB Output is correct
3 Correct 14 ms 24916 KB Output is correct
4 Correct 14 ms 24932 KB Output is correct
5 Correct 12 ms 24900 KB Output is correct
6 Correct 14 ms 24916 KB Output is correct
7 Correct 11 ms 24980 KB Output is correct
8 Correct 14 ms 24908 KB Output is correct
9 Correct 12 ms 24956 KB Output is correct
10 Correct 14 ms 24916 KB Output is correct
11 Correct 14 ms 24916 KB Output is correct
12 Correct 12 ms 25020 KB Output is correct
13 Correct 12 ms 24912 KB Output is correct
14 Correct 12 ms 24916 KB Output is correct
15 Correct 12 ms 24928 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 24932 KB Output is correct
2 Correct 13 ms 24972 KB Output is correct
3 Correct 14 ms 24916 KB Output is correct
4 Correct 14 ms 24932 KB Output is correct
5 Correct 12 ms 24900 KB Output is correct
6 Correct 14 ms 24916 KB Output is correct
7 Correct 11 ms 24980 KB Output is correct
8 Correct 14 ms 24908 KB Output is correct
9 Correct 12 ms 24956 KB Output is correct
10 Correct 14 ms 24916 KB Output is correct
11 Correct 14 ms 24916 KB Output is correct
12 Correct 12 ms 25020 KB Output is correct
13 Correct 12 ms 24912 KB Output is correct
14 Correct 12 ms 24916 KB Output is correct
15 Correct 12 ms 24928 KB Output is correct
16 Correct 19 ms 25428 KB Output is correct
17 Correct 21 ms 25300 KB Output is correct
18 Correct 20 ms 25468 KB Output is correct
19 Correct 19 ms 25512 KB Output is correct
20 Correct 17 ms 25428 KB Output is correct
21 Correct 16 ms 25260 KB Output is correct
22 Correct 15 ms 25168 KB Output is correct
23 Correct 19 ms 25428 KB Output is correct
24 Correct 16 ms 25428 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 24932 KB Output is correct
2 Correct 13 ms 24972 KB Output is correct
3 Correct 14 ms 24916 KB Output is correct
4 Correct 14 ms 24932 KB Output is correct
5 Correct 12 ms 24900 KB Output is correct
6 Correct 14 ms 24916 KB Output is correct
7 Correct 11 ms 24980 KB Output is correct
8 Correct 14 ms 24908 KB Output is correct
9 Correct 12 ms 24956 KB Output is correct
10 Correct 14 ms 24916 KB Output is correct
11 Correct 14 ms 24916 KB Output is correct
12 Correct 12 ms 25020 KB Output is correct
13 Correct 12 ms 24912 KB Output is correct
14 Correct 12 ms 24916 KB Output is correct
15 Correct 12 ms 24928 KB Output is correct
16 Correct 19 ms 25428 KB Output is correct
17 Correct 21 ms 25300 KB Output is correct
18 Correct 20 ms 25468 KB Output is correct
19 Correct 19 ms 25512 KB Output is correct
20 Correct 17 ms 25428 KB Output is correct
21 Correct 16 ms 25260 KB Output is correct
22 Correct 15 ms 25168 KB Output is correct
23 Correct 19 ms 25428 KB Output is correct
24 Correct 16 ms 25428 KB Output is correct
25 Correct 12 ms 24916 KB Output is correct
26 Correct 15 ms 24916 KB Output is correct
27 Correct 20 ms 25428 KB Output is correct
28 Correct 18 ms 25248 KB Output is correct
29 Correct 16 ms 25428 KB Output is correct
30 Correct 18 ms 25308 KB Output is correct
31 Correct 17 ms 25412 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 24916 KB Output is correct
2 Correct 12 ms 24856 KB Output is correct
3 Correct 12 ms 24916 KB Output is correct
4 Runtime error 59 ms 38420 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -