oj.uz

답안 #1037850

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

const int Nmax=100010, sqrtN=500;
int N, M, Q, C[Nmax], p, L[Nmax], R[Nmax], D[Nmax], P[20][Nmax];
int curr, par, cnt[Nmax], ans[Nmax];
set<int> V;
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 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]++, V.insert(L[x]);
        return;
    }
    cnt[x]++;
    if(cnt[x]>1) return;
    auto q=V.lower_bound(L[x]);
    if(q==V.end() || (*q)>R[x]) {
        int y=x;
        int rv=INT_MAX, lv=INT_MIN;
        auto p=V.lower_bound(R[x]);
        if(p!=V.end()) rv=(*p);
        if(p!=V.begin()) lv=(*prev(p));
        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];
    }
    V.insert(L[x]);
    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;
    V.erase(L[x]);
    auto q=V.lower_bound(L[x]);
    if(q==V.end() || (*q)>R[x]) {
        int y=x;
        int rv=INT_MAX, lv=INT_MIN;
        auto p=V.lower_bound(R[x]);
        if(p!=V.end()) rv=(*p);
        if(p!=V.begin()) lv=(*prev(p));
        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 5 ms 24924 KB Output is correct
5 Correct 4 ms 25092 KB Output is correct
6 Correct 4 ms 24920 KB Output is correct
7 Correct 4 ms 24924 KB Output is correct
8 Correct 4 ms 24924 KB Output is correct
9 Correct 6 ms 25020 KB Output is correct
10 Correct 7 ms 24920 KB Output is correct
11 Correct 7 ms 25112 KB Output is correct
12 Correct 3 ms 24924 KB Output is correct
13 Correct 3 ms 24924 KB Output is correct
14 Correct 3 ms 24924 KB Output is correct
15 Correct 6 ms 25116 KB Output is correct
16 Correct 6 ms 24924 KB Output is correct
17 Correct 7 ms 24924 KB Output is correct
18 Correct 6 ms 24924 KB Output is correct
19 Correct 6 ms 24924 KB Output is correct
20 Correct 6 ms 24924 KB Output is correct
21 Correct 7 ms 24924 KB Output is correct
22 Correct 6 ms 25092 KB Output is correct
23 Correct 6 ms 24924 KB Output is correct
24 Correct 7 ms 24924 KB Output is correct
25 Correct 7 ms 25116 KB Output is correct
26 Correct 6 ms 24924 KB Output is correct
27 Correct 3 ms 24948 KB Output is correct
28 Correct 2 ms 16732 KB Output is correct
29 Correct 3 ms 24924 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 5 ms 24924 KB Output is correct
5 Correct 4 ms 25092 KB Output is correct
6 Correct 4 ms 24920 KB Output is correct
7 Correct 4 ms 24924 KB Output is correct
8 Correct 4 ms 24924 KB Output is correct
9 Correct 6 ms 25020 KB Output is correct
10 Correct 7 ms 24920 KB Output is correct
11 Correct 7 ms 25112 KB Output is correct
12 Correct 3 ms 24924 KB Output is correct
13 Correct 3 ms 24924 KB Output is correct
14 Correct 3 ms 24924 KB Output is correct
15 Correct 6 ms 25116 KB Output is correct
16 Correct 6 ms 24924 KB Output is correct
17 Correct 7 ms 24924 KB Output is correct
18 Correct 6 ms 24924 KB Output is correct
19 Correct 6 ms 24924 KB Output is correct
20 Correct 6 ms 24924 KB Output is correct
21 Correct 7 ms 24924 KB Output is correct
22 Correct 6 ms 25092 KB Output is correct
23 Correct 6 ms 24924 KB Output is correct
24 Correct 7 ms 24924 KB Output is correct
25 Correct 7 ms 25116 KB Output is correct
26 Correct 6 ms 24924 KB Output is correct
27 Correct 3 ms 24948 KB Output is correct
28 Correct 2 ms 16732 KB Output is correct
29 Correct 3 ms 24924 KB Output is correct
30 Correct 46 ms 27228 KB Output is correct
31 Correct 55 ms 27228 KB Output is correct
32 Correct 65 ms 27224 KB Output is correct
33 Correct 71 ms 27228 KB Output is correct
34 Correct 67 ms 27272 KB Output is correct
35 Correct 10 ms 27228 KB Output is correct
36 Correct 10 ms 27204 KB Output is correct
37 Correct 10 ms 27280 KB Output is correct
38 Correct 57 ms 27228 KB Output is correct
39 Correct 58 ms 27344 KB Output is correct
40 Correct 56 ms 27228 KB Output is correct
41 Correct 10 ms 27224 KB Output is correct
42 Correct 10 ms 27228 KB Output is correct
43 Correct 10 ms 27228 KB Output is correct
44 Correct 58 ms 27224 KB Output is correct
45 Correct 57 ms 27224 KB Output is correct
46 Correct 62 ms 27228 KB Output is correct
47 Correct 9 ms 27224 KB Output is correct
48 Correct 10 ms 27228 KB Output is correct
49 Correct 10 ms 27228 KB Output is correct
50 Correct 67 ms 27264 KB Output is correct
51 Correct 64 ms 27224 KB Output is correct
52 Correct 62 ms 27224 KB Output is correct
53 Correct 63 ms 27224 KB Output is correct
54 Correct 64 ms 27480 KB Output is correct
55 Correct 66 ms 27268 KB Output is correct
56 Correct 8 ms 26972 KB Output is correct
57 Correct 2 ms 16732 KB Output is correct
58 Correct 8 ms 27208 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 21080 KB Output is correct
2 Correct 3 ms 24924 KB Output is correct
3 Correct 8 ms 26968 KB Output is correct
4 Execution timed out 5048 ms 36920 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 233 ms 31304 KB Output is correct
3 Correct 383 ms 31568 KB Output is correct
4 Correct 287 ms 31572 KB Output is correct
5 Correct 414 ms 35920 KB Output is correct
6 Correct 449 ms 35264 KB Output is correct
7 Correct 468 ms 33688 KB Output is correct
8 Correct 493 ms 33308 KB Output is correct
9 Correct 421 ms 33104 KB Output is correct
10 Correct 451 ms 33108 KB Output is correct
11 Correct 429 ms 33016 KB Output is correct
12 Correct 442 ms 33028 KB Output is correct
13 Correct 407 ms 32852 KB Output is correct
14 Correct 418 ms 33104 KB Output is correct
15 Correct 419 ms 33224 KB Output is correct
16 Correct 436 ms 34560 KB Output is correct
17 Correct 445 ms 34644 KB Output is correct
18 Correct 438 ms 34644 KB Output is correct
19 Correct 444 ms 35920 KB Output is correct
20 Correct 405 ms 35924 KB Output is correct
21 Correct 435 ms 34388 KB Output is correct
22 Correct 452 ms 33800 KB Output is correct
23 Correct 431 ms 33364 KB Output is correct
24 Correct 456 ms 33104 KB Output is correct
25 Correct 457 ms 33108 KB Output is correct
26 Correct 486 ms 33552 KB Output is correct
27 Correct 474 ms 32848 KB Output is correct
28 Correct 460 ms 33000 KB Output is correct
29 Correct 501 ms 32852 KB Output is correct
30 Correct 491 ms 33044 KB Output is correct
31 Correct 482 ms 33048 KB Output is correct
32 Correct 461 ms 33024 KB Output is correct
33 Correct 482 ms 32984 KB Output is correct
34 Correct 511 ms 33324 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 20828 KB Output is correct
2 Correct 4 ms 24924 KB Output is correct
3 Correct 8 ms 26972 KB Output is correct
4 Execution timed out 5094 ms 33472 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 5 ms 24924 KB Output is correct
5 Correct 4 ms 25092 KB Output is correct
6 Correct 4 ms 24920 KB Output is correct
7 Correct 4 ms 24924 KB Output is correct
8 Correct 4 ms 24924 KB Output is correct
9 Correct 6 ms 25020 KB Output is correct
10 Correct 7 ms 24920 KB Output is correct
11 Correct 7 ms 25112 KB Output is correct
12 Correct 3 ms 24924 KB Output is correct
13 Correct 3 ms 24924 KB Output is correct
14 Correct 3 ms 24924 KB Output is correct
15 Correct 6 ms 25116 KB Output is correct
16 Correct 6 ms 24924 KB Output is correct
17 Correct 7 ms 24924 KB Output is correct
18 Correct 6 ms 24924 KB Output is correct
19 Correct 6 ms 24924 KB Output is correct
20 Correct 6 ms 24924 KB Output is correct
21 Correct 7 ms 24924 KB Output is correct
22 Correct 6 ms 25092 KB Output is correct
23 Correct 6 ms 24924 KB Output is correct
24 Correct 7 ms 24924 KB Output is correct
25 Correct 7 ms 25116 KB Output is correct
26 Correct 6 ms 24924 KB Output is correct
27 Correct 3 ms 24948 KB Output is correct
28 Correct 2 ms 16732 KB Output is correct
29 Correct 3 ms 24924 KB Output is correct
30 Correct 46 ms 27228 KB Output is correct
31 Correct 55 ms 27228 KB Output is correct
32 Correct 65 ms 27224 KB Output is correct
33 Correct 71 ms 27228 KB Output is correct
34 Correct 67 ms 27272 KB Output is correct
35 Correct 10 ms 27228 KB Output is correct
36 Correct 10 ms 27204 KB Output is correct
37 Correct 10 ms 27280 KB Output is correct
38 Correct 57 ms 27228 KB Output is correct
39 Correct 58 ms 27344 KB Output is correct
40 Correct 56 ms 27228 KB Output is correct
41 Correct 10 ms 27224 KB Output is correct
42 Correct 10 ms 27228 KB Output is correct
43 Correct 10 ms 27228 KB Output is correct
44 Correct 58 ms 27224 KB Output is correct
45 Correct 57 ms 27224 KB Output is correct
46 Correct 62 ms 27228 KB Output is correct
47 Correct 9 ms 27224 KB Output is correct
48 Correct 10 ms 27228 KB Output is correct
49 Correct 10 ms 27228 KB Output is correct
50 Correct 67 ms 27264 KB Output is correct
51 Correct 64 ms 27224 KB Output is correct
52 Correct 62 ms 27224 KB Output is correct
53 Correct 63 ms 27224 KB Output is correct
54 Correct 64 ms 27480 KB Output is correct
55 Correct 66 ms 27268 KB Output is correct
56 Correct 8 ms 26972 KB Output is correct
57 Correct 2 ms 16732 KB Output is correct
58 Correct 8 ms 27208 KB Output is correct
59 Correct 3 ms 21080 KB Output is correct
60 Correct 3 ms 24924 KB Output is correct
61 Correct 8 ms 26968 KB Output is correct
62 Execution timed out 5048 ms 36920 KB Time limit exceeded
63 Halted 0 ms 0 KB -