oj.uz

답안 #933963

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
933963 2024-02-26T15:39:05 Z boris_mihov Tourism (JOI23_tourism) C++17
17 / 100
 5000 ms 40796 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <stack>
#include <cmath>

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

typedef long long llong;
const int MAXN = 100000 + 10;
const int MAXLOG = 18;
const int INF  = 1e9;

int n, m, q;
int in[MAXN];
int out[MAXN];
int globalCost;
bool isInC[MAXN];
std::vector <int> notInC;
std::vector <int> inTimes;
int cnt[2 * MAXN];
int c[MAXN];

struct LinkedList
{
    struct Sparse
    {
        int sparse[MAXLOG][2 * MAXN];
        std::vector <int> tour;
        int getLog[2 * MAXN];
        int depth[MAXN];

        int cmp(int x, int y)
        {
            if (depth[x] < depth[y]) return x;
            else return y;
        }

        void build(std::vector <int> _tour, int dep[])
        {
            tour = _tour;
            for (int i = 1 ; i <= n ; ++i)
            {
                depth[i] = dep[i];
            }

            for (int i = 1 ; i < tour.size() ; ++i)
            {
                sparse[0][i] = tour[i];
            }

            for (int lg = 1 ; (1 << lg) <= tour.size() ; ++lg)
            {
                for (int i = 1 ; i + (1 << lg) - 1 < tour.size() ; ++i)
                {
                    sparse[lg][i] = cmp(sparse[lg - 1][i], sparse[lg - 1][i + (1 << lg - 1)]);
                }
            }

            for (int i = 1 ; i <= tour.size() ; ++i)
            {
                getLog[i] = getLog[i - 1];
                if ((1 << getLog[i] + 1) < i) getLog[i]++;
            }
        }

        int findLCA(int l, int r)
        {
            int lg = getLog[r - l + 1];
            return cmp(sparse[lg][l], sparse[lg][r - (1 << lg) + 1]);
        }

        int findDist(int u, int v)
        {
            if (in[u] > in[v])
            {
                std::swap(u, v);
            }

            return depth[u] + depth[v] - 2 * depth[findLCA(in[u], in[v])];
        }
    };

    struct RollElementCnt
    {
        int idx;
        int time;
        int value;
    };

    
    struct RollElement
    {
        int idx;
        int value;
    };

    int answer;
    int prev[2 * MAXN];
    int next[2 * MAXN];
    std::stack <RollElement> stNext;
    std::stack <RollElement> stPrev;
    std::stack <RollElementCnt> stCnt;
    std::stack <int> stAnswer;
    std::stack <int> stTime;
    std::vector <int> tour;
    Sparse sparse;
    int timer;

    void build(std::vector <int> _tour, int depth[])
    {
        tour = _tour;
        sparse.build(tour, depth);
    }

    void rebuild()
    {
        while (stNext.size())
        {
            stNext.pop();
        }

        while (stPrev.size())
        {
            stPrev.pop();
        }

        while (stCnt.size())
        {
            stCnt.pop();
        }

        while (stAnswer.size())
        {
            stAnswer.pop();
        }

        while (stTime.size())
        {
            stTime.pop();
        }

        int ptr = 0;
        for (int i = 0 ; i <= tour.size() ; ++i)
        {
            while (inTimes[ptr] <= i)
            {
                ptr++;
            }

            next[i] = inTimes[ptr];
        }

        ptr = inTimes.size() - 1;
        for (int i = tour.size() ; i >= 0 ; --i)
        {
            while (inTimes[ptr] >= i)
            {
                ptr--;
            }

            prev[i] = inTimes[ptr];
        }

        std::fill(cnt, cnt + 1 + 2 * n, 0);
        for (int i = 1 ; i <= m ; ++i)
        {
            cnt[in[c[i]]]++;
        }

        answer = 2 * n - 2 - sparse.findDist(tour[next[0]], tour[prev[tour.size()]]);
        timer = 0;

        for (const int &i : notInC)
        {
            remove(in[i]);
        }

    }

    void roll(int to)
    {
        while (stCnt.top().time > to)
        {
            cnt[stCnt.top().idx] = stCnt.top().value;
            stCnt.pop();
        }

        while (stTime.size() && stTime.top() > to)
        {
            next[stNext.top().idx] = stNext.top().value;
            prev[stPrev.top().idx] = stPrev.top().value;
            answer = stAnswer.top();
            stNext.pop();
            stTime.pop();
            stPrev.pop();
            stAnswer.pop();
        }
    }

    void remove(int idx)
    {
        timer++;
        stCnt.push({idx, timer, cnt[idx]});
        cnt[idx]--;

        if (cnt[idx] > 0)
        {
            return;
        }

        int l = prev[idx];
        int r = next[idx];
        stTime.push(timer);
        stAnswer.push(answer);
        stNext.push({l, next[l]});
        stPrev.push({r, prev[r]});

        if (l > 0) answer -= sparse.findDist(tour[l], tour[idx]);
        if (r < tour.size()) answer -= sparse.findDist(tour[idx], tour[r]);
        if (l > 0 && r < tour.size()) answer += sparse.findDist(tour[l], tour[r]);
        next[l] = r;
        prev[r] = l;
        getAnswer();
    }

    int getAnswer()
    {
        int res = answer;
        res += sparse.findDist(tour[next[0]], tour[prev[tour.size()]]);
        assert(res % 2 == 0);
        return res / 2 + 1;
    }
};

int bucketSize;
LinkedList list;
struct Query
{
    int l, r;
    int idx;

    friend bool operator < (const Query &a, const Query &b)
    {
        if (a.l / bucketSize != b.l / bucketSize) return a.l < b.l;
        return a.r > b.r;
    }
};

int depth[MAXN];
int answer[MAXN];
std::vector <int> tour;
std::vector <int> g[MAXN];
Query query[MAXN];

void buildDFS(int node, int par)
{
    depth[node] = depth[par] + 1;
    in[node] = tour.size();
    tour.push_back(node);

    for (const int &u : g[node])
    {
        if (u == par)
        {
            continue;
        }

        buildDFS(u, node);
        tour.push_back(node);
    }
    
    out[node] = tour.size();
}

void solve()
{
    bucketSize = 3 * sqrt(m) + 1;
    tour.push_back(0);
    buildDFS(1, 0);

    for (int i = 1 ; i <= n ; ++i)
    {
        inTimes.push_back(in[i]);
    }

    inTimes.push_back(-1);
    inTimes.push_back(0);
    inTimes.push_back(tour.size());
    inTimes.push_back(tour.size() + 1);
    std::sort(inTimes.begin(), inTimes.end());
    for (int i = 1 ; i <= m ; ++i)
    {
        isInC[c[i]] = true;
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        if (!isInC[i])
        {
            notInC.push_back(i);
        }
    }

    list.build(tour, depth);

    int lPtr = 1;
    int rPtr = m;
    int lastBucket = -1;
    std::sort(query + 1, query + 1 + q);
    for (int i = 1 ; i <= q ; ++i)
    {
        int qL = query[i].l;
        int qR = query[i].r;

        if (qL / bucketSize != lastBucket)
        {
            lPtr = 1;
            rPtr = m;
            list.rebuild();
            lastBucket = qL / bucketSize;
            while (lPtr / bucketSize != lastBucket)
            {
                list.remove(in[c[lPtr]]);
                lPtr++;
            }
        }

        while (rPtr > qR)
        {
            list.remove(in[c[rPtr]]);
            rPtr--;
        }

        int rollTo = list.timer;
        int beforeL = lPtr;

        while (lPtr < qL)
        {
            list.remove(in[c[lPtr]]);
            lPtr++;
        }

        answer[query[i].idx] = list.getAnswer();
        lPtr = beforeL;
        list.getAnswer();
        list.roll(rollTo);
        list.getAnswer();
    }
}

void input()
{
    std::cin >> n >> m >> q;
    for (int i = 1 ; i < n ; ++i)
    {
        int u, v;
        std::cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }

    for (int i = 1 ; i <= m ; ++i)
    {
        std::cin >> c[i];
    }

    for (int i = 1 ; i <= q ; ++i)
    {
        std::cin >> query[i].l >> query[i].r;
        query[i].idx = i;
    }
}

void print()
{
    for (int i = 1 ; i <= q ; ++i)
    {
        std::cout << answer[i] << '\n';
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();
    print();
    
    return 0;
}

Compilation message

tourism.cpp: In member function 'void LinkedList::Sparse::build(std::vector<int>, int*)':
tourism.cpp:50:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |             for (int i = 1 ; i < tour.size() ; ++i)
      |                              ~~^~~~~~~~~~~~~
tourism.cpp:55:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |             for (int lg = 1 ; (1 << lg) <= tour.size() ; ++lg)
      |                               ~~~~~~~~~~^~~~~~~~~~~~~~
tourism.cpp:57:52: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |                 for (int i = 1 ; i + (1 << lg) - 1 < tour.size() ; ++i)
      |                                  ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
tourism.cpp:59:88: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   59 |                     sparse[lg][i] = cmp(sparse[lg - 1][i], sparse[lg - 1][i + (1 << lg - 1)]);
      |                                                                                     ~~~^~~
tourism.cpp:63:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |             for (int i = 1 ; i <= tour.size() ; ++i)
      |                              ~~^~~~~~~~~~~~~~
tourism.cpp:66:37: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   66 |                 if ((1 << getLog[i] + 1) < i) getLog[i]++;
      |                           ~~~~~~~~~~^~~
tourism.cpp: In member function 'void LinkedList::rebuild()':
tourism.cpp:147:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |         for (int i = 0 ; i <= tour.size() ; ++i)
      |                          ~~^~~~~~~~~~~~~~
tourism.cpp: In member function 'void LinkedList::remove(int)':
tourism.cpp:223:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  223 |         if (r < tour.size()) answer -= sparse.findDist(tour[idx], tour[r]);
      |             ~~^~~~~~~~~~~~~
tourism.cpp:224:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  224 |         if (l > 0 && r < tour.size()) answer += sparse.findDist(tour[l], tour[r]);
      |                      ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 3 ms 16728 KB Output is correct
5 Correct 3 ms 16732 KB Output is correct
6 Correct 2 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 18776 KB Output is correct
9 Correct 3 ms 19032 KB Output is correct
10 Correct 3 ms 18964 KB Output is correct
11 Correct 3 ms 18780 KB Output is correct
12 Correct 3 ms 18864 KB Output is correct
13 Correct 3 ms 18776 KB Output is correct
14 Correct 3 ms 18776 KB Output is correct
15 Correct 4 ms 18932 KB Output is correct
16 Correct 4 ms 18776 KB Output is correct
17 Correct 3 ms 18780 KB Output is correct
18 Correct 3 ms 18960 KB Output is correct
19 Correct 4 ms 18780 KB Output is correct
20 Correct 3 ms 18776 KB Output is correct
21 Correct 3 ms 18780 KB Output is correct
22 Correct 3 ms 18780 KB Output is correct
23 Correct 3 ms 18780 KB Output is correct
24 Correct 3 ms 19032 KB Output is correct
25 Correct 4 ms 18788 KB Output is correct
26 Correct 3 ms 18780 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 3 ms 18780 KB Output is correct
29 Correct 5 ms 18780 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 3 ms 16728 KB Output is correct
5 Correct 3 ms 16732 KB Output is correct
6 Correct 2 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 18776 KB Output is correct
9 Correct 3 ms 19032 KB Output is correct
10 Correct 3 ms 18964 KB Output is correct
11 Correct 3 ms 18780 KB Output is correct
12 Correct 3 ms 18864 KB Output is correct
13 Correct 3 ms 18776 KB Output is correct
14 Correct 3 ms 18776 KB Output is correct
15 Correct 4 ms 18932 KB Output is correct
16 Correct 4 ms 18776 KB Output is correct
17 Correct 3 ms 18780 KB Output is correct
18 Correct 3 ms 18960 KB Output is correct
19 Correct 4 ms 18780 KB Output is correct
20 Correct 3 ms 18776 KB Output is correct
21 Correct 3 ms 18780 KB Output is correct
22 Correct 3 ms 18780 KB Output is correct
23 Correct 3 ms 18780 KB Output is correct
24 Correct 3 ms 19032 KB Output is correct
25 Correct 4 ms 18788 KB Output is correct
26 Correct 3 ms 18780 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 3 ms 18780 KB Output is correct
29 Correct 5 ms 18780 KB Output is correct
30 Correct 7 ms 19032 KB Output is correct
31 Correct 9 ms 19036 KB Output is correct
32 Correct 11 ms 19036 KB Output is correct
33 Correct 16 ms 19124 KB Output is correct
34 Correct 11 ms 19036 KB Output is correct
35 Correct 5 ms 19036 KB Output is correct
36 Correct 7 ms 19036 KB Output is correct
37 Correct 5 ms 19116 KB Output is correct
38 Correct 11 ms 19036 KB Output is correct
39 Correct 11 ms 19036 KB Output is correct
40 Correct 15 ms 19284 KB Output is correct
41 Correct 6 ms 19036 KB Output is correct
42 Correct 5 ms 19036 KB Output is correct
43 Correct 6 ms 19036 KB Output is correct
44 Correct 10 ms 19032 KB Output is correct
45 Correct 12 ms 19036 KB Output is correct
46 Correct 11 ms 19036 KB Output is correct
47 Correct 6 ms 19036 KB Output is correct
48 Correct 5 ms 19032 KB Output is correct
49 Correct 5 ms 19036 KB Output is correct
50 Correct 10 ms 19032 KB Output is correct
51 Correct 11 ms 19032 KB Output is correct
52 Correct 11 ms 19036 KB Output is correct
53 Correct 11 ms 19188 KB Output is correct
54 Correct 11 ms 19036 KB Output is correct
55 Correct 11 ms 19036 KB Output is correct
56 Correct 4 ms 10588 KB Output is correct
57 Correct 5 ms 19036 KB Output is correct
58 Correct 13 ms 19036 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12776 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 4 ms 10588 KB Output is correct
4 Correct 2174 ms 33380 KB Output is correct
5 Correct 1826 ms 37344 KB Output is correct
6 Correct 2157 ms 39072 KB Output is correct
7 Correct 3779 ms 40796 KB Output is correct
8 Correct 3955 ms 40792 KB Output is correct
9 Correct 3712 ms 40796 KB Output is correct
10 Correct 3558 ms 40796 KB Output is correct
11 Correct 3969 ms 40792 KB Output is correct
12 Correct 334 ms 37904 KB Output is correct
13 Correct 335 ms 37956 KB Output is correct
14 Correct 338 ms 37944 KB Output is correct
15 Correct 77 ms 40028 KB Output is correct
16 Correct 4646 ms 40200 KB Output is correct
17 Correct 631 ms 12052 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 582 ms 29008 KB Output is correct
3 Correct 834 ms 29740 KB Output is correct
4 Correct 804 ms 30332 KB Output is correct
5 Correct 61 ms 31480 KB Output is correct
6 Correct 84 ms 32688 KB Output is correct
7 Correct 168 ms 33440 KB Output is correct
8 Correct 422 ms 33756 KB Output is correct
9 Correct 1354 ms 33852 KB Output is correct
10 Correct 1500 ms 33700 KB Output is correct
11 Correct 1496 ms 33960 KB Output is correct
12 Correct 1625 ms 34292 KB Output is correct
13 Correct 1959 ms 34008 KB Output is correct
14 Correct 2845 ms 34168 KB Output is correct
15 Execution timed out 5023 ms 33992 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 10584 KB Output is correct
3 Correct 4 ms 10584 KB Output is correct
4 Correct 2912 ms 30020 KB Output is correct
5 Correct 2718 ms 30228 KB Output is correct
6 Correct 3653 ms 33124 KB Output is correct
7 Correct 4885 ms 34540 KB Output is correct
8 Correct 4800 ms 34536 KB Output is correct
9 Correct 4858 ms 36336 KB Output is correct
10 Execution timed out 5007 ms 35912 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 12632 KB Output is correct
2 Correct 2 ms 12632 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 3 ms 16728 KB Output is correct
5 Correct 3 ms 16732 KB Output is correct
6 Correct 2 ms 16732 KB Output is correct
7 Correct 3 ms 16732 KB Output is correct
8 Correct 3 ms 18776 KB Output is correct
9 Correct 3 ms 19032 KB Output is correct
10 Correct 3 ms 18964 KB Output is correct
11 Correct 3 ms 18780 KB Output is correct
12 Correct 3 ms 18864 KB Output is correct
13 Correct 3 ms 18776 KB Output is correct
14 Correct 3 ms 18776 KB Output is correct
15 Correct 4 ms 18932 KB Output is correct
16 Correct 4 ms 18776 KB Output is correct
17 Correct 3 ms 18780 KB Output is correct
18 Correct 3 ms 18960 KB Output is correct
19 Correct 4 ms 18780 KB Output is correct
20 Correct 3 ms 18776 KB Output is correct
21 Correct 3 ms 18780 KB Output is correct
22 Correct 3 ms 18780 KB Output is correct
23 Correct 3 ms 18780 KB Output is correct
24 Correct 3 ms 19032 KB Output is correct
25 Correct 4 ms 18788 KB Output is correct
26 Correct 3 ms 18780 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 3 ms 18780 KB Output is correct
29 Correct 5 ms 18780 KB Output is correct
30 Correct 7 ms 19032 KB Output is correct
31 Correct 9 ms 19036 KB Output is correct
32 Correct 11 ms 19036 KB Output is correct
33 Correct 16 ms 19124 KB Output is correct
34 Correct 11 ms 19036 KB Output is correct
35 Correct 5 ms 19036 KB Output is correct
36 Correct 7 ms 19036 KB Output is correct
37 Correct 5 ms 19116 KB Output is correct
38 Correct 11 ms 19036 KB Output is correct
39 Correct 11 ms 19036 KB Output is correct
40 Correct 15 ms 19284 KB Output is correct
41 Correct 6 ms 19036 KB Output is correct
42 Correct 5 ms 19036 KB Output is correct
43 Correct 6 ms 19036 KB Output is correct
44 Correct 10 ms 19032 KB Output is correct
45 Correct 12 ms 19036 KB Output is correct
46 Correct 11 ms 19036 KB Output is correct
47 Correct 6 ms 19036 KB Output is correct
48 Correct 5 ms 19032 KB Output is correct
49 Correct 5 ms 19036 KB Output is correct
50 Correct 10 ms 19032 KB Output is correct
51 Correct 11 ms 19032 KB Output is correct
52 Correct 11 ms 19036 KB Output is correct
53 Correct 11 ms 19188 KB Output is correct
54 Correct 11 ms 19036 KB Output is correct
55 Correct 11 ms 19036 KB Output is correct
56 Correct 4 ms 10588 KB Output is correct
57 Correct 5 ms 19036 KB Output is correct
58 Correct 13 ms 19036 KB Output is correct
59 Correct 2 ms 12776 KB Output is correct
60 Correct 2 ms 10588 KB Output is correct
61 Correct 4 ms 10588 KB Output is correct
62 Correct 2174 ms 33380 KB Output is correct
63 Correct 1826 ms 37344 KB Output is correct
64 Correct 2157 ms 39072 KB Output is correct
65 Correct 3779 ms 40796 KB Output is correct
66 Correct 3955 ms 40792 KB Output is correct
67 Correct 3712 ms 40796 KB Output is correct
68 Correct 3558 ms 40796 KB Output is correct
69 Correct 3969 ms 40792 KB Output is correct
70 Correct 334 ms 37904 KB Output is correct
71 Correct 335 ms 37956 KB Output is correct
72 Correct 338 ms 37944 KB Output is correct
73 Correct 77 ms 40028 KB Output is correct
74 Correct 4646 ms 40200 KB Output is correct
75 Correct 631 ms 12052 KB Output is correct
76 Correct 2 ms 12636 KB Output is correct
77 Correct 582 ms 29008 KB Output is correct
78 Correct 834 ms 29740 KB Output is correct
79 Correct 804 ms 30332 KB Output is correct
80 Correct 61 ms 31480 KB Output is correct
81 Correct 84 ms 32688 KB Output is correct
82 Correct 168 ms 33440 KB Output is correct
83 Correct 422 ms 33756 KB Output is correct
84 Correct 1354 ms 33852 KB Output is correct
85 Correct 1500 ms 33700 KB Output is correct
86 Correct 1496 ms 33960 KB Output is correct
87 Correct 1625 ms 34292 KB Output is correct
88 Correct 1959 ms 34008 KB Output is correct
89 Correct 2845 ms 34168 KB Output is correct
90 Execution timed out 5023 ms 33992 KB Time limit exceeded
91 Halted 0 ms 0 KB -