oj.uz

Submission #729022

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

const int inf=0x3f3f3f3f;
int n,q,l[200005],r[200005],dl[800005],dr[800005],dis[800005],idx[200005];
vector<int> g[800005],gup[800005],gdown[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])
            {
                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;
    gup[n+2*v].push_back(n+v);
    gup[n+2*v+1].push_back(n+v);
    gdown[n+v].push_back(n+2*v);
    gdown[n+v].push_back(n+2*v+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);
        gup[i].push_back(n+v);
        gup[n+v].push_back(i);
        gdown[i].push_back(n+v);
        gdown[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:67:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   67 |     int mid=l+r>>1;
      |             ~^~
passport.cpp: In function 'int main()':
passport.cpp:74:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
passport.cpp:75:32: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |     for(int i=1;i<=n;i++) scanf("%d%d",&l[i],&r[i]);
      |                           ~~~~~^~~~~~~~~~~~~~~~~~~~
passport.cpp:85:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |     scanf("%d",&q);
      |     ~~~~~^~~~~~~~~
passport.cpp:88:20: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |         int x;scanf("%d",&x);
      |               ~~~~~^~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 64844 KB Output is correct
2 Correct 30 ms 64820 KB Output is correct
3 Correct 36 ms 64840 KB Output is correct
4 Execution timed out 2089 ms 204836 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 64788 KB Output is correct
2 Correct 29 ms 64864 KB Output is correct
3 Correct 30 ms 64844 KB Output is correct
4 Correct 30 ms 64852 KB Output is correct
5 Correct 30 ms 64884 KB Output is correct
6 Correct 30 ms 64880 KB Output is correct
7 Correct 32 ms 64888 KB Output is correct
8 Correct 29 ms 64852 KB Output is correct
9 Correct 34 ms 64856 KB Output is correct
10 Correct 30 ms 64908 KB Output is correct
11 Correct 37 ms 65004 KB Output is correct
12 Correct 32 ms 64972 KB Output is correct
13 Correct 32 ms 65028 KB Output is correct
14 Correct 31 ms 65024 KB Output is correct
15 Correct 37 ms 64992 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 64788 KB Output is correct
2 Correct 29 ms 64864 KB Output is correct
3 Correct 30 ms 64844 KB Output is correct
4 Correct 30 ms 64852 KB Output is correct
5 Correct 30 ms 64884 KB Output is correct
6 Correct 30 ms 64880 KB Output is correct
7 Correct 32 ms 64888 KB Output is correct
8 Correct 29 ms 64852 KB Output is correct
9 Correct 34 ms 64856 KB Output is correct
10 Correct 30 ms 64908 KB Output is correct
11 Correct 37 ms 65004 KB Output is correct
12 Correct 32 ms 64972 KB Output is correct
13 Correct 32 ms 65028 KB Output is correct
14 Correct 31 ms 65024 KB Output is correct
15 Correct 37 ms 64992 KB Output is correct
16 Correct 44 ms 66092 KB Output is correct
17 Correct 45 ms 65664 KB Output is correct
18 Correct 46 ms 66292 KB Output is correct
19 Correct 49 ms 66324 KB Output is correct
20 Correct 43 ms 65736 KB Output is correct
21 Correct 43 ms 65732 KB Output is correct
22 Correct 37 ms 65528 KB Output is correct
23 Correct 43 ms 65876 KB Output is correct
24 Correct 43 ms 65996 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 64788 KB Output is correct
2 Correct 29 ms 64864 KB Output is correct
3 Correct 30 ms 64844 KB Output is correct
4 Correct 30 ms 64852 KB Output is correct
5 Correct 30 ms 64884 KB Output is correct
6 Correct 30 ms 64880 KB Output is correct
7 Correct 32 ms 64888 KB Output is correct
8 Correct 29 ms 64852 KB Output is correct
9 Correct 34 ms 64856 KB Output is correct
10 Correct 30 ms 64908 KB Output is correct
11 Correct 37 ms 65004 KB Output is correct
12 Correct 32 ms 64972 KB Output is correct
13 Correct 32 ms 65028 KB Output is correct
14 Correct 31 ms 65024 KB Output is correct
15 Correct 37 ms 64992 KB Output is correct
16 Correct 44 ms 66092 KB Output is correct
17 Correct 45 ms 65664 KB Output is correct
18 Correct 46 ms 66292 KB Output is correct
19 Correct 49 ms 66324 KB Output is correct
20 Correct 43 ms 65736 KB Output is correct
21 Correct 43 ms 65732 KB Output is correct
22 Correct 37 ms 65528 KB Output is correct
23 Correct 43 ms 65876 KB Output is correct
24 Correct 43 ms 65996 KB Output is correct
25 Correct 34 ms 64916 KB Output is correct
26 Correct 35 ms 64852 KB Output is correct
27 Correct 51 ms 66132 KB Output is correct
28 Correct 43 ms 65748 KB Output is correct
29 Correct 39 ms 65836 KB Output is correct
30 Correct 47 ms 65808 KB Output is correct
31 Correct 44 ms 65864 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 64844 KB Output is correct
2 Correct 30 ms 64820 KB Output is correct
3 Correct 36 ms 64840 KB Output is correct
4 Execution timed out 2089 ms 204836 KB Time limit exceeded
5 Halted 0 ms 0 KB -