oj.uz

답안 #892771

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892771 2023-12-25T22:59:45 Z alexander707070 Tourism (JOI23_tourism) C++14
35 / 100
 5000 ms 41212 KB 
#include<bits/stdc++.h>
#define MAXN 100007
using namespace std;

const int bucket_sz=500;

struct qr{
    int l,r,id;
}qs[MAXN];

struct node{
    int l,r;
}w[MAXN];

struct event{
    int type,ind,val,tim;
};

stack<event> st;

int n,m,q,a,b,tt,dist[MAXN],bucket[MAXN],l,r,cnt[MAXN],tim,sum,last,ans[MAXN];
int c[MAXN],num[MAXN],ret[MAXN],fr[MAXN];
vector<int> v[MAXN],euler;

void dfs(int x,int p,int d){
    tt++; num[x]=tt; ret[tt]=x;
    dist[x]=d;

    fr[x]=int(euler.size());
    euler.push_back(num[x]);

    for(int i=0;i<v[x].size();i++){
        if(v[x][i]==p)continue;
        dfs(v[x][i],x,d+1);

        euler.push_back(num[x]);
    }
}

bool li[4*MAXN][20];
int dp[4*MAXN][20];

int lg[4*MAXN],power[20];

void calc(){
    power[0]=1;
    for(int i=1;i<20;i++)power[i]=power[i-1]*2;
    lg[1]=0;
    for(int i=2;i<=4*n;i++)lg[i]=lg[i/2]+1;
}

int rmq(int i,int j){
    if(j==0)return euler[i];

    if(li[i][j])return dp[i][j];
    li[i][j]=true;

    dp[i][j]=min( rmq(i,j-1) , rmq(i+power[j-1],j-1) );
    return dp[i][j];
}

int lca(int x,int y){
    if(fr[x]>fr[y])swap(x,y);
    x=fr[x]; y=fr[y];

    return ret[ min( rmq(x,lg[y-x+1]) , rmq(y-power[lg[y-x+1]]+1,lg[y-x+1]) ) ];
}

int distance(int x,int y){
    if(x==0 or y==n+1)return 0;

    return dist[x]+dist[y]-2*dist[lca(x,y)];
}

bool cmp(qr fr,qr sc){
    if(bucket[fr.l]!=bucket[sc.l])return bucket[fr.l]<bucket[sc.l];
    if(fr.r!=sc.r)return fr.r>sc.r;   
    return fr.l<sc.l;
}

void insertv(int x,int y,int z){
    sum-=distance(ret[y],ret[z]);
    sum+=distance(ret[y],ret[x]);
    sum+=distance(ret[x],ret[z]);

    w[x].l=y; w[x].r=z;
    w[y].r=x; w[z].l=x;
}

void erasev(int x){
    st.push({1,w[x].l,x,tim});
    st.push({2,w[x].r,x,tim});

    w[w[x].l].r=w[x].r;
    w[w[x].r].l=w[x].l;
}

void rem(int x){
    if(x==0){
        tim++; return;
    }

    tim++;
    x=num[c[x]];
    cnt[x]--;

    if(cnt[x]!=0)return;

    st.push({3,0,sum,tim});

    sum-=distance(ret[w[x].l],ret[x]);
    sum-=distance(ret[x],ret[w[x].r]);
    sum+=distance(ret[w[x].l],ret[w[x].r]);

    erasev(x);
}

void undo(){
    while(!st.empty() and st.top().tim==tim){
        if(st.top().type==1){
            w[st.top().ind].r=st.top().val;
        }
        if(st.top().type==2){
            w[st.top().ind].l=st.top().val;
        }
        if(st.top().type==3){
            sum=st.top().val;
        }

        st.pop();
    }
    tim--;
}

void reset(){
    tim=sum=0;
    while(!st.empty())st.pop();
    for(int i=1;i<=n;i++)cnt[i]=0;
}

int edge(){
    int lx=w[0].r,rx=w[n+1].l;
    return distance(ret[lx],ret[rx]);
}

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>m>>q;
    calc();

    for(int i=1;i<=n-1;i++){
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    dfs(1,0,0);

    w[0].l=n+1;
    w[n+1].r=0;
    ret[n+1]=n+1;

    for(int i=1;i<=m;i++){
        cin>>c[i];
        bucket[i]=i/bucket_sz;
    }

    for(int i=1;i<=q;i++){
        cin>>qs[i].l>>qs[i].r;
        qs[i].id=i;
    }

    sort(qs+1,qs+q+1,cmp);

    for(int i=1;i<=q;i++){
        if(i==1 or bucket[qs[i].l]!=bucket[qs[i-1].l]){
            reset();
            for(int f=bucket[qs[i].l]*bucket_sz;f<=m;f++){
                cnt[num[c[f]]]++;
            }

            last=0;
            for(int f=1;f<=n;f++){
                if(cnt[f]==0)continue;
                insertv(f,last,n+1);
                last=f;
            }
            l=bucket[qs[i].l]*bucket_sz;
            r=m;
        }

        while(r>qs[i].r){
            rem(r); r--;
        }

        while(l<qs[i].l){
            rem(l); l++;
        }

        ans[qs[i].id]=(sum+edge())/2;

        if(qs[i+1].r==qs[i].r and qs[i+1].l>=qs[i].l and bucket[qs[i+1].l]==bucket[qs[i].l]){
            continue;
        }
        
        while(l>bucket[qs[i].l]*bucket_sz){
            undo(); l--; cnt[num[c[l]]]++;
        }

    }

    for(int i=1;i<=q;i++){
        cout<<ans[i]+1<<"\n";
    }

    return 0;
}

Compilation message

tourism.cpp: In function 'void dfs(int, int, int)':
tourism.cpp:32:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for(int i=0;i<v[x].size();i++){
      |                 ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10584 KB Output is correct
3 Correct 1 ms 10720 KB Output is correct
4 Correct 2 ms 10712 KB Output is correct
5 Correct 2 ms 10768 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 3 ms 10588 KB Output is correct
10 Correct 3 ms 10588 KB Output is correct
11 Correct 3 ms 10588 KB Output is correct
12 Correct 2 ms 10716 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 3 ms 10588 KB Output is correct
16 Correct 3 ms 10588 KB Output is correct
17 Correct 3 ms 10588 KB Output is correct
18 Correct 3 ms 10584 KB Output is correct
19 Correct 3 ms 10584 KB Output is correct
20 Correct 3 ms 10584 KB Output is correct
21 Correct 3 ms 10584 KB Output is correct
22 Correct 3 ms 10588 KB Output is correct
23 Correct 3 ms 10588 KB Output is correct
24 Correct 3 ms 10584 KB Output is correct
25 Correct 3 ms 10584 KB Output is correct
26 Correct 3 ms 10588 KB Output is correct
27 Correct 2 ms 8664 KB Output is correct
28 Correct 1 ms 8536 KB Output is correct
29 Correct 3 ms 10588 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10584 KB Output is correct
3 Correct 1 ms 10720 KB Output is correct
4 Correct 2 ms 10712 KB Output is correct
5 Correct 2 ms 10768 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 3 ms 10588 KB Output is correct
10 Correct 3 ms 10588 KB Output is correct
11 Correct 3 ms 10588 KB Output is correct
12 Correct 2 ms 10716 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 3 ms 10588 KB Output is correct
16 Correct 3 ms 10588 KB Output is correct
17 Correct 3 ms 10588 KB Output is correct
18 Correct 3 ms 10584 KB Output is correct
19 Correct 3 ms 10584 KB Output is correct
20 Correct 3 ms 10584 KB Output is correct
21 Correct 3 ms 10584 KB Output is correct
22 Correct 3 ms 10588 KB Output is correct
23 Correct 3 ms 10588 KB Output is correct
24 Correct 3 ms 10584 KB Output is correct
25 Correct 3 ms 10584 KB Output is correct
26 Correct 3 ms 10588 KB Output is correct
27 Correct 2 ms 8664 KB Output is correct
28 Correct 1 ms 8536 KB Output is correct
29 Correct 3 ms 10588 KB Output is correct
30 Correct 18 ms 10844 KB Output is correct
31 Correct 21 ms 10956 KB Output is correct
32 Correct 26 ms 10844 KB Output is correct
33 Correct 27 ms 11032 KB Output is correct
34 Correct 27 ms 10844 KB Output is correct
35 Correct 3 ms 10844 KB Output is correct
36 Correct 3 ms 10844 KB Output is correct
37 Correct 3 ms 10844 KB Output is correct
38 Correct 28 ms 11604 KB Output is correct
39 Correct 27 ms 11100 KB Output is correct
40 Correct 27 ms 11096 KB Output is correct
41 Correct 3 ms 11100 KB Output is correct
42 Correct 3 ms 11100 KB Output is correct
43 Correct 3 ms 10936 KB Output is correct
44 Correct 27 ms 11060 KB Output is correct
45 Correct 29 ms 10844 KB Output is correct
46 Correct 27 ms 11100 KB Output is correct
47 Correct 3 ms 10844 KB Output is correct
48 Correct 3 ms 10844 KB Output is correct
49 Correct 3 ms 10844 KB Output is correct
50 Correct 28 ms 10844 KB Output is correct
51 Correct 26 ms 10840 KB Output is correct
52 Correct 27 ms 10844 KB Output is correct
53 Correct 27 ms 10844 KB Output is correct
54 Correct 27 ms 10844 KB Output is correct
55 Correct 27 ms 10844 KB Output is correct
56 Correct 6 ms 8540 KB Output is correct
57 Correct 2 ms 8792 KB Output is correct
58 Correct 26 ms 10840 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10584 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 6 ms 8696 KB Output is correct
4 Correct 1960 ms 26784 KB Output is correct
5 Correct 1897 ms 32172 KB Output is correct
6 Correct 1994 ms 36144 KB Output is correct
7 Correct 3573 ms 38652 KB Output is correct
8 Correct 3687 ms 38780 KB Output is correct
9 Correct 3472 ms 38660 KB Output is correct
10 Correct 3899 ms 38552 KB Output is correct
11 Correct 3525 ms 38648 KB Output is correct
12 Correct 71 ms 35780 KB Output is correct
13 Correct 73 ms 35924 KB Output is correct
14 Correct 72 ms 35784 KB Output is correct
15 Correct 43 ms 24516 KB Output is correct
16 Correct 2857 ms 38416 KB Output is correct
17 Correct 341 ms 10448 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10588 KB Output is correct
2 Correct 491 ms 25836 KB Output is correct
3 Correct 1038 ms 29036 KB Output is correct
4 Correct 776 ms 29396 KB Output is correct
5 Correct 53 ms 36292 KB Output is correct
6 Correct 74 ms 37828 KB Output is correct
7 Correct 158 ms 38716 KB Output is correct
8 Correct 376 ms 39056 KB Output is correct
9 Correct 1110 ms 39304 KB Output is correct
10 Correct 2354 ms 39360 KB Output is correct
11 Correct 2175 ms 39420 KB Output is correct
12 Correct 2169 ms 39320 KB Output is correct
13 Correct 2521 ms 39628 KB Output is correct
14 Correct 3047 ms 39664 KB Output is correct
15 Correct 4833 ms 40900 KB Output is correct
16 Correct 1135 ms 38848 KB Output is correct
17 Correct 1054 ms 38852 KB Output is correct
18 Correct 1147 ms 38848 KB Output is correct
19 Correct 40 ms 36456 KB Output is correct
20 Correct 52 ms 37456 KB Output is correct
21 Correct 85 ms 38344 KB Output is correct
22 Correct 128 ms 38912 KB Output is correct
23 Correct 195 ms 39012 KB Output is correct
24 Correct 400 ms 39148 KB Output is correct
25 Correct 841 ms 39320 KB Output is correct
26 Correct 1426 ms 39364 KB Output is correct
27 Correct 1455 ms 39368 KB Output is correct
28 Correct 1636 ms 39424 KB Output is correct
29 Correct 1715 ms 39340 KB Output is correct
30 Correct 1806 ms 39388 KB Output is correct
31 Correct 1846 ms 39624 KB Output is correct
32 Correct 2218 ms 39624 KB Output is correct
33 Correct 2698 ms 39796 KB Output is correct
34 Correct 4479 ms 41160 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 6 ms 8624 KB Output is correct
4 Correct 2905 ms 28208 KB Output is correct
5 Correct 2670 ms 30360 KB Output is correct
6 Correct 4301 ms 37620 KB Output is correct
7 Correct 4719 ms 40996 KB Output is correct
8 Correct 4862 ms 41064 KB Output is correct
9 Correct 4395 ms 41212 KB Output is correct
10 Correct 4654 ms 41116 KB Output is correct
11 Correct 4615 ms 40980 KB Output is correct
12 Execution timed out 5005 ms 40984 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 10588 KB Output is correct
2 Correct 1 ms 10584 KB Output is correct
3 Correct 1 ms 10720 KB Output is correct
4 Correct 2 ms 10712 KB Output is correct
5 Correct 2 ms 10768 KB Output is correct
6 Correct 2 ms 10588 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10588 KB Output is correct
9 Correct 3 ms 10588 KB Output is correct
10 Correct 3 ms 10588 KB Output is correct
11 Correct 3 ms 10588 KB Output is correct
12 Correct 2 ms 10716 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 3 ms 10588 KB Output is correct
16 Correct 3 ms 10588 KB Output is correct
17 Correct 3 ms 10588 KB Output is correct
18 Correct 3 ms 10584 KB Output is correct
19 Correct 3 ms 10584 KB Output is correct
20 Correct 3 ms 10584 KB Output is correct
21 Correct 3 ms 10584 KB Output is correct
22 Correct 3 ms 10588 KB Output is correct
23 Correct 3 ms 10588 KB Output is correct
24 Correct 3 ms 10584 KB Output is correct
25 Correct 3 ms 10584 KB Output is correct
26 Correct 3 ms 10588 KB Output is correct
27 Correct 2 ms 8664 KB Output is correct
28 Correct 1 ms 8536 KB Output is correct
29 Correct 3 ms 10588 KB Output is correct
30 Correct 18 ms 10844 KB Output is correct
31 Correct 21 ms 10956 KB Output is correct
32 Correct 26 ms 10844 KB Output is correct
33 Correct 27 ms 11032 KB Output is correct
34 Correct 27 ms 10844 KB Output is correct
35 Correct 3 ms 10844 KB Output is correct
36 Correct 3 ms 10844 KB Output is correct
37 Correct 3 ms 10844 KB Output is correct
38 Correct 28 ms 11604 KB Output is correct
39 Correct 27 ms 11100 KB Output is correct
40 Correct 27 ms 11096 KB Output is correct
41 Correct 3 ms 11100 KB Output is correct
42 Correct 3 ms 11100 KB Output is correct
43 Correct 3 ms 10936 KB Output is correct
44 Correct 27 ms 11060 KB Output is correct
45 Correct 29 ms 10844 KB Output is correct
46 Correct 27 ms 11100 KB Output is correct
47 Correct 3 ms 10844 KB Output is correct
48 Correct 3 ms 10844 KB Output is correct
49 Correct 3 ms 10844 KB Output is correct
50 Correct 28 ms 10844 KB Output is correct
51 Correct 26 ms 10840 KB Output is correct
52 Correct 27 ms 10844 KB Output is correct
53 Correct 27 ms 10844 KB Output is correct
54 Correct 27 ms 10844 KB Output is correct
55 Correct 27 ms 10844 KB Output is correct
56 Correct 6 ms 8540 KB Output is correct
57 Correct 2 ms 8792 KB Output is correct
58 Correct 26 ms 10840 KB Output is correct
59 Correct 1 ms 10584 KB Output is correct
60 Correct 1 ms 8540 KB Output is correct
61 Correct 6 ms 8696 KB Output is correct
62 Correct 1960 ms 26784 KB Output is correct
63 Correct 1897 ms 32172 KB Output is correct
64 Correct 1994 ms 36144 KB Output is correct
65 Correct 3573 ms 38652 KB Output is correct
66 Correct 3687 ms 38780 KB Output is correct
67 Correct 3472 ms 38660 KB Output is correct
68 Correct 3899 ms 38552 KB Output is correct
69 Correct 3525 ms 38648 KB Output is correct
70 Correct 71 ms 35780 KB Output is correct
71 Correct 73 ms 35924 KB Output is correct
72 Correct 72 ms 35784 KB Output is correct
73 Correct 43 ms 24516 KB Output is correct
74 Correct 2857 ms 38416 KB Output is correct
75 Correct 341 ms 10448 KB Output is correct
76 Correct 2 ms 10588 KB Output is correct
77 Correct 491 ms 25836 KB Output is correct
78 Correct 1038 ms 29036 KB Output is correct
79 Correct 776 ms 29396 KB Output is correct
80 Correct 53 ms 36292 KB Output is correct
81 Correct 74 ms 37828 KB Output is correct
82 Correct 158 ms 38716 KB Output is correct
83 Correct 376 ms 39056 KB Output is correct
84 Correct 1110 ms 39304 KB Output is correct
85 Correct 2354 ms 39360 KB Output is correct
86 Correct 2175 ms 39420 KB Output is correct
87 Correct 2169 ms 39320 KB Output is correct
88 Correct 2521 ms 39628 KB Output is correct
89 Correct 3047 ms 39664 KB Output is correct
90 Correct 4833 ms 40900 KB Output is correct
91 Correct 1135 ms 38848 KB Output is correct
92 Correct 1054 ms 38852 KB Output is correct
93 Correct 1147 ms 38848 KB Output is correct
94 Correct 40 ms 36456 KB Output is correct
95 Correct 52 ms 37456 KB Output is correct
96 Correct 85 ms 38344 KB Output is correct
97 Correct 128 ms 38912 KB Output is correct
98 Correct 195 ms 39012 KB Output is correct
99 Correct 400 ms 39148 KB Output is correct
100 Correct 841 ms 39320 KB Output is correct
101 Correct 1426 ms 39364 KB Output is correct
102 Correct 1455 ms 39368 KB Output is correct
103 Correct 1636 ms 39424 KB Output is correct
104 Correct 1715 ms 39340 KB Output is correct
105 Correct 1806 ms 39388 KB Output is correct
106 Correct 1846 ms 39624 KB Output is correct
107 Correct 2218 ms 39624 KB Output is correct
108 Correct 2698 ms 39796 KB Output is correct
109 Correct 4479 ms 41160 KB Output is correct
110 Correct 1 ms 10588 KB Output is correct
111 Correct 2 ms 8540 KB Output is correct
112 Correct 6 ms 8624 KB Output is correct
113 Correct 2905 ms 28208 KB Output is correct
114 Correct 2670 ms 30360 KB Output is correct
115 Correct 4301 ms 37620 KB Output is correct
116 Correct 4719 ms 40996 KB Output is correct
117 Correct 4862 ms 41064 KB Output is correct
118 Correct 4395 ms 41212 KB Output is correct
119 Correct 4654 ms 41116 KB Output is correct
120 Correct 4615 ms 40980 KB Output is correct
121 Execution timed out 5005 ms 40984 KB Time limit exceeded
122 Halted 0 ms 0 KB -