oj.uz

Submission #949696

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

using namespace std;
typedef pair<int,int> pii;
int bucksize=320;
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];
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);
}
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())
            {
                int l=qr[b].back().l;
                int r=qr[b].back().r;
                int ind=qr[b].back().ind;
                qr[b].pop_back();
                set<pii> s;
                int nivmin=niv[c[l]];
                int cnt=nivmin+1;
                s.insert({in[c[l]],c[l]});
                for(int i=l+1;i<=r;i++)
                {
                    int nod=c[i];
                    if(s.find({in[nod],nod})!=s.end())
                        continue;
                    //cnt++;
                    s.insert({in[nod],nod});
                    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;
                    }
                }
                sol[ind]=cnt-nivmin;
            }
        }
    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 7 ms 47708 KB Output is correct
2 Correct 6 ms 47708 KB Output is correct
3 Correct 7 ms 47828 KB Output is correct
4 Correct 10 ms 47704 KB Output is correct
5 Correct 8 ms 47796 KB Output is correct
6 Correct 8 ms 47708 KB Output is correct
7 Correct 8 ms 47708 KB Output is correct
8 Correct 7 ms 47708 KB Output is correct
9 Correct 10 ms 47784 KB Output is correct
10 Correct 11 ms 47708 KB Output is correct
11 Correct 11 ms 47816 KB Output is correct
12 Correct 21 ms 47708 KB Output is correct
13 Correct 15 ms 47708 KB Output is correct
14 Correct 16 ms 47708 KB Output is correct
15 Correct 12 ms 47960 KB Output is correct
16 Correct 9 ms 47704 KB Output is correct
17 Correct 10 ms 47712 KB Output is correct
18 Correct 10 ms 47708 KB Output is correct
19 Correct 10 ms 47836 KB Output is correct
20 Correct 10 ms 47704 KB Output is correct
21 Correct 12 ms 47704 KB Output is correct
22 Correct 10 ms 47704 KB Output is correct
23 Correct 10 ms 47708 KB Output is correct
24 Correct 11 ms 47708 KB Output is correct
25 Correct 10 ms 47708 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 47704 KB Output is correct
29 Correct 6 ms 47708 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47708 KB Output is correct
2 Correct 6 ms 47708 KB Output is correct
3 Correct 7 ms 47828 KB Output is correct
4 Correct 10 ms 47704 KB Output is correct
5 Correct 8 ms 47796 KB Output is correct
6 Correct 8 ms 47708 KB Output is correct
7 Correct 8 ms 47708 KB Output is correct
8 Correct 7 ms 47708 KB Output is correct
9 Correct 10 ms 47784 KB Output is correct
10 Correct 11 ms 47708 KB Output is correct
11 Correct 11 ms 47816 KB Output is correct
12 Correct 21 ms 47708 KB Output is correct
13 Correct 15 ms 47708 KB Output is correct
14 Correct 16 ms 47708 KB Output is correct
15 Correct 12 ms 47960 KB Output is correct
16 Correct 9 ms 47704 KB Output is correct
17 Correct 10 ms 47712 KB Output is correct
18 Correct 10 ms 47708 KB Output is correct
19 Correct 10 ms 47836 KB Output is correct
20 Correct 10 ms 47704 KB Output is correct
21 Correct 12 ms 47704 KB Output is correct
22 Correct 10 ms 47704 KB Output is correct
23 Correct 10 ms 47708 KB Output is correct
24 Correct 11 ms 47708 KB Output is correct
25 Correct 10 ms 47708 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 47704 KB Output is correct
29 Correct 6 ms 47708 KB Output is correct
30 Correct 131 ms 47928 KB Output is correct
31 Correct 176 ms 47708 KB Output is correct
32 Correct 271 ms 48212 KB Output is correct
33 Correct 265 ms 47968 KB Output is correct
34 Correct 259 ms 47980 KB Output is correct
35 Correct 701 ms 47960 KB Output is correct
36 Correct 710 ms 47972 KB Output is correct
37 Correct 706 ms 47964 KB Output is correct
38 Correct 251 ms 48044 KB Output is correct
39 Correct 251 ms 48072 KB Output is correct
40 Correct 247 ms 48072 KB Output is correct
41 Correct 691 ms 48076 KB Output is correct
42 Correct 677 ms 48208 KB Output is correct
43 Correct 679 ms 48040 KB Output is correct
44 Correct 274 ms 48012 KB Output is correct
45 Correct 256 ms 48008 KB Output is correct
46 Correct 256 ms 48012 KB Output is correct
47 Correct 686 ms 47992 KB Output is correct
48 Correct 676 ms 47996 KB Output is correct
49 Correct 677 ms 48000 KB Output is correct
50 Correct 273 ms 47968 KB Output is correct
51 Correct 259 ms 47960 KB Output is correct
52 Correct 259 ms 47964 KB Output is correct
53 Correct 254 ms 47960 KB Output is correct
54 Correct 264 ms 47992 KB Output is correct
55 Correct 264 ms 47988 KB Output is correct
56 Correct 11 ms 47704 KB Output is correct
57 Correct 7 ms 47964 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 6 ms 47708 KB Output is correct
2 Correct 6 ms 47708 KB Output is correct
3 Correct 11 ms 47704 KB Output is correct
4 Execution timed out 5044 ms 58320 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 47704 KB Output is correct
2 Correct 39 ms 49756 KB Output is correct
3 Correct 49 ms 50136 KB Output is correct
4 Correct 47 ms 53596 KB Output is correct
5 Correct 87 ms 58192 KB Output is correct
6 Correct 89 ms 56620 KB Output is correct
7 Correct 85 ms 55840 KB Output is correct
8 Correct 82 ms 55380 KB Output is correct
9 Correct 86 ms 55456 KB Output is correct
10 Correct 79 ms 55440 KB Output is correct
11 Correct 73 ms 55380 KB Output is correct
12 Correct 67 ms 55448 KB Output is correct
13 Correct 63 ms 55644 KB Output is correct
14 Correct 65 ms 56144 KB Output is correct
15 Correct 72 ms 58448 KB Output is correct
16 Correct 77 ms 57172 KB Output is correct
17 Correct 85 ms 57304 KB Output is correct
18 Correct 77 ms 57204 KB Output is correct
19 Correct 78 ms 58192 KB Output is correct
20 Correct 80 ms 57136 KB Output is correct
21 Correct 82 ms 56128 KB Output is correct
22 Correct 78 ms 55792 KB Output is correct
23 Correct 83 ms 55620 KB Output is correct
24 Correct 72 ms 55376 KB Output is correct
25 Correct 77 ms 55380 KB Output is correct
26 Correct 69 ms 55380 KB Output is correct
27 Correct 66 ms 55380 KB Output is correct
28 Correct 68 ms 55632 KB Output is correct
29 Correct 61 ms 55376 KB Output is correct
30 Correct 75 ms 55608 KB Output is correct
31 Correct 62 ms 55612 KB Output is correct
32 Correct 60 ms 56024 KB Output is correct
33 Correct 75 ms 57068 KB Output is correct
34 Correct 66 ms 58504 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 47704 KB Output is correct
2 Correct 6 ms 47708 KB Output is correct
3 Correct 11 ms 47800 KB Output is correct
4 Execution timed out 5031 ms 55640 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 47708 KB Output is correct
2 Correct 6 ms 47708 KB Output is correct
3 Correct 7 ms 47828 KB Output is correct
4 Correct 10 ms 47704 KB Output is correct
5 Correct 8 ms 47796 KB Output is correct
6 Correct 8 ms 47708 KB Output is correct
7 Correct 8 ms 47708 KB Output is correct
8 Correct 7 ms 47708 KB Output is correct
9 Correct 10 ms 47784 KB Output is correct
10 Correct 11 ms 47708 KB Output is correct
11 Correct 11 ms 47816 KB Output is correct
12 Correct 21 ms 47708 KB Output is correct
13 Correct 15 ms 47708 KB Output is correct
14 Correct 16 ms 47708 KB Output is correct
15 Correct 12 ms 47960 KB Output is correct
16 Correct 9 ms 47704 KB Output is correct
17 Correct 10 ms 47712 KB Output is correct
18 Correct 10 ms 47708 KB Output is correct
19 Correct 10 ms 47836 KB Output is correct
20 Correct 10 ms 47704 KB Output is correct
21 Correct 12 ms 47704 KB Output is correct
22 Correct 10 ms 47704 KB Output is correct
23 Correct 10 ms 47708 KB Output is correct
24 Correct 11 ms 47708 KB Output is correct
25 Correct 10 ms 47708 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 47704 KB Output is correct
29 Correct 6 ms 47708 KB Output is correct
30 Correct 131 ms 47928 KB Output is correct
31 Correct 176 ms 47708 KB Output is correct
32 Correct 271 ms 48212 KB Output is correct
33 Correct 265 ms 47968 KB Output is correct
34 Correct 259 ms 47980 KB Output is correct
35 Correct 701 ms 47960 KB Output is correct
36 Correct 710 ms 47972 KB Output is correct
37 Correct 706 ms 47964 KB Output is correct
38 Correct 251 ms 48044 KB Output is correct
39 Correct 251 ms 48072 KB Output is correct
40 Correct 247 ms 48072 KB Output is correct
41 Correct 691 ms 48076 KB Output is correct
42 Correct 677 ms 48208 KB Output is correct
43 Correct 679 ms 48040 KB Output is correct
44 Correct 274 ms 48012 KB Output is correct
45 Correct 256 ms 48008 KB Output is correct
46 Correct 256 ms 48012 KB Output is correct
47 Correct 686 ms 47992 KB Output is correct
48 Correct 676 ms 47996 KB Output is correct
49 Correct 677 ms 48000 KB Output is correct
50 Correct 273 ms 47968 KB Output is correct
51 Correct 259 ms 47960 KB Output is correct
52 Correct 259 ms 47964 KB Output is correct
53 Correct 254 ms 47960 KB Output is correct
54 Correct 264 ms 47992 KB Output is correct
55 Correct 264 ms 47988 KB Output is correct
56 Correct 11 ms 47704 KB Output is correct
57 Correct 7 ms 47964 KB Output is correct
58 Correct 7 ms 47964 KB Output is correct
59 Correct 6 ms 47708 KB Output is correct
60 Correct 6 ms 47708 KB Output is correct
61 Correct 11 ms 47704 KB Output is correct
62 Execution timed out 5044 ms 58320 KB Time limit exceeded
63 Halted 0 ms 0 KB -