oj.uz

답안 #1037863

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1037863 2024-07-29T09:23:36 Z 변재우(#10984) Tourism (JOI23_tourism) C++17
28 / 100
 5000 ms 36548 KB 
#include <bits/stdc++.h>
#pragma gcc optimize("O3")
using namespace std;

const int Nmax=100010, sqrtN=500, S=(1<<17), INF=1e9;
int N, M, Q, C[Nmax], p, L[Nmax], R[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];

int LCA(int u, int v) {
    if(!u || !v) return 0;
    if(D[u]<D[v]) swap(u, v);
    for(int i=16; i>=0; i--) if(D[P[i][u]]>D[v]) u=P[i][u];
    if(D[u]!=D[v]) u=P[0][u];
    for(int i=16; i>=0; i--) if(P[i][u]!=P[i][v]) u=P[i][u], v=P[i][v];
    if(u!=v) u=P[0][u];
    return u;
}

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;
    for(int next:adj[curr]) if(next!=prev) D[next]=D[curr]+1, P[0][next]=curr, DFS(next, 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]];
    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;
}

Compilation message

tourism.cpp:2: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    2 | #pragma gcc optimize("O3")
      |

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 20828 KB Output is correct
2 Correct 2 ms 20828 KB Output is correct
3 Correct 2 ms 20828 KB Output is correct
4 Correct 6 ms 24924 KB Output is correct
5 Correct 5 ms 24924 KB Output is correct
6 Correct 5 ms 25136 KB Output is correct
7 Correct 6 ms 25176 KB Output is correct
8 Correct 5 ms 24924 KB Output is correct
9 Correct 9 ms 24924 KB Output is correct
10 Correct 8 ms 24924 KB Output is correct
11 Correct 8 ms 24924 KB Output is correct
12 Correct 3 ms 24924 KB Output is correct
13 Correct 3 ms 24924 KB Output is correct
14 Correct 4 ms 24920 KB Output is correct
15 Correct 8 ms 24924 KB Output is correct
16 Correct 8 ms 24924 KB Output is correct
17 Correct 8 ms 24924 KB Output is correct
18 Correct 8 ms 24924 KB Output is correct
19 Correct 8 ms 25128 KB Output is correct
20 Correct 8 ms 24924 KB Output is correct
21 Correct 9 ms 25144 KB Output is correct
22 Correct 8 ms 25140 KB Output is correct
23 Correct 8 ms 24924 KB Output is correct
24 Correct 10 ms 24920 KB Output is correct
25 Correct 9 ms 24920 KB Output is correct
26 Correct 9 ms 25092 KB Output is correct
27 Correct 3 ms 24924 KB Output is correct
28 Correct 2 ms 16732 KB Output is correct
29 Correct 3 ms 25120 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 20828 KB Output is correct
2 Correct 2 ms 20828 KB Output is correct
3 Correct 2 ms 20828 KB Output is correct
4 Correct 6 ms 24924 KB Output is correct
5 Correct 5 ms 24924 KB Output is correct
6 Correct 5 ms 25136 KB Output is correct
7 Correct 6 ms 25176 KB Output is correct
8 Correct 5 ms 24924 KB Output is correct
9 Correct 9 ms 24924 KB Output is correct
10 Correct 8 ms 24924 KB Output is correct
11 Correct 8 ms 24924 KB Output is correct
12 Correct 3 ms 24924 KB Output is correct
13 Correct 3 ms 24924 KB Output is correct
14 Correct 4 ms 24920 KB Output is correct
15 Correct 8 ms 24924 KB Output is correct
16 Correct 8 ms 24924 KB Output is correct
17 Correct 8 ms 24924 KB Output is correct
18 Correct 8 ms 24924 KB Output is correct
19 Correct 8 ms 25128 KB Output is correct
20 Correct 8 ms 24924 KB Output is correct
21 Correct 9 ms 25144 KB Output is correct
22 Correct 8 ms 25140 KB Output is correct
23 Correct 8 ms 24924 KB Output is correct
24 Correct 10 ms 24920 KB Output is correct
25 Correct 9 ms 24920 KB Output is correct
26 Correct 9 ms 25092 KB Output is correct
27 Correct 3 ms 24924 KB Output is correct
28 Correct 2 ms 16732 KB Output is correct
29 Correct 3 ms 25120 KB Output is correct
30 Correct 56 ms 27264 KB Output is correct
31 Correct 74 ms 27260 KB Output is correct
32 Correct 74 ms 27228 KB Output is correct
33 Correct 83 ms 27228 KB Output is correct
34 Correct 77 ms 27224 KB Output is correct
35 Correct 11 ms 27228 KB Output is correct
36 Correct 12 ms 27228 KB Output is correct
37 Correct 11 ms 27228 KB Output is correct
38 Correct 69 ms 27224 KB Output is correct
39 Correct 71 ms 27224 KB Output is correct
40 Correct 70 ms 27228 KB Output is correct
41 Correct 11 ms 27224 KB Output is correct
42 Correct 11 ms 27228 KB Output is correct
43 Correct 12 ms 27228 KB Output is correct
44 Correct 73 ms 27260 KB Output is correct
45 Correct 72 ms 27228 KB Output is correct
46 Correct 74 ms 27228 KB Output is correct
47 Correct 11 ms 27224 KB Output is correct
48 Correct 11 ms 27324 KB Output is correct
49 Correct 12 ms 27228 KB Output is correct
50 Correct 82 ms 27308 KB Output is correct
51 Correct 74 ms 27228 KB Output is correct
52 Correct 73 ms 27224 KB Output is correct
53 Correct 73 ms 27228 KB Output is correct
54 Correct 75 ms 27228 KB Output is correct
55 Correct 76 ms 27228 KB Output is correct
56 Correct 9 ms 26968 KB Output is correct
57 Correct 3 ms 16984 KB Output is correct
58 Correct 10 ms 27228 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 20828 KB Output is correct
2 Correct 3 ms 25096 KB Output is correct
3 Correct 8 ms 27184 KB Output is correct
4 Execution timed out 5092 ms 36548 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 20824 KB Output is correct
2 Correct 254 ms 32932 KB Output is correct
3 Correct 371 ms 33360 KB Output is correct
4 Correct 322 ms 33872 KB Output is correct
5 Correct 374 ms 35924 KB Output is correct
6 Correct 415 ms 35924 KB Output is correct
7 Correct 447 ms 36088 KB Output is correct
8 Correct 445 ms 35920 KB Output is correct
9 Correct 454 ms 36076 KB Output is correct
10 Correct 460 ms 35924 KB Output is correct
11 Correct 450 ms 36096 KB Output is correct
12 Correct 457 ms 35920 KB Output is correct
13 Correct 448 ms 35920 KB Output is correct
14 Correct 452 ms 36180 KB Output is correct
15 Correct 473 ms 36176 KB Output is correct
16 Correct 463 ms 35920 KB Output is correct
17 Correct 464 ms 36080 KB Output is correct
18 Correct 448 ms 35924 KB Output is correct
19 Correct 448 ms 36104 KB Output is correct
20 Correct 410 ms 36104 KB Output is correct
21 Correct 463 ms 35924 KB Output is correct
22 Correct 463 ms 36072 KB Output is correct
23 Correct 458 ms 35920 KB Output is correct
24 Correct 491 ms 35924 KB Output is correct
25 Correct 436 ms 35920 KB Output is correct
26 Correct 467 ms 35920 KB Output is correct
27 Correct 517 ms 36100 KB Output is correct
28 Correct 519 ms 35920 KB Output is correct
29 Correct 523 ms 35920 KB Output is correct
30 Correct 567 ms 36112 KB Output is correct
31 Correct 506 ms 36088 KB Output is correct
32 Correct 519 ms 36180 KB Output is correct
33 Correct 516 ms 36308 KB Output is correct
34 Correct 561 ms 36180 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 20824 KB Output is correct
2 Correct 3 ms 24924 KB Output is correct
3 Correct 8 ms 27188 KB Output is correct
4 Execution timed out 5086 ms 33212 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 20828 KB Output is correct
2 Correct 2 ms 20828 KB Output is correct
3 Correct 2 ms 20828 KB Output is correct
4 Correct 6 ms 24924 KB Output is correct
5 Correct 5 ms 24924 KB Output is correct
6 Correct 5 ms 25136 KB Output is correct
7 Correct 6 ms 25176 KB Output is correct
8 Correct 5 ms 24924 KB Output is correct
9 Correct 9 ms 24924 KB Output is correct
10 Correct 8 ms 24924 KB Output is correct
11 Correct 8 ms 24924 KB Output is correct
12 Correct 3 ms 24924 KB Output is correct
13 Correct 3 ms 24924 KB Output is correct
14 Correct 4 ms 24920 KB Output is correct
15 Correct 8 ms 24924 KB Output is correct
16 Correct 8 ms 24924 KB Output is correct
17 Correct 8 ms 24924 KB Output is correct
18 Correct 8 ms 24924 KB Output is correct
19 Correct 8 ms 25128 KB Output is correct
20 Correct 8 ms 24924 KB Output is correct
21 Correct 9 ms 25144 KB Output is correct
22 Correct 8 ms 25140 KB Output is correct
23 Correct 8 ms 24924 KB Output is correct
24 Correct 10 ms 24920 KB Output is correct
25 Correct 9 ms 24920 KB Output is correct
26 Correct 9 ms 25092 KB Output is correct
27 Correct 3 ms 24924 KB Output is correct
28 Correct 2 ms 16732 KB Output is correct
29 Correct 3 ms 25120 KB Output is correct
30 Correct 56 ms 27264 KB Output is correct
31 Correct 74 ms 27260 KB Output is correct
32 Correct 74 ms 27228 KB Output is correct
33 Correct 83 ms 27228 KB Output is correct
34 Correct 77 ms 27224 KB Output is correct
35 Correct 11 ms 27228 KB Output is correct
36 Correct 12 ms 27228 KB Output is correct
37 Correct 11 ms 27228 KB Output is correct
38 Correct 69 ms 27224 KB Output is correct
39 Correct 71 ms 27224 KB Output is correct
40 Correct 70 ms 27228 KB Output is correct
41 Correct 11 ms 27224 KB Output is correct
42 Correct 11 ms 27228 KB Output is correct
43 Correct 12 ms 27228 KB Output is correct
44 Correct 73 ms 27260 KB Output is correct
45 Correct 72 ms 27228 KB Output is correct
46 Correct 74 ms 27228 KB Output is correct
47 Correct 11 ms 27224 KB Output is correct
48 Correct 11 ms 27324 KB Output is correct
49 Correct 12 ms 27228 KB Output is correct
50 Correct 82 ms 27308 KB Output is correct
51 Correct 74 ms 27228 KB Output is correct
52 Correct 73 ms 27224 KB Output is correct
53 Correct 73 ms 27228 KB Output is correct
54 Correct 75 ms 27228 KB Output is correct
55 Correct 76 ms 27228 KB Output is correct
56 Correct 9 ms 26968 KB Output is correct
57 Correct 3 ms 16984 KB Output is correct
58 Correct 10 ms 27228 KB Output is correct
59 Correct 3 ms 20828 KB Output is correct
60 Correct 3 ms 25096 KB Output is correct
61 Correct 8 ms 27184 KB Output is correct
62 Execution timed out 5092 ms 36548 KB Time limit exceeded
63 Halted 0 ms 0 KB -