oj.uz

답안 #1037911

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1037911 2024-07-29T10:01:44 Z 변재우(#10984) Tourism (JOI23_tourism) C++17
28 / 100
 5000 ms 107468 KB 
#include <bits/stdc++.h>
using namespace std;

const int Nmax=100010, sqrtN=600, S=(1<<17), INF=1e9;
int N, M, Q, C[Nmax], p, L[Nmax], R[Nmax], q, I[Nmax], V[2*Nmax], D[Nmax], P[20][Nmax];
int curr, par, cnt[Nmax], ans[Nmax];
vector<int> adj[Nmax];
struct Query {int l, r, i;}X[Nmax];

class DSeg {
public:
    void Init() {
        for(int i=1; i<=q; i++) lx[0][i]=rx[0][i]=D[V[i]], li[0][i]=ri[0][i]=V[i];
        for(int i=1; i<=17; i++) {
            for(int j=1; j<=q; j++) {
                if(j+(1<<(i-1))<=q) {
                    if(lx[i-1][j]<lx[i-1][j+(1<<(i-1))]) lx[i][j]=lx[i-1][j], li[i][j]=li[i-1][j];
                    else lx[i][j]=lx[i-1][j+(1<<(i-1))], li[i][j]=li[i-1][j+(1<<(i-1))];
                }
                if(j-(1<<(i-1))>=1) {
                    if(rx[i-1][j]<rx[i-1][j-(1<<(i-1))]) rx[i][j]=rx[i-1][j], ri[i][j]=ri[i-1][j];
                    else rx[i][j]=rx[i-1][j-(1<<(i-1))], ri[i][j]=ri[i-1][j-(1<<(i-1))];
                }
            }
        }
    }
    int LCA(int a, int b) {
        int l=min(I[a], I[b]), r=max(I[a], I[b]);
        int t=(31-__builtin_clz(r-l+1));
        if(lx[t][l]<rx[t][r]) return li[t][l];
        else return ri[t][r];
    }
private:
    int lx[20][2*Nmax], rx[20][2*Nmax], li[20][2*Nmax], ri[20][2*Nmax];
}QQQ;

int LCA(int u, int v) {
    if(u==0 || v==0) return 0;
    return QQQ.LCA(u, v);
}

class Seg {
public:
    Seg() {fill(Mn, Mn+2*S, INF), fill(Mx+1, Mx+2*S, -INF);}
    void Update(int k, int v) {
        Tree[k+=S-1]=v;
        if(v) Mn[k]=Mx[k]=k-S+1;
        else Mn[k]=INF, Mx[k]=-INF;
        for(k>>=1; k; k>>=1) Tree[k]=Tree[k<<1]+Tree[k<<1|1], Mn[k]=min(Mn[k<<1], Mn[k<<1|1]), Mx[k]=max(Mx[k<<1], Mx[k<<1|1]);
    }
    pair<int, int> Query(int l, int r) {
        int mn=INF, mx=-INF;
        for(l+=S-1, r+=S-1; l<r; l>>=1, r>>=1) {
            if(l&1) mn=min(mn, Mn[l]), mx=max(mx, Mx[l]), l++;
            if(!(r&1)) mn=min(mn, Mn[r]), mx=max(mx, Mx[r]), r--;
        }
        if(l==r) mn=min(mn, Mn[l]), mx=max(mx, Mx[l]);
        return {mn, mx};
    }
private:
    int Tree[2*S], Mn[2*S], Mx[2*S];
}T;

class LSeg {
public:
    void Init() {
        for(int i=1; i<=M; i++) lx[0][i]=rx[0][i]=C[i];
        for(int i=1; i<=16; i++) {
            for(int j=1; j<=M; j++) {
                if(j+(1<<(i-1))<=M) lx[i][j]=LCA(lx[i-1][j], lx[i-1][j+(1<<(i-1))]);
                if(j-(1<<(i-1))>=1) rx[i][j]=LCA(rx[i-1][j], rx[i-1][j-(1<<(i-1))]);
            }
        }
    }
    int Query(int l, int r) {
        int t=(31-__builtin_clz(r-l+1));
        return LCA(lx[t][l], rx[t][r]);
    }
private:
    int lx[20][Nmax], rx[20][Nmax];
}TL;

void DFS(int curr, int prev) {
    L[curr]=++p;
    I[curr]=++q, V[q]=curr;
    for(int next:adj[curr]) if(next!=prev) {
        D[next]=D[curr]+1, P[0][next]=curr, DFS(next, curr);
        V[++q]=curr;
    }
    R[curr]=p;
}

void Add(int x) {
    if(!par) {
        par=x, curr=1;
        cnt[x]++, T.Update(L[x], 1);
        return;
    }
    cnt[x]++;
    if(cnt[x]>1) return;
    int tmp=T.Query(L[x]+1, N).first;
    if(tmp>R[x]) {
        int y=x;
        int rv=tmp, lv=T.Query(1, L[x]-1).second;
        for(int i=16; i>=0; i--) if(P[i][y] && R[P[i][y]]<rv && L[P[i][y]]>lv) y=P[i][y];
        y=P[0][y];
        curr+=D[x]-D[y];
    }
    T.Update(L[x], 1);
    int np=LCA(par, x);
    curr+=D[par]-D[np], par=np;
    return;
}

void Delete(int x, int tl, int tr) {
    cnt[x]--;
    if(cnt[x]) return;
    T.Update(L[x], 0);
    int tmp=T.Query(L[x]+1, N).first;
    if(tmp>R[x]) {
        int y=x;
        int rv=tmp, lv=T.Query(1, L[x]-1).second;
        for(int i=16; i>=0; i--) if(P[i][y] && R[P[i][y]]<rv && L[P[i][y]]>lv) y=P[i][y];
        y=P[0][y];
        curr-=D[x]-D[y];
    }
    int np=TL.Query(tl, tr);
    curr-=D[np]-D[par], par=np;
    return;
}

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>N>>M>>Q;
    for(int i=1; i<N; i++) {
        int u, v; cin>>u>>v;
        adj[u].push_back(v), adj[v].push_back(u);
    }
    DFS(1, 0);
    for(int i=1; i<20; i++) for(int j=1; j<=N; j++) P[i][j]=P[i-1][P[i-1][j]];
    QQQ.Init();
    for(int i=1; i<=M; i++) cin>>C[i];
    TL.Init();
    for(int i=1; i<=Q; i++) cin>>X[i].l>>X[i].r, X[i].i=i;
    sort(X+1, X+Q+1, [](Query a, Query b) {return ((a.l/sqrtN)!=(b.l/sqrtN))?((a.l/sqrtN)<(b.l/sqrtN)):(a.r<b.r);});
    for(int i=X[1].l; i<=X[1].r; i++) Add(C[i]);
    ans[X[1].i]=curr;
    for(int i=2, l=X[1].l, r=X[1].r; i<=Q; i++) {
        while(l>X[i].l) Add(C[--l]);
        while(r<X[i].r) Add(C[++r]);
        while(l<X[i].l) Delete(C[l], l+1, r), l++;
        while(r>X[i].r) Delete(C[r], l, r-1), r--;
        ans[X[i].i]=curr;
    }
    for(int i=1; i<=Q; i++) cout<<ans[i]<<"\n";
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 45404 KB Output is correct
2 Correct 5 ms 45404 KB Output is correct
3 Correct 4 ms 47600 KB Output is correct
4 Correct 8 ms 66140 KB Output is correct
5 Correct 8 ms 66132 KB Output is correct
6 Correct 9 ms 66120 KB Output is correct
7 Correct 8 ms 66140 KB Output is correct
8 Correct 8 ms 68188 KB Output is correct
9 Correct 10 ms 68176 KB Output is correct
10 Correct 10 ms 68184 KB Output is correct
11 Correct 11 ms 68184 KB Output is correct
12 Correct 6 ms 68188 KB Output is correct
13 Correct 6 ms 68188 KB Output is correct
14 Correct 7 ms 68188 KB Output is correct
15 Correct 9 ms 68032 KB Output is correct
16 Correct 10 ms 68184 KB Output is correct
17 Correct 10 ms 68144 KB Output is correct
18 Correct 10 ms 68188 KB Output is correct
19 Correct 10 ms 68188 KB Output is correct
20 Correct 10 ms 68184 KB Output is correct
21 Correct 10 ms 68096 KB Output is correct
22 Correct 9 ms 68188 KB Output is correct
23 Correct 9 ms 68208 KB Output is correct
24 Correct 10 ms 68188 KB Output is correct
25 Correct 10 ms 68188 KB Output is correct
26 Correct 9 ms 68188 KB Output is correct
27 Correct 4 ms 37212 KB Output is correct
28 Correct 5 ms 59952 KB Output is correct
29 Correct 6 ms 68200 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 45404 KB Output is correct
2 Correct 5 ms 45404 KB Output is correct
3 Correct 4 ms 47600 KB Output is correct
4 Correct 8 ms 66140 KB Output is correct
5 Correct 8 ms 66132 KB Output is correct
6 Correct 9 ms 66120 KB Output is correct
7 Correct 8 ms 66140 KB Output is correct
8 Correct 8 ms 68188 KB Output is correct
9 Correct 10 ms 68176 KB Output is correct
10 Correct 10 ms 68184 KB Output is correct
11 Correct 11 ms 68184 KB Output is correct
12 Correct 6 ms 68188 KB Output is correct
13 Correct 6 ms 68188 KB Output is correct
14 Correct 7 ms 68188 KB Output is correct
15 Correct 9 ms 68032 KB Output is correct
16 Correct 10 ms 68184 KB Output is correct
17 Correct 10 ms 68144 KB Output is correct
18 Correct 10 ms 68188 KB Output is correct
19 Correct 10 ms 68188 KB Output is correct
20 Correct 10 ms 68184 KB Output is correct
21 Correct 10 ms 68096 KB Output is correct
22 Correct 9 ms 68188 KB Output is correct
23 Correct 9 ms 68208 KB Output is correct
24 Correct 10 ms 68188 KB Output is correct
25 Correct 10 ms 68188 KB Output is correct
26 Correct 9 ms 68188 KB Output is correct
27 Correct 4 ms 37212 KB Output is correct
28 Correct 5 ms 59952 KB Output is correct
29 Correct 6 ms 68200 KB Output is correct
30 Correct 44 ms 76380 KB Output is correct
31 Correct 50 ms 76376 KB Output is correct
32 Correct 56 ms 76376 KB Output is correct
33 Correct 56 ms 76376 KB Output is correct
34 Correct 55 ms 76380 KB Output is correct
35 Correct 10 ms 76380 KB Output is correct
36 Correct 11 ms 76388 KB Output is correct
37 Correct 10 ms 76380 KB Output is correct
38 Correct 47 ms 76380 KB Output is correct
39 Correct 46 ms 76608 KB Output is correct
40 Correct 44 ms 76608 KB Output is correct
41 Correct 10 ms 76636 KB Output is correct
42 Correct 12 ms 76656 KB Output is correct
43 Correct 11 ms 76380 KB Output is correct
44 Correct 48 ms 76540 KB Output is correct
45 Correct 47 ms 76380 KB Output is correct
46 Correct 44 ms 76376 KB Output is correct
47 Correct 9 ms 76380 KB Output is correct
48 Correct 10 ms 76380 KB Output is correct
49 Correct 10 ms 76564 KB Output is correct
50 Correct 56 ms 76380 KB Output is correct
51 Correct 57 ms 76380 KB Output is correct
52 Correct 55 ms 76396 KB Output is correct
53 Correct 58 ms 76496 KB Output is correct
54 Correct 56 ms 76376 KB Output is correct
55 Correct 59 ms 76376 KB Output is correct
56 Correct 5 ms 39256 KB Output is correct
57 Correct 7 ms 66136 KB Output is correct
58 Correct 9 ms 76464 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 45400 KB Output is correct
2 Correct 4 ms 37212 KB Output is correct
3 Correct 5 ms 39260 KB Output is correct
4 Correct 2766 ms 102328 KB Output is correct
5 Correct 2488 ms 105292 KB Output is correct
6 Correct 3173 ms 106764 KB Output is correct
7 Execution timed out 5081 ms 107468 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 45656 KB Output is correct
2 Correct 115 ms 98128 KB Output is correct
3 Correct 125 ms 98556 KB Output is correct
4 Correct 132 ms 98636 KB Output is correct
5 Correct 89 ms 100352 KB Output is correct
6 Correct 97 ms 100176 KB Output is correct
7 Correct 127 ms 100420 KB Output is correct
8 Correct 148 ms 100424 KB Output is correct
9 Correct 167 ms 100432 KB Output is correct
10 Correct 149 ms 100436 KB Output is correct
11 Correct 170 ms 100176 KB Output is correct
12 Correct 180 ms 100300 KB Output is correct
13 Correct 150 ms 100460 KB Output is correct
14 Correct 165 ms 100432 KB Output is correct
15 Correct 236 ms 100696 KB Output is correct
16 Correct 166 ms 100428 KB Output is correct
17 Correct 124 ms 100444 KB Output is correct
18 Correct 148 ms 100340 KB Output is correct
19 Correct 110 ms 100432 KB Output is correct
20 Correct 83 ms 100296 KB Output is correct
21 Correct 91 ms 100408 KB Output is correct
22 Correct 151 ms 100432 KB Output is correct
23 Correct 150 ms 100708 KB Output is correct
24 Correct 136 ms 100224 KB Output is correct
25 Correct 135 ms 100436 KB Output is correct
26 Correct 162 ms 100420 KB Output is correct
27 Correct 145 ms 100480 KB Output is correct
28 Correct 194 ms 100268 KB Output is correct
29 Correct 177 ms 100692 KB Output is correct
30 Correct 211 ms 100508 KB Output is correct
31 Correct 154 ms 100452 KB Output is correct
32 Correct 228 ms 100468 KB Output is correct
33 Correct 189 ms 100432 KB Output is correct
34 Correct 223 ms 100944 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 45404 KB Output is correct
2 Correct 4 ms 37212 KB Output is correct
3 Correct 8 ms 39516 KB Output is correct
4 Execution timed out 5053 ms 98212 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 45404 KB Output is correct
2 Correct 5 ms 45404 KB Output is correct
3 Correct 4 ms 47600 KB Output is correct
4 Correct 8 ms 66140 KB Output is correct
5 Correct 8 ms 66132 KB Output is correct
6 Correct 9 ms 66120 KB Output is correct
7 Correct 8 ms 66140 KB Output is correct
8 Correct 8 ms 68188 KB Output is correct
9 Correct 10 ms 68176 KB Output is correct
10 Correct 10 ms 68184 KB Output is correct
11 Correct 11 ms 68184 KB Output is correct
12 Correct 6 ms 68188 KB Output is correct
13 Correct 6 ms 68188 KB Output is correct
14 Correct 7 ms 68188 KB Output is correct
15 Correct 9 ms 68032 KB Output is correct
16 Correct 10 ms 68184 KB Output is correct
17 Correct 10 ms 68144 KB Output is correct
18 Correct 10 ms 68188 KB Output is correct
19 Correct 10 ms 68188 KB Output is correct
20 Correct 10 ms 68184 KB Output is correct
21 Correct 10 ms 68096 KB Output is correct
22 Correct 9 ms 68188 KB Output is correct
23 Correct 9 ms 68208 KB Output is correct
24 Correct 10 ms 68188 KB Output is correct
25 Correct 10 ms 68188 KB Output is correct
26 Correct 9 ms 68188 KB Output is correct
27 Correct 4 ms 37212 KB Output is correct
28 Correct 5 ms 59952 KB Output is correct
29 Correct 6 ms 68200 KB Output is correct
30 Correct 44 ms 76380 KB Output is correct
31 Correct 50 ms 76376 KB Output is correct
32 Correct 56 ms 76376 KB Output is correct
33 Correct 56 ms 76376 KB Output is correct
34 Correct 55 ms 76380 KB Output is correct
35 Correct 10 ms 76380 KB Output is correct
36 Correct 11 ms 76388 KB Output is correct
37 Correct 10 ms 76380 KB Output is correct
38 Correct 47 ms 76380 KB Output is correct
39 Correct 46 ms 76608 KB Output is correct
40 Correct 44 ms 76608 KB Output is correct
41 Correct 10 ms 76636 KB Output is correct
42 Correct 12 ms 76656 KB Output is correct
43 Correct 11 ms 76380 KB Output is correct
44 Correct 48 ms 76540 KB Output is correct
45 Correct 47 ms 76380 KB Output is correct
46 Correct 44 ms 76376 KB Output is correct
47 Correct 9 ms 76380 KB Output is correct
48 Correct 10 ms 76380 KB Output is correct
49 Correct 10 ms 76564 KB Output is correct
50 Correct 56 ms 76380 KB Output is correct
51 Correct 57 ms 76380 KB Output is correct
52 Correct 55 ms 76396 KB Output is correct
53 Correct 58 ms 76496 KB Output is correct
54 Correct 56 ms 76376 KB Output is correct
55 Correct 59 ms 76376 KB Output is correct
56 Correct 5 ms 39256 KB Output is correct
57 Correct 7 ms 66136 KB Output is correct
58 Correct 9 ms 76464 KB Output is correct
59 Correct 4 ms 45400 KB Output is correct
60 Correct 4 ms 37212 KB Output is correct
61 Correct 5 ms 39260 KB Output is correct
62 Correct 2766 ms 102328 KB Output is correct
63 Correct 2488 ms 105292 KB Output is correct
64 Correct 3173 ms 106764 KB Output is correct
65 Execution timed out 5081 ms 107468 KB Time limit exceeded
66 Halted 0 ms 0 KB -