oj.uz

Submission #793628

# Submission time Handle Problem Language Result Execution time Memory
793628 2023-07-26T04:49:57 Z vjudge1 Tourism (JOI23_tourism) C++14
17 / 100
 70 ms 26536 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std ;
const int N = 1e5, NS = 2000 ;
bool flag1 ;
bool us[NS + 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] ;
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] ;
    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 ;
            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 ;
}

Compilation message

tourism.cpp: In function 'void build_lca()':
tourism.cpp:30: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]
   30 |     for(int i = 2 ; i <= tree.size() ; i++)
      |                     ~~^~~~~~~~~~~~~~
tourism.cpp:32: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]
   32 |     for(int i = 0 ; i < tree.size() ; i++)
      |                     ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 1 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 3 ms 2772 KB Output is correct
16 Correct 2 ms 2772 KB Output is correct
17 Correct 2 ms 2772 KB Output is correct
18 Correct 3 ms 2772 KB Output is correct
19 Correct 2 ms 2772 KB Output is correct
20 Correct 2 ms 2772 KB Output is correct
21 Correct 2 ms 2848 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 2 ms 2772 KB Output is correct
24 Correct 2 ms 2772 KB Output is correct
25 Correct 2 ms 2772 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 1 ms 2772 KB Output is correct
28 Correct 1 ms 2772 KB Output is correct
29 Correct 1 ms 2772 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 1 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 3 ms 2772 KB Output is correct
16 Correct 2 ms 2772 KB Output is correct
17 Correct 2 ms 2772 KB Output is correct
18 Correct 3 ms 2772 KB Output is correct
19 Correct 2 ms 2772 KB Output is correct
20 Correct 2 ms 2772 KB Output is correct
21 Correct 2 ms 2848 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 2 ms 2772 KB Output is correct
24 Correct 2 ms 2772 KB Output is correct
25 Correct 2 ms 2772 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 1 ms 2772 KB Output is correct
28 Correct 1 ms 2772 KB Output is correct
29 Correct 1 ms 2772 KB Output is correct
30 Correct 14 ms 3284 KB Output is correct
31 Correct 19 ms 3284 KB Output is correct
32 Correct 29 ms 3532 KB Output is correct
33 Correct 30 ms 3540 KB Output is correct
34 Correct 29 ms 3536 KB Output is correct
35 Correct 49 ms 3528 KB Output is correct
36 Correct 49 ms 3516 KB Output is correct
37 Correct 49 ms 3528 KB Output is correct
38 Correct 27 ms 3660 KB Output is correct
39 Correct 30 ms 3668 KB Output is correct
40 Correct 30 ms 3680 KB Output is correct
41 Correct 54 ms 3668 KB Output is correct
42 Correct 53 ms 3704 KB Output is correct
43 Correct 63 ms 3540 KB Output is correct
44 Correct 28 ms 3540 KB Output is correct
45 Correct 28 ms 3580 KB Output is correct
46 Correct 26 ms 3604 KB Output is correct
47 Correct 54 ms 3580 KB Output is correct
48 Correct 57 ms 3540 KB Output is correct
49 Correct 54 ms 3588 KB Output is correct
50 Correct 25 ms 3540 KB Output is correct
51 Correct 26 ms 3540 KB Output is correct
52 Correct 26 ms 3540 KB Output is correct
53 Correct 25 ms 3548 KB Output is correct
54 Correct 25 ms 3544 KB Output is correct
55 Correct 25 ms 3540 KB Output is correct
56 Correct 2 ms 3028 KB Output is correct
57 Correct 2 ms 3412 KB Output is correct
58 Correct 2 ms 3540 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2772 KB Output is correct
3 Correct 2 ms 3028 KB Output is correct
4 Correct 54 ms 20012 KB Output is correct
5 Correct 50 ms 17396 KB Output is correct
6 Correct 47 ms 21896 KB Output is correct
7 Correct 68 ms 26496 KB Output is correct
8 Correct 70 ms 26440 KB Output is correct
9 Correct 67 ms 26432 KB Output is correct
10 Correct 64 ms 26536 KB Output is correct
11 Correct 64 ms 26440 KB Output is correct
12 Correct 56 ms 26192 KB Output is correct
13 Correct 69 ms 26188 KB Output is correct
14 Correct 54 ms 26188 KB Output is correct
15 Correct 31 ms 8324 KB Output is correct
16 Correct 60 ms 26048 KB Output is correct
17 Correct 42 ms 21388 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Incorrect 15 ms 4692 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 2 ms 3052 KB Output is correct
4 Incorrect 26 ms 5512 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2772 KB Output is correct
5 Correct 2 ms 2772 KB Output is correct
6 Correct 2 ms 2772 KB Output is correct
7 Correct 2 ms 2772 KB Output is correct
8 Correct 1 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 3 ms 2772 KB Output is correct
16 Correct 2 ms 2772 KB Output is correct
17 Correct 2 ms 2772 KB Output is correct
18 Correct 3 ms 2772 KB Output is correct
19 Correct 2 ms 2772 KB Output is correct
20 Correct 2 ms 2772 KB Output is correct
21 Correct 2 ms 2848 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 2 ms 2772 KB Output is correct
24 Correct 2 ms 2772 KB Output is correct
25 Correct 2 ms 2772 KB Output is correct
26 Correct 2 ms 2772 KB Output is correct
27 Correct 1 ms 2772 KB Output is correct
28 Correct 1 ms 2772 KB Output is correct
29 Correct 1 ms 2772 KB Output is correct
30 Correct 14 ms 3284 KB Output is correct
31 Correct 19 ms 3284 KB Output is correct
32 Correct 29 ms 3532 KB Output is correct
33 Correct 30 ms 3540 KB Output is correct
34 Correct 29 ms 3536 KB Output is correct
35 Correct 49 ms 3528 KB Output is correct
36 Correct 49 ms 3516 KB Output is correct
37 Correct 49 ms 3528 KB Output is correct
38 Correct 27 ms 3660 KB Output is correct
39 Correct 30 ms 3668 KB Output is correct
40 Correct 30 ms 3680 KB Output is correct
41 Correct 54 ms 3668 KB Output is correct
42 Correct 53 ms 3704 KB Output is correct
43 Correct 63 ms 3540 KB Output is correct
44 Correct 28 ms 3540 KB Output is correct
45 Correct 28 ms 3580 KB Output is correct
46 Correct 26 ms 3604 KB Output is correct
47 Correct 54 ms 3580 KB Output is correct
48 Correct 57 ms 3540 KB Output is correct
49 Correct 54 ms 3588 KB Output is correct
50 Correct 25 ms 3540 KB Output is correct
51 Correct 26 ms 3540 KB Output is correct
52 Correct 26 ms 3540 KB Output is correct
53 Correct 25 ms 3548 KB Output is correct
54 Correct 25 ms 3544 KB Output is correct
55 Correct 25 ms 3540 KB Output is correct
56 Correct 2 ms 3028 KB Output is correct
57 Correct 2 ms 3412 KB Output is correct
58 Correct 2 ms 3540 KB Output is correct
59 Correct 1 ms 2644 KB Output is correct
60 Correct 1 ms 2772 KB Output is correct
61 Correct 2 ms 3028 KB Output is correct
62 Correct 54 ms 20012 KB Output is correct
63 Correct 50 ms 17396 KB Output is correct
64 Correct 47 ms 21896 KB Output is correct
65 Correct 68 ms 26496 KB Output is correct
66 Correct 70 ms 26440 KB Output is correct
67 Correct 67 ms 26432 KB Output is correct
68 Correct 64 ms 26536 KB Output is correct
69 Correct 64 ms 26440 KB Output is correct
70 Correct 56 ms 26192 KB Output is correct
71 Correct 69 ms 26188 KB Output is correct
72 Correct 54 ms 26188 KB Output is correct
73 Correct 31 ms 8324 KB Output is correct
74 Correct 60 ms 26048 KB Output is correct
75 Correct 42 ms 21388 KB Output is correct
76 Correct 2 ms 2644 KB Output is correct
77 Incorrect 15 ms 4692 KB Output isn't correct
78 Halted 0 ms 0 KB -