oj.uz

답안 #930303

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930303 2024-02-19T10:26:33 Z boris_mihov Worst Reporter 4 (JOI21_worst_reporter4) C++17
79 / 100
 1980 ms 149488 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <set>

typedef long long llong;
const int MAXN = 200000 + 10;
const llong INF = 1e18;
const int INTINF = 1e9;

int n;
struct SegmentTree
{
    struct Node
    {
        llong max;
        llong lazyAdd;
        llong lazySet;

        Node()
        {
            max = 0;
            lazyAdd = 0;
            lazySet = -1;
        }

        friend Node operator + (const Node &left, const Node &right)
        {
            Node res;
            res.max = std::max(left.max, right.max);
            return res;
        }
    };

    Node tree[4*MAXN];
    void mergeLazys(Node &to, Node from)
    {
        if (from.lazySet != -1)
        {
            to.lazySet = from.lazySet;
            to.lazyAdd = 0;
            return;
        }

        if (to.lazySet != -1)
        {
            to.lazySet += from.lazyAdd;
        } else
        {
            to.lazyAdd += from.lazyAdd;
        }
    }

    void push(int node, int l, int r)
    {
        if (tree[node].lazyAdd == 0 && tree[node].lazySet == -1)
        {
            return;
        }

        assert(tree[node].lazyAdd == 0 || tree[node].lazySet == -1);
        if (tree[node].lazyAdd == 0)
        {
            tree[node].max = tree[node].lazySet;
        } else
        {
            tree[node].max += tree[node].lazyAdd;
        }

        if (l < r)
        {
            mergeLazys(tree[2*node], tree[node]);
            mergeLazys(tree[2*node + 1], tree[node]);
        }

        tree[node].lazyAdd = 0;
        tree[node].lazySet = -1;
    }

    void addUpdate(int l, int r, int node, int queryL, int queryR, llong queryVal)
    {
        push(node, l, r);
        if (queryR < l || r < queryL)
        {
            return;
        }

        if (queryL <= l && r <= queryR)
        {
            tree[node].lazyAdd = queryVal;
            push(node, l, r);
            return;
        }

        int mid = (l + r) / 2;
        addUpdate(l, mid, 2*node, queryL, queryR, queryVal);
        addUpdate(mid + 1, r, 2*node + 1, queryL, queryR, queryVal);
        tree[node] = tree[2*node] + tree[2*node + 1];
    }

    void setUpdate(int l, int r, int node, int queryL, int queryR, llong queryVal)
    {
        push(node, l, r);
        if (queryR < l || r < queryL)
        {
            return;
        }

        if (queryL <= l && r <= queryR)
        {
            tree[node].lazySet = queryVal;
            push(node, l, r);
            return;
        }

        int mid = (l + r) / 2;
        setUpdate(l, mid, 2*node, queryL, queryR, queryVal);
        setUpdate(mid + 1, r, 2*node + 1, queryL, queryR, queryVal);
        tree[node] = tree[2*node] + tree[2*node + 1];
    }

    llong pointQuery(int l, int r, int node, int queryPos)
    {
        push(node, l, r);
        if (l == r)
        {
            return tree[node].max;
        }

        int mid = (l + r) / 2;
        if (queryPos <= mid) return pointQuery(l, mid, 2*node, queryPos);
        else return pointQuery(mid + 1, r, 2*node + 1, queryPos);
    }

    int query(int l, int r, int node, int queryL, int queryR, llong queryVal)
    {
        push(node, l, r);
        if (queryR < l || r < queryL || tree[node].max <= queryVal)
        {
            return n + 1;
        }

        if (l == r)
        {
            return l;
        }

        int mid = (l + r) / 2;
        int res = query(l, mid, 2*node, queryL, queryR, queryVal);
        if (res != n + 1) return res;
        return query(mid + 1, r, 2*node + 1, queryL, queryR, queryVal);
    }

    // void resetUpdate(int pos)
    // {
    //     update(1, n, 1, pos);
    // }

    void reset()
    {
        setUpdate(1, n + 1, 1, 1, n + 1, 0);
    }

    void addUpdate(int l, int r, llong val)
    {
        addUpdate(1, n + 1, 1, l, r, val);
    }

    void setUpdate(int l, int r, llong val)
    {
        setUpdate(1, n + 1, 1, l, r, val);
    } 

    llong pointQuery(int pos)
    {
        return pointQuery(1, n + 1, 1, pos);
    }

    int query(int l, int r, llong val)
    {
        return query(1, n + 1, 1, l, r, val);
    }
};


int h[MAXN];
int c[MAXN];
int sz[MAXN];
int perm[MAXN];
SegmentTree tree;
std::vector <int> g[MAXN];
std::set <int> vals[MAXN];
std::vector <llong> dp[MAXN];

void buildDFS(int node)
{
    sz[node] = 1;
    for (const int &u : g[node])
    {
        buildDFS(u);
        sz[node] += sz[u];
    }

    for (int i = 1 ; i < g[node].size() ; ++i)
    {
        if (sz[g[node][i]] > sz[g[node][0]])
        {
            std::swap(g[node][i], g[node][0]);
        }
    }
}

void solveDFS(int node)
{
    if (g[node].empty())
    {
        vals[node].insert(n + 1);
        vals[node].insert(h[node]);
        tree.addUpdate(h[node] + 1, n + 1, c[node]);

        // std::cout << "dp vals: " << node << ":\n";
        // for (const int &val : vals[node])
        // {
        //     std::cout << val << " = " << tree.pointQuery(val) << '\n';
        // }

        return;
    }

    llong res = 0;
    for (int i = 1 ; i < g[node].size() ; ++i)
    {
        int u = g[node][i];
        solveDFS(u);
        dp[u].reserve(vals[u].size());
        for (const int &val : vals[u])
        {
            dp[u].push_back(tree.pointQuery(val));
        }

        auto it = vals[u].lower_bound(h[node]);
        res += tree.pointQuery(*it);
        // std::cout << "add: " << first << ' ' << dp[u][0] << ' ' << " from " << u << '\n';
        tree.reset();
    }

    solveDFS(g[node][0]);
    vals[node] = std::move(vals[g[node][0]]);

    auto it = vals[node].lower_bound(h[node]);
    res += tree.pointQuery(*it);

    for (int i = 1 ; i < g[node].size() ; ++i)
    {
        int u = g[node][i];
        for (const int &newVal : vals[u])
        {
            tree.setUpdate(newVal, newVal, tree.pointQuery(*vals[node].lower_bound(newVal)));
        }
    }

    for (int i = 1 ; i < g[node].size() ; ++i)
    {
        int u = g[node][i];
        assert(vals[u].size());
        int first = *vals[u].begin();
        tree.addUpdate(1, first, dp[u][0]);
        auto it = std::next(vals[u].begin());
        for (int idx = 1 ; it != vals[u].end() ; ++idx, ++it)
        {
            tree.addUpdate(*std::prev(it) + 1, *it, dp[u][idx]);
        }

        for (const int &val : vals[u])
        {
            vals[node].insert(val);
        }
    }

    tree.addUpdate(1, n + 1, c[node]);
    int firstPos = tree.query(1, h[node], res);
    if (firstPos != n + 1)
    {
        // std::cout << "first pos is: " << firstPos << ' ' << tree.pointQuery(firstPos) << '\n';
        assert(firstPos <= h[node]);
        tree.setUpdate(firstPos, h[node], res);
    }

    vals[node].insert(h[node]);
    // std::cout << "res is: " << res << '\n';
    // std::cout << "dp vals: " << node << ":\n";
    // for (const int &val : vals[node])
    // {
    //     std::cout << val << " = " << tree.pointQuery(val) << '\n';
    // }
}

void solve()
{
    std::iota(perm + 1, perm + 1 + n, 1);
    std::sort(perm + 1, perm + 1 + n, [&](int x, int y)
    {
        return h[x] < h[y];
    });

    int cnt = 0;
    int last = 0;

    for (int i = 1 ; i <= n ; ++i)
    {
        cnt += (h[perm[i]] > last);
        last = h[perm[i]];
        h[perm[i]] = cnt;
    }

    buildDFS(1);
    solveDFS(1);
    std::cout << tree.pointQuery(1) << '\n';
}

void input()
{
    std::cin >> n;
    for (int i = 1 ; i <= n ; ++i)
    {
        int par;
        std::cin >> par >> h[i] >> c[i];
        if (i != 1) g[par].push_back(i);
    }
}

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

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

Compilation message

worst_reporter2.cpp: In function 'void buildDFS(int)':
worst_reporter2.cpp:209:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  209 |     for (int i = 1 ; i < g[node].size() ; ++i)
      |                      ~~^~~~~~~~~~~~~~~~
worst_reporter2.cpp: In function 'void solveDFS(int)':
worst_reporter2.cpp:236:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  236 |     for (int i = 1 ; i < g[node].size() ; ++i)
      |                      ~~^~~~~~~~~~~~~~~~
worst_reporter2.cpp:258:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  258 |     for (int i = 1 ; i < g[node].size() ; ++i)
      |                      ~~^~~~~~~~~~~~~~~~
worst_reporter2.cpp:267:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  267 |     for (int i = 1 ; i < g[node].size() ; ++i)
      |                      ~~^~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 39408 KB Output is correct
2 Correct 7 ms 39372 KB Output is correct
3 Correct 8 ms 39412 KB Output is correct
4 Correct 7 ms 39516 KB Output is correct
5 Correct 26 ms 40764 KB Output is correct
6 Correct 19 ms 40540 KB Output is correct
7 Correct 15 ms 40284 KB Output is correct
8 Correct 27 ms 41044 KB Output is correct
9 Correct 19 ms 40540 KB Output is correct
10 Correct 15 ms 40284 KB Output is correct
11 Correct 12 ms 40028 KB Output is correct
12 Correct 14 ms 41308 KB Output is correct
13 Correct 11 ms 41048 KB Output is correct
14 Correct 15 ms 40796 KB Output is correct
15 Correct 11 ms 40536 KB Output is correct
16 Correct 33 ms 41556 KB Output is correct
17 Correct 23 ms 40792 KB Output is correct
18 Correct 12 ms 40028 KB Output is correct
19 Correct 16 ms 40796 KB Output is correct
20 Correct 14 ms 40796 KB Output is correct
21 Correct 13 ms 40652 KB Output is correct
22 Correct 16 ms 40540 KB Output is correct
23 Correct 14 ms 40284 KB Output is correct
24 Correct 15 ms 41052 KB Output is correct
25 Correct 13 ms 40796 KB Output is correct
26 Correct 12 ms 41412 KB Output is correct
27 Correct 16 ms 41048 KB Output is correct
28 Correct 15 ms 41056 KB Output is correct
29 Correct 15 ms 41056 KB Output is correct
30 Correct 13 ms 40792 KB Output is correct
31 Correct 14 ms 40908 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 39408 KB Output is correct
2 Correct 7 ms 39372 KB Output is correct
3 Correct 8 ms 39412 KB Output is correct
4 Correct 7 ms 39516 KB Output is correct
5 Correct 26 ms 40764 KB Output is correct
6 Correct 19 ms 40540 KB Output is correct
7 Correct 15 ms 40284 KB Output is correct
8 Correct 27 ms 41044 KB Output is correct
9 Correct 19 ms 40540 KB Output is correct
10 Correct 15 ms 40284 KB Output is correct
11 Correct 12 ms 40028 KB Output is correct
12 Correct 14 ms 41308 KB Output is correct
13 Correct 11 ms 41048 KB Output is correct
14 Correct 15 ms 40796 KB Output is correct
15 Correct 11 ms 40536 KB Output is correct
16 Correct 33 ms 41556 KB Output is correct
17 Correct 23 ms 40792 KB Output is correct
18 Correct 12 ms 40028 KB Output is correct
19 Correct 16 ms 40796 KB Output is correct
20 Correct 14 ms 40796 KB Output is correct
21 Correct 13 ms 40652 KB Output is correct
22 Correct 16 ms 40540 KB Output is correct
23 Correct 14 ms 40284 KB Output is correct
24 Correct 15 ms 41052 KB Output is correct
25 Correct 13 ms 40796 KB Output is correct
26 Correct 12 ms 41412 KB Output is correct
27 Correct 16 ms 41048 KB Output is correct
28 Correct 15 ms 41056 KB Output is correct
29 Correct 15 ms 41056 KB Output is correct
30 Correct 13 ms 40792 KB Output is correct
31 Correct 14 ms 40908 KB Output is correct
32 Correct 26 ms 40888 KB Output is correct
33 Correct 1457 ms 113944 KB Output is correct
34 Correct 845 ms 86620 KB Output is correct
35 Correct 1411 ms 110620 KB Output is correct
36 Correct 851 ms 87056 KB Output is correct
37 Correct 403 ms 66180 KB Output is correct
38 Correct 341 ms 61612 KB Output is correct
39 Correct 447 ms 111996 KB Output is correct
40 Correct 241 ms 102484 KB Output is correct
41 Correct 185 ms 102488 KB Output is correct
42 Correct 533 ms 92276 KB Output is correct
43 Correct 239 ms 77620 KB Output is correct
44 Correct 1980 ms 149488 KB Output is correct
45 Correct 1092 ms 106068 KB Output is correct
46 Correct 280 ms 61824 KB Output is correct
47 Correct 529 ms 96552 KB Output is correct
48 Correct 349 ms 87120 KB Output is correct
49 Correct 298 ms 86884 KB Output is correct
50 Correct 546 ms 80584 KB Output is correct
51 Correct 402 ms 71120 KB Output is correct
52 Correct 482 ms 96920 KB Output is correct
53 Correct 317 ms 87380 KB Output is correct
54 Correct 241 ms 112244 KB Output is correct
55 Correct 568 ms 95564 KB Output is correct
56 Correct 446 ms 103316 KB Output is correct
57 Correct 375 ms 106320 KB Output is correct
58 Correct 344 ms 91924 KB Output is correct
59 Correct 340 ms 91732 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 39408 KB Output is correct
2 Correct 7 ms 39372 KB Output is correct
3 Correct 8 ms 39412 KB Output is correct
4 Correct 7 ms 39516 KB Output is correct
5 Correct 26 ms 40764 KB Output is correct
6 Correct 19 ms 40540 KB Output is correct
7 Correct 15 ms 40284 KB Output is correct
8 Correct 27 ms 41044 KB Output is correct
9 Correct 19 ms 40540 KB Output is correct
10 Correct 15 ms 40284 KB Output is correct
11 Correct 12 ms 40028 KB Output is correct
12 Correct 14 ms 41308 KB Output is correct
13 Correct 11 ms 41048 KB Output is correct
14 Correct 15 ms 40796 KB Output is correct
15 Correct 11 ms 40536 KB Output is correct
16 Correct 33 ms 41556 KB Output is correct
17 Correct 23 ms 40792 KB Output is correct
18 Correct 12 ms 40028 KB Output is correct
19 Correct 16 ms 40796 KB Output is correct
20 Correct 14 ms 40796 KB Output is correct
21 Correct 13 ms 40652 KB Output is correct
22 Correct 16 ms 40540 KB Output is correct
23 Correct 14 ms 40284 KB Output is correct
24 Correct 15 ms 41052 KB Output is correct
25 Correct 13 ms 40796 KB Output is correct
26 Correct 12 ms 41412 KB Output is correct
27 Correct 16 ms 41048 KB Output is correct
28 Correct 15 ms 41056 KB Output is correct
29 Correct 15 ms 41056 KB Output is correct
30 Correct 13 ms 40792 KB Output is correct
31 Correct 14 ms 40908 KB Output is correct
32 Correct 26 ms 40888 KB Output is correct
33 Correct 1457 ms 113944 KB Output is correct
34 Correct 845 ms 86620 KB Output is correct
35 Correct 1411 ms 110620 KB Output is correct
36 Correct 851 ms 87056 KB Output is correct
37 Correct 403 ms 66180 KB Output is correct
38 Correct 341 ms 61612 KB Output is correct
39 Correct 447 ms 111996 KB Output is correct
40 Correct 241 ms 102484 KB Output is correct
41 Correct 185 ms 102488 KB Output is correct
42 Correct 533 ms 92276 KB Output is correct
43 Correct 239 ms 77620 KB Output is correct
44 Correct 1980 ms 149488 KB Output is correct
45 Correct 1092 ms 106068 KB Output is correct
46 Correct 280 ms 61824 KB Output is correct
47 Correct 529 ms 96552 KB Output is correct
48 Correct 349 ms 87120 KB Output is correct
49 Correct 298 ms 86884 KB Output is correct
50 Correct 546 ms 80584 KB Output is correct
51 Correct 402 ms 71120 KB Output is correct
52 Correct 482 ms 96920 KB Output is correct
53 Correct 317 ms 87380 KB Output is correct
54 Correct 241 ms 112244 KB Output is correct
55 Correct 568 ms 95564 KB Output is correct
56 Correct 446 ms 103316 KB Output is correct
57 Correct 375 ms 106320 KB Output is correct
58 Correct 344 ms 91924 KB Output is correct
59 Correct 340 ms 91732 KB Output is correct
60 Correct 7 ms 39516 KB Output is correct
61 Incorrect 7 ms 39512 KB Output isn't correct
62 Halted 0 ms 0 KB -