oj.uz

Submission #949735

# Submission time Handle Problem Language Result Execution time Memory
949735 2024-03-19T15:31:31 Z andrei_boaca Tourism (JOI23_tourism) C++17
28 / 100
 5000 ms 56656 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<int,int> pii;
int bucksize=200;
int n,m,q,c[100005],niv[100005],in[100005],out[100005],lin[500005],rmq[21][500005],loga[500005],timp,par[100005];
int sol[100005],nivmin,cnt;
set<pii> s;
vector<int> muchii[100005];
void dfs(int nod)
{
    timp++;
    lin[timp]=nod;
    in[nod]=timp;
    bool have=0;
    for(int i:muchii[nod])
        if(i!=par[nod])
        {
            par[i]=nod;
            niv[i]=niv[nod]+1;
            dfs(i);
            timp++;
            lin[timp]=nod;
            have=1;
        }
    if(!have)
    {
        timp++;
        lin[timp]=nod;
    }
    out[nod]=timp;
}
struct date
{
    int l,r,ind;
};
int getbuck(int x)
{
    return x/bucksize+(x%bucksize!=0);
}
bool byr(date a, date b)
{
    return a.r<b.r;
}
vector<date> qr[100005];
bool isancestor(int a,int b)
{
    return in[a]<=in[b]&&out[a]>=out[b];
}
int getmin(int l,int r)
{
    int lg=loga[r-l+1];
    int a=rmq[lg][r-(1<<lg)+1];
    int b=rmq[lg][l];
    if(niv[a]<niv[b])
        return a;
    return b;
}
int LCA(int a,int b)
{
    if(in[a]>in[b])
        swap(a,b);
    if(isancestor(a,b))
        return a;
    int l=out[a];
    int r=in[b];
    return getmin(l,r);
}
void addnode(int nod)
{
    if(s.find({in[nod],nod})!=s.end())
        return;
    s.insert({in[nod],nod});
    if(s.size()==1)
    {
        nivmin=niv[nod];
        cnt=nivmin+1;
        return;
    }
    int nmin=1e9;
    int nmax=0;
    auto it=s.find({in[nod],nod});
    bool have=0;
    if(it!=s.begin())
    {
        int st=(*prev(it)).second;
        int x=LCA(st,nod);
        nmin=min(nmin,niv[x]);
        nmax=max(nmax,niv[x]);
    }
    it++;
    if(it!=s.end())
    {
        int dr=(*it).second;
        if(isancestor(nod,dr))
            have=1;
        int x=LCA(nod,dr);
        nmin=min(nmin,niv[x]);
        nmax=max(nmax,niv[x]);
    }
    if(nivmin>nmin)
    {
        if(!have)
            cnt+=niv[nod]-nmin;
        nivmin=min(nivmin,nmin);
    }
    else
    {
        if(!have)
            cnt+=niv[nod]-nmax;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>m>>q;
    for(int i=1;i<n;i++)
    {
        int a,b;
        cin>>a>>b;
        muchii[a].push_back(b);
        muchii[b].push_back(a);
    }
    for(int i=1;i<=m;i++)
        cin>>c[i];
    dfs(1);
    for(int i=1;i<=timp;i++)
    {
        for(int bit=0;bit<=20;bit++)
            if((1<<bit)<=i)
                loga[i]=bit;
    }
    for(int i=1;i<=timp;i++)
        rmq[0][i]=lin[i];
    for(int j=1;j<=18;j++)
        for(int i=1;i<=timp;i++)
        {
            rmq[j][i]=rmq[j-1][i];
            int poz=i+(1<<(j-1));
            if(poz<=timp&&niv[rmq[j-1][poz]]<niv[rmq[j][i]])
                rmq[j][i]=rmq[j-1][poz];
        }
    int bmax=0;
    for(int i=1;i<=q;i++)
    {
        int l,r;
        cin>>l>>r;
        int b=getbuck(l);
        bmax=max(bmax,b);
        qr[b].push_back({l,r,i});
    }
    for(int b=1;b<=bmax;b++)
        if(!qr[b].empty())
        {
            sort(qr[b].begin(),qr[b].end(),byr);
            reverse(qr[b].begin(),qr[b].end());
            while(!qr[b].empty()&&getbuck(qr[b].back().r)==b)
            {
                int l=qr[b].back().l;
                int r=qr[b].back().r;
                int ind=qr[b].back().ind;
                qr[b].pop_back();
                s.clear();
                nivmin=niv[c[l]];
                cnt=nivmin+1;
                s.insert({in[c[l]],c[l]});
                for(int i=l+1;i<=r;i++)
                {
                    int nod=c[i];
                    addnode(nod);
                }
                sol[ind]=cnt-nivmin;
            }
            s.clear();
            int poz=b*bucksize;
            cnt=0;
            nivmin=0;
            while(!qr[b].empty())
            {
                int l=qr[b].back().l;
                int r=qr[b].back().r;
                int ind=qr[b].back().ind;
                qr[b].pop_back();
                while(poz<r)
                {
                    poz++;
                    int nod=c[poz];
                    addnode(nod);
                }
                int last=b*bucksize;
                int auxniv=nivmin;
                int auxcnt=cnt;
                vector<pii> toerase;
                for(int i=l;i<=last;i++)
                {
                    int nod=c[i];
                    if(s.find({in[nod],nod})!=s.end())
                        continue;
                    toerase.push_back({in[nod],nod});
                    addnode(nod);
                }
                sol[ind]=cnt-nivmin;
                for(pii p:toerase)
                    s.erase(p);
                nivmin=auxniv;
                cnt=auxcnt;
            }
        }
    for(int i=1;i<=q;i++)
        cout<<sol[i]<<'\n';
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 47708 KB Output is correct
2 Correct 6 ms 47708 KB Output is correct
3 Correct 6 ms 47708 KB Output is correct
4 Correct 8 ms 47708 KB Output is correct
5 Correct 8 ms 47708 KB Output is correct
6 Correct 8 ms 47708 KB Output is correct
7 Correct 8 ms 47704 KB Output is correct
8 Correct 8 ms 47708 KB Output is correct
9 Correct 10 ms 47860 KB Output is correct
10 Correct 10 ms 47708 KB Output is correct
11 Correct 10 ms 47708 KB Output is correct
12 Correct 12 ms 47708 KB Output is correct
13 Correct 11 ms 47708 KB Output is correct
14 Correct 11 ms 47708 KB Output is correct
15 Correct 10 ms 47836 KB Output is correct
16 Correct 10 ms 47708 KB Output is correct
17 Correct 10 ms 47708 KB Output is correct
18 Correct 10 ms 47872 KB Output is correct
19 Correct 10 ms 47844 KB Output is correct
20 Correct 10 ms 47960 KB Output is correct
21 Correct 10 ms 47704 KB Output is correct
22 Correct 10 ms 47708 KB Output is correct
23 Correct 10 ms 47708 KB Output is correct
24 Correct 10 ms 47712 KB Output is correct
25 Correct 11 ms 47788 KB Output is correct
26 Correct 10 ms 47708 KB Output is correct
27 Correct 6 ms 47708 KB Output is correct
28 Correct 6 ms 47708 KB Output is correct
29 Correct 7 ms 47708 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 47708 KB Output is correct
2 Correct 6 ms 47708 KB Output is correct
3 Correct 6 ms 47708 KB Output is correct
4 Correct 8 ms 47708 KB Output is correct
5 Correct 8 ms 47708 KB Output is correct
6 Correct 8 ms 47708 KB Output is correct
7 Correct 8 ms 47704 KB Output is correct
8 Correct 8 ms 47708 KB Output is correct
9 Correct 10 ms 47860 KB Output is correct
10 Correct 10 ms 47708 KB Output is correct
11 Correct 10 ms 47708 KB Output is correct
12 Correct 12 ms 47708 KB Output is correct
13 Correct 11 ms 47708 KB Output is correct
14 Correct 11 ms 47708 KB Output is correct
15 Correct 10 ms 47836 KB Output is correct
16 Correct 10 ms 47708 KB Output is correct
17 Correct 10 ms 47708 KB Output is correct
18 Correct 10 ms 47872 KB Output is correct
19 Correct 10 ms 47844 KB Output is correct
20 Correct 10 ms 47960 KB Output is correct
21 Correct 10 ms 47704 KB Output is correct
22 Correct 10 ms 47708 KB Output is correct
23 Correct 10 ms 47708 KB Output is correct
24 Correct 10 ms 47712 KB Output is correct
25 Correct 11 ms 47788 KB Output is correct
26 Correct 10 ms 47708 KB Output is correct
27 Correct 6 ms 47708 KB Output is correct
28 Correct 6 ms 47708 KB Output is correct
29 Correct 7 ms 47708 KB Output is correct
30 Correct 34 ms 47708 KB Output is correct
31 Correct 39 ms 47708 KB Output is correct
32 Correct 47 ms 47960 KB Output is correct
33 Correct 47 ms 47960 KB Output is correct
34 Correct 46 ms 48248 KB Output is correct
35 Correct 33 ms 48212 KB Output is correct
36 Correct 33 ms 47964 KB Output is correct
37 Correct 36 ms 47964 KB Output is correct
38 Correct 44 ms 47964 KB Output is correct
39 Correct 45 ms 47964 KB Output is correct
40 Correct 45 ms 47964 KB Output is correct
41 Correct 35 ms 47964 KB Output is correct
42 Correct 36 ms 47964 KB Output is correct
43 Correct 33 ms 47964 KB Output is correct
44 Correct 45 ms 47964 KB Output is correct
45 Correct 45 ms 48008 KB Output is correct
46 Correct 46 ms 47960 KB Output is correct
47 Correct 36 ms 47960 KB Output is correct
48 Correct 35 ms 47964 KB Output is correct
49 Correct 38 ms 47964 KB Output is correct
50 Correct 46 ms 47964 KB Output is correct
51 Correct 45 ms 47976 KB Output is correct
52 Correct 44 ms 47960 KB Output is correct
53 Correct 54 ms 47960 KB Output is correct
54 Correct 45 ms 47964 KB Output is correct
55 Correct 47 ms 48208 KB Output is correct
56 Correct 7 ms 47704 KB Output is correct
57 Correct 7 ms 47708 KB Output is correct
58 Correct 7 ms 47964 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47708 KB Output is correct
2 Correct 6 ms 47704 KB Output is correct
3 Correct 8 ms 47708 KB Output is correct
4 Execution timed out 5078 ms 56600 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 47708 KB Output is correct
2 Correct 41 ms 49756 KB Output is correct
3 Correct 49 ms 50004 KB Output is correct
4 Correct 48 ms 52304 KB Output is correct
5 Correct 88 ms 56400 KB Output is correct
6 Correct 104 ms 54888 KB Output is correct
7 Correct 88 ms 53908 KB Output is correct
8 Correct 83 ms 53844 KB Output is correct
9 Correct 80 ms 53588 KB Output is correct
10 Correct 81 ms 53588 KB Output is correct
11 Correct 80 ms 53584 KB Output is correct
12 Correct 82 ms 53568 KB Output is correct
13 Correct 67 ms 53844 KB Output is correct
14 Correct 88 ms 54116 KB Output is correct
15 Correct 73 ms 55344 KB Output is correct
16 Correct 79 ms 55636 KB Output is correct
17 Correct 82 ms 55380 KB Output is correct
18 Correct 82 ms 55416 KB Output is correct
19 Correct 79 ms 56656 KB Output is correct
20 Correct 80 ms 55412 KB Output is correct
21 Correct 80 ms 54536 KB Output is correct
22 Correct 77 ms 54140 KB Output is correct
23 Correct 78 ms 53924 KB Output is correct
24 Correct 89 ms 53728 KB Output is correct
25 Correct 74 ms 53532 KB Output is correct
26 Correct 76 ms 53948 KB Output is correct
27 Correct 72 ms 53656 KB Output is correct
28 Correct 71 ms 53592 KB Output is correct
29 Correct 65 ms 53584 KB Output is correct
30 Correct 60 ms 53716 KB Output is correct
31 Correct 59 ms 53932 KB Output is correct
32 Correct 60 ms 54116 KB Output is correct
33 Correct 62 ms 54364 KB Output is correct
34 Correct 65 ms 55272 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 47708 KB Output is correct
2 Correct 6 ms 47708 KB Output is correct
3 Correct 7 ms 47708 KB Output is correct
4 Execution timed out 5084 ms 53844 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 47708 KB Output is correct
2 Correct 6 ms 47708 KB Output is correct
3 Correct 6 ms 47708 KB Output is correct
4 Correct 8 ms 47708 KB Output is correct
5 Correct 8 ms 47708 KB Output is correct
6 Correct 8 ms 47708 KB Output is correct
7 Correct 8 ms 47704 KB Output is correct
8 Correct 8 ms 47708 KB Output is correct
9 Correct 10 ms 47860 KB Output is correct
10 Correct 10 ms 47708 KB Output is correct
11 Correct 10 ms 47708 KB Output is correct
12 Correct 12 ms 47708 KB Output is correct
13 Correct 11 ms 47708 KB Output is correct
14 Correct 11 ms 47708 KB Output is correct
15 Correct 10 ms 47836 KB Output is correct
16 Correct 10 ms 47708 KB Output is correct
17 Correct 10 ms 47708 KB Output is correct
18 Correct 10 ms 47872 KB Output is correct
19 Correct 10 ms 47844 KB Output is correct
20 Correct 10 ms 47960 KB Output is correct
21 Correct 10 ms 47704 KB Output is correct
22 Correct 10 ms 47708 KB Output is correct
23 Correct 10 ms 47708 KB Output is correct
24 Correct 10 ms 47712 KB Output is correct
25 Correct 11 ms 47788 KB Output is correct
26 Correct 10 ms 47708 KB Output is correct
27 Correct 6 ms 47708 KB Output is correct
28 Correct 6 ms 47708 KB Output is correct
29 Correct 7 ms 47708 KB Output is correct
30 Correct 34 ms 47708 KB Output is correct
31 Correct 39 ms 47708 KB Output is correct
32 Correct 47 ms 47960 KB Output is correct
33 Correct 47 ms 47960 KB Output is correct
34 Correct 46 ms 48248 KB Output is correct
35 Correct 33 ms 48212 KB Output is correct
36 Correct 33 ms 47964 KB Output is correct
37 Correct 36 ms 47964 KB Output is correct
38 Correct 44 ms 47964 KB Output is correct
39 Correct 45 ms 47964 KB Output is correct
40 Correct 45 ms 47964 KB Output is correct
41 Correct 35 ms 47964 KB Output is correct
42 Correct 36 ms 47964 KB Output is correct
43 Correct 33 ms 47964 KB Output is correct
44 Correct 45 ms 47964 KB Output is correct
45 Correct 45 ms 48008 KB Output is correct
46 Correct 46 ms 47960 KB Output is correct
47 Correct 36 ms 47960 KB Output is correct
48 Correct 35 ms 47964 KB Output is correct
49 Correct 38 ms 47964 KB Output is correct
50 Correct 46 ms 47964 KB Output is correct
51 Correct 45 ms 47976 KB Output is correct
52 Correct 44 ms 47960 KB Output is correct
53 Correct 54 ms 47960 KB Output is correct
54 Correct 45 ms 47964 KB Output is correct
55 Correct 47 ms 48208 KB Output is correct
56 Correct 7 ms 47704 KB Output is correct
57 Correct 7 ms 47708 KB Output is correct
58 Correct 7 ms 47964 KB Output is correct
59 Correct 7 ms 47708 KB Output is correct
60 Correct 6 ms 47704 KB Output is correct
61 Correct 8 ms 47708 KB Output is correct
62 Execution timed out 5078 ms 56600 KB Time limit exceeded
63 Halted 0 ms 0 KB -