oj.uz

답안 #793845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793845 2023-07-26T07:23:51 Z vjudge1 Tourism (JOI23_tourism) C++14
35 / 100
 230 ms 47332 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std ;
const int N = (1 << 17) ;
bool flag1, flag2, us[N + 1] ;
int n, m, q, c[N + 1], l[N + 1], r[N + 1], p[N + 1], dist[N + 1], ind[N + 1], pw[2 * N + 1] ;
vector<int> v[N + 1] ;
vector<pair<int, int>> tree ;
int mx[N + 1][20], mn1[N + 1][20] ;
pair<int, int> mn[2 * N + 1][20] ;
//ниже всё для hld
vector<int> hld ;
int kol[N + 1], index1[N + 1], tp[N + 1], bst[N + 1], sum[2 * N + 1], psh[2 * N + 1] ;
void first_dfs(int city, int last)
{
    int now = 0 ;
    kol[city]++ ;
    for(int i : v[city])
    {
        if(i == last)
            continue ;
        first_dfs(i, city) ;
        kol[city] += kol[i] ;
        if(now < kol[i])
        {
            now = kol[i] ;
            bst[city] = i ;
        }
    }
}
void second_dfs(int city, int last, int gay)
{
    tp[city] = gay ;
    index1[city] = hld.size() ;
    hld.push_back(city) ;
    if(bst[city])
        second_dfs(bst[city], city, gay) ;
    for(int i : v[city])
    {
        if(i == last || i == bst[city])
            continue ;
        second_dfs(i, city, hld.size()) ;
    }
}
void push(int l, int r, int v)
{
    if(psh[v] == -1)
        return ;
    int num = psh[v] ;
    psh[v] = -1 ;
    sum[v] = num * (r - l + 1) ;
    if(l == r)
        return ;
    psh[v * 2] = num ;
    psh[v * 2 + 1] = num ;
}
void build()
{
    for(int i = 1 ; i <= 2 * N ; i++)
        psh[i] = -1 ;
}
void update(int l, int r, int l1, int r1, int num, int v)
{
    push(l, r, v) ;
    if(l > r1 || r < l1)
        return ;
    if(l1 <= l && r <= r1)
    {
        psh[v] = num ;
        push(l, r, v) ;
        return ;
    }
    int mid = (l + r) >> 1 ;
    update(l, mid, l1, r1, num, v * 2) ;
    update(mid + 1, r, l1, r1, num, v * 2 + 1) ;
    sum[v] = sum[v * 2] + sum[v * 2 + 1] ;
}
//конец hld
void dfs(int city, int last)
{
    ind[city] = tree.size() ;
    tree.push_back({dist[city], city}) ;
    p[city] = last ;
    for(int i : v[city])
    {
        if(i == last)
            continue ;
        dist[i] = dist[city] + 1 ;
        dfs(i, city) ;
        tree.push_back({dist[city], city}) ;
    }
}
void build_lca()
{
    for(int i = 2 ; i <= tree.size() ; i++)
        pw[i] = pw[i / 2] + 1 ;
    for(int i = 0 ; i < tree.size() ; i++)
        mn[i][0] = tree[i] ;
    for(int i = 1 ; i < 20 ; i++)
        for(int j = 0 ; j <= (int)tree.size() - (1 << i) ; j++)
            mn[j][i] = min(mn[j][i - 1], mn[j + (1 << (i - 1))][i - 1]) ;
}
int get_lca(int a, int b)
{
    a = ind[a] ;
    b = ind[b] ;
    if(a > b)
        swap(a, b) ;
    int num = pw[b - a + 1] ;
    return min(mn[a][num], mn[b - (1 << num) + 1][num]).se ;
}
void build_mx_mn()
{
    for(int i = 2 ; i <= m ; i++)
        pw[i] = pw[i / 2] + 1 ;
    for(int i = 1 ; i <= m ; i++)
        mn1[i][0] = c[i], mx[i][0] = c[i] ;
    for(int i = 1 ; i < 20 ; i++)
        for(int j = 1 ; j <= m - (1 << i) + 1 ; j++)
            mn1[j][i] = min(mn1[j][i - 1], mn1[j + (1 << (i - 1))][i - 1]),
            mx[j][i] = max(mx[j][i - 1], mx[j + (1 << (i - 1))][i - 1]) ;
}
pair<int, int> get_mn_mx(int a, int b)
{
    int num = pw[b - a + 1] ;
    return {min(mn1[a][num], mn1[b - (1 << num) + 1][num]), max(mx[a][num], mx[b - (1 << num) + 1][num])} ;
}
signed main()
{
    ios_base::sync_with_stdio( 0 ) ;
    cin.tie( 0 ) ;
    cout.tie( 0 ) ;
    cin >> n >> m >> q ;
    for(int i = 1 ; i < n ; i++)
    {
        int a, b ;
        cin >> a >> b ;
        if(a != i || b != i + 1)flag1 = 1 ;
        v[a].push_back(b) ;
        v[b].push_back(a) ;
    }
    for(int i = 1 ; i <= m ; i++)
        cin >> c[i] ;
    for(int i = 1 ; i <= q ; i++)
        cin >> l[i] >> r[i] ;
    for(int i = 1 ; i < q ; i++)
        if(r[i] + 1 != l[i + 1])
            flag2 = 1 ;
    if(!flag2)
    {
        dfs(1, 0) ;
        build_lca() ;
        first_dfs(1, 0) ;
        second_dfs(1, 0, 0) ;
        build() ;
        for(int i = 1 ; i <= q ; i++)
        {
            int lc = c[l[i]] ;
            for(int j = l[i] + 1 ; j <= r[i] ; j++)
                lc = get_lca(lc, c[j]) ;
            for(int j = l[i] ; j <= r[i] ; j++)
            {
                int now = c[j] ;
                while(now != p[lc])
                    if(index1[lc] < tp[now])
                    {
//                        cout<<now<<' '<<tp[now] << ' '<<index1[now] << '\n' ;
                        update(0, N - 1, tp[now], index1[now], 1, 1) ;
                        now = p[hld[tp[now]]] ;
                    }
                    else
                    {
//                        cout<<now<<' '<<index1[lc] << ' '<<index1[now] << '\n' ;
                        update(0, N - 1, index1[lc], index1[now], 1, 1) ;
                        now = p[lc] ;
                    }
            }
            cout << sum[1] << '\n' ;
            psh[1] = 0 ;
        }
        return 0 ;
    }
    if(!flag1)
    {
        build_mx_mn() ;
        for(int i = 1 ; i <= q ; i++)
        {
            pair<int, int> p = get_mn_mx(l[i], r[i]) ;
            cout << p.se - p.fi + 1 << '\n' ;
        }
        return 0 ;
    }
    if(n <= 2000 && m <= 2000 && q <= 2000)
    {
        us[0] = 1 ;
        dfs(1, 0) ;
        build_lca() ;
        for(int i = 1 ; i <= q ; i++)
        {
            int ans = 0, lc = c[l[i]] ;
            for(int j = l[i] + 1 ; j <= r[i] ; j++)
                lc = get_lca(lc, c[j]) ;
            for(int j = l[i] ; j <= r[i] ; j++)
            {
                int now = c[j] ;
                while(!us[now])
                {
                    ans++ ;
                    us[now] = 1 ;
                    if(now == lc)
                        break ;
                    now = p[now] ;
                }
            }
            for(int i = 1 ; i <= n ; i++)
                us[i] = 0 ;
            cout << ans << '\n' ;
        }
        return 0 ;
    }
    return 0 ;
}
//4 2 1
//1 2
//1 3
//1 4
//3 4
//1 2

Compilation message

tourism.cpp: In function 'void build_lca()':
tourism.cpp:97:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |     for(int i = 2 ; i <= tree.size() ; i++)
      |                     ~~^~~~~~~~~~~~~~
tourism.cpp:99:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for(int i = 0 ; i < tree.size() ; i++)
      |                     ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 1 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3540 KB Output is correct
9 Correct 2 ms 3576 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 3 ms 3540 KB Output is correct
13 Correct 3 ms 3564 KB Output is correct
14 Correct 3 ms 3540 KB Output is correct
15 Correct 3 ms 3540 KB Output is correct
16 Correct 2 ms 3540 KB Output is correct
17 Correct 2 ms 3540 KB Output is correct
18 Correct 2 ms 3540 KB Output is correct
19 Correct 2 ms 3540 KB Output is correct
20 Correct 3 ms 3540 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 3 ms 3540 KB Output is correct
23 Correct 2 ms 3540 KB Output is correct
24 Correct 2 ms 3540 KB Output is correct
25 Correct 2 ms 3540 KB Output is correct
26 Correct 2 ms 3540 KB Output is correct
27 Correct 2 ms 3412 KB Output is correct
28 Correct 2 ms 3540 KB Output is correct
29 Correct 2 ms 3540 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 1 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3540 KB Output is correct
9 Correct 2 ms 3576 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 3 ms 3540 KB Output is correct
13 Correct 3 ms 3564 KB Output is correct
14 Correct 3 ms 3540 KB Output is correct
15 Correct 3 ms 3540 KB Output is correct
16 Correct 2 ms 3540 KB Output is correct
17 Correct 2 ms 3540 KB Output is correct
18 Correct 2 ms 3540 KB Output is correct
19 Correct 2 ms 3540 KB Output is correct
20 Correct 3 ms 3540 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 3 ms 3540 KB Output is correct
23 Correct 2 ms 3540 KB Output is correct
24 Correct 2 ms 3540 KB Output is correct
25 Correct 2 ms 3540 KB Output is correct
26 Correct 2 ms 3540 KB Output is correct
27 Correct 2 ms 3412 KB Output is correct
28 Correct 2 ms 3540 KB Output is correct
29 Correct 2 ms 3540 KB Output is correct
30 Correct 14 ms 4068 KB Output is correct
31 Correct 20 ms 4060 KB Output is correct
32 Correct 30 ms 4264 KB Output is correct
33 Correct 29 ms 4180 KB Output is correct
34 Correct 32 ms 4268 KB Output is correct
35 Correct 55 ms 4260 KB Output is correct
36 Correct 48 ms 4180 KB Output is correct
37 Correct 48 ms 4280 KB Output is correct
38 Correct 27 ms 4408 KB Output is correct
39 Correct 30 ms 4416 KB Output is correct
40 Correct 26 ms 4436 KB Output is correct
41 Correct 53 ms 4436 KB Output is correct
42 Correct 57 ms 4564 KB Output is correct
43 Correct 63 ms 4388 KB Output is correct
44 Correct 28 ms 4308 KB Output is correct
45 Correct 28 ms 4316 KB Output is correct
46 Correct 26 ms 4360 KB Output is correct
47 Correct 51 ms 4328 KB Output is correct
48 Correct 51 ms 4308 KB Output is correct
49 Correct 50 ms 4308 KB Output is correct
50 Correct 26 ms 4180 KB Output is correct
51 Correct 26 ms 4180 KB Output is correct
52 Correct 26 ms 4180 KB Output is correct
53 Correct 25 ms 4284 KB Output is correct
54 Correct 25 ms 4180 KB Output is correct
55 Correct 26 ms 4292 KB Output is correct
56 Correct 2 ms 3796 KB Output is correct
57 Correct 2 ms 4180 KB Output is correct
58 Correct 3 ms 4180 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3412 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Correct 50 ms 20684 KB Output is correct
5 Correct 39 ms 16056 KB Output is correct
6 Correct 56 ms 20564 KB Output is correct
7 Correct 64 ms 24364 KB Output is correct
8 Correct 64 ms 24324 KB Output is correct
9 Correct 61 ms 24292 KB Output is correct
10 Correct 62 ms 24432 KB Output is correct
11 Correct 69 ms 24396 KB Output is correct
12 Correct 56 ms 24392 KB Output is correct
13 Correct 54 ms 24324 KB Output is correct
14 Correct 56 ms 24308 KB Output is correct
15 Correct 35 ms 7536 KB Output is correct
16 Correct 59 ms 23920 KB Output is correct
17 Correct 42 ms 20844 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 108 ms 27296 KB Output is correct
3 Correct 150 ms 29292 KB Output is correct
4 Correct 152 ms 32812 KB Output is correct
5 Correct 200 ms 46216 KB Output is correct
6 Correct 198 ms 46232 KB Output is correct
7 Correct 207 ms 46240 KB Output is correct
8 Correct 211 ms 46184 KB Output is correct
9 Correct 203 ms 46128 KB Output is correct
10 Correct 218 ms 46144 KB Output is correct
11 Correct 218 ms 46256 KB Output is correct
12 Correct 230 ms 46268 KB Output is correct
13 Correct 209 ms 46352 KB Output is correct
14 Correct 215 ms 46520 KB Output is correct
15 Correct 133 ms 47192 KB Output is correct
16 Correct 199 ms 46256 KB Output is correct
17 Correct 212 ms 46252 KB Output is correct
18 Correct 208 ms 46436 KB Output is correct
19 Correct 174 ms 46228 KB Output is correct
20 Correct 178 ms 46208 KB Output is correct
21 Correct 211 ms 46248 KB Output is correct
22 Correct 175 ms 46216 KB Output is correct
23 Correct 187 ms 46204 KB Output is correct
24 Correct 186 ms 46228 KB Output is correct
25 Correct 173 ms 46224 KB Output is correct
26 Correct 189 ms 46248 KB Output is correct
27 Correct 182 ms 46272 KB Output is correct
28 Correct 192 ms 46280 KB Output is correct
29 Correct 189 ms 46320 KB Output is correct
30 Correct 195 ms 46332 KB Output is correct
31 Correct 191 ms 46404 KB Output is correct
32 Correct 200 ms 46524 KB Output is correct
33 Correct 206 ms 46800 KB Output is correct
34 Correct 119 ms 47332 KB Output is correct

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3796 KB Output is correct
4 Incorrect 31 ms 6236 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4436 KB Output is correct
2 Correct 1 ms 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 2 ms 3412 KB Output is correct
8 Correct 2 ms 3540 KB Output is correct
9 Correct 2 ms 3576 KB Output is correct
10 Correct 2 ms 3540 KB Output is correct
11 Correct 2 ms 3540 KB Output is correct
12 Correct 3 ms 3540 KB Output is correct
13 Correct 3 ms 3564 KB Output is correct
14 Correct 3 ms 3540 KB Output is correct
15 Correct 3 ms 3540 KB Output is correct
16 Correct 2 ms 3540 KB Output is correct
17 Correct 2 ms 3540 KB Output is correct
18 Correct 2 ms 3540 KB Output is correct
19 Correct 2 ms 3540 KB Output is correct
20 Correct 3 ms 3540 KB Output is correct
21 Correct 2 ms 3540 KB Output is correct
22 Correct 3 ms 3540 KB Output is correct
23 Correct 2 ms 3540 KB Output is correct
24 Correct 2 ms 3540 KB Output is correct
25 Correct 2 ms 3540 KB Output is correct
26 Correct 2 ms 3540 KB Output is correct
27 Correct 2 ms 3412 KB Output is correct
28 Correct 2 ms 3540 KB Output is correct
29 Correct 2 ms 3540 KB Output is correct
30 Correct 14 ms 4068 KB Output is correct
31 Correct 20 ms 4060 KB Output is correct
32 Correct 30 ms 4264 KB Output is correct
33 Correct 29 ms 4180 KB Output is correct
34 Correct 32 ms 4268 KB Output is correct
35 Correct 55 ms 4260 KB Output is correct
36 Correct 48 ms 4180 KB Output is correct
37 Correct 48 ms 4280 KB Output is correct
38 Correct 27 ms 4408 KB Output is correct
39 Correct 30 ms 4416 KB Output is correct
40 Correct 26 ms 4436 KB Output is correct
41 Correct 53 ms 4436 KB Output is correct
42 Correct 57 ms 4564 KB Output is correct
43 Correct 63 ms 4388 KB Output is correct
44 Correct 28 ms 4308 KB Output is correct
45 Correct 28 ms 4316 KB Output is correct
46 Correct 26 ms 4360 KB Output is correct
47 Correct 51 ms 4328 KB Output is correct
48 Correct 51 ms 4308 KB Output is correct
49 Correct 50 ms 4308 KB Output is correct
50 Correct 26 ms 4180 KB Output is correct
51 Correct 26 ms 4180 KB Output is correct
52 Correct 26 ms 4180 KB Output is correct
53 Correct 25 ms 4284 KB Output is correct
54 Correct 25 ms 4180 KB Output is correct
55 Correct 26 ms 4292 KB Output is correct
56 Correct 2 ms 3796 KB Output is correct
57 Correct 2 ms 4180 KB Output is correct
58 Correct 3 ms 4180 KB Output is correct
59 Correct 1 ms 3412 KB Output is correct
60 Correct 2 ms 3412 KB Output is correct
61 Correct 2 ms 3796 KB Output is correct
62 Correct 50 ms 20684 KB Output is correct
63 Correct 39 ms 16056 KB Output is correct
64 Correct 56 ms 20564 KB Output is correct
65 Correct 64 ms 24364 KB Output is correct
66 Correct 64 ms 24324 KB Output is correct
67 Correct 61 ms 24292 KB Output is correct
68 Correct 62 ms 24432 KB Output is correct
69 Correct 69 ms 24396 KB Output is correct
70 Correct 56 ms 24392 KB Output is correct
71 Correct 54 ms 24324 KB Output is correct
72 Correct 56 ms 24308 KB Output is correct
73 Correct 35 ms 7536 KB Output is correct
74 Correct 59 ms 23920 KB Output is correct
75 Correct 42 ms 20844 KB Output is correct
76 Correct 2 ms 4436 KB Output is correct
77 Correct 108 ms 27296 KB Output is correct
78 Correct 150 ms 29292 KB Output is correct
79 Correct 152 ms 32812 KB Output is correct
80 Correct 200 ms 46216 KB Output is correct
81 Correct 198 ms 46232 KB Output is correct
82 Correct 207 ms 46240 KB Output is correct
83 Correct 211 ms 46184 KB Output is correct
84 Correct 203 ms 46128 KB Output is correct
85 Correct 218 ms 46144 KB Output is correct
86 Correct 218 ms 46256 KB Output is correct
87 Correct 230 ms 46268 KB Output is correct
88 Correct 209 ms 46352 KB Output is correct
89 Correct 215 ms 46520 KB Output is correct
90 Correct 133 ms 47192 KB Output is correct
91 Correct 199 ms 46256 KB Output is correct
92 Correct 212 ms 46252 KB Output is correct
93 Correct 208 ms 46436 KB Output is correct
94 Correct 174 ms 46228 KB Output is correct
95 Correct 178 ms 46208 KB Output is correct
96 Correct 211 ms 46248 KB Output is correct
97 Correct 175 ms 46216 KB Output is correct
98 Correct 187 ms 46204 KB Output is correct
99 Correct 186 ms 46228 KB Output is correct
100 Correct 173 ms 46224 KB Output is correct
101 Correct 189 ms 46248 KB Output is correct
102 Correct 182 ms 46272 KB Output is correct
103 Correct 192 ms 46280 KB Output is correct
104 Correct 189 ms 46320 KB Output is correct
105 Correct 195 ms 46332 KB Output is correct
106 Correct 191 ms 46404 KB Output is correct
107 Correct 200 ms 46524 KB Output is correct
108 Correct 206 ms 46800 KB Output is correct
109 Correct 119 ms 47332 KB Output is correct
110 Correct 2 ms 4436 KB Output is correct
111 Correct 2 ms 3412 KB Output is correct
112 Correct 2 ms 3796 KB Output is correct
113 Incorrect 31 ms 6236 KB Output isn't correct
114 Halted 0 ms 0 KB -