Submission #1162245

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1162245	2025-03-05 20:52:12	with_wageeh	Monkey and Apple-trees (IZhO12_apple)	C++20	100 / 100	244 ms	69164 KiB

apple

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
// SparseSegtree is designed for very large ranges (for example up to 1e9)
// but only creates nodes for segments that are updated or queried.
// It supports range "set" updates (assigning a given value to every element in a range)
// and range sum queries.
class SparseSegtree {
private:
    // Each node stores:
    //   - freq: the aggregate value (here, the sum of the segment)
    //   - lazy: a lazy propagation marker (nonzero means that the node’s segment
    //           should be updated to that value)
    //   - left, right: indices in the tree vector for the left and right children.
    struct Node {
        int freq = 0;   // sum of the segment
        int lazy = 0;   // lazy marker for range-set updates; 0 means no pending update
        int left = -1;  // index of left child in the tree vector (-1 if not created)
        int right = -1; // index of right child (-1 if not created)
    };
    vector<Node> tree; // the collection of nodes (dynamically allocated as needed)
    const int n;       // size of the overall range [0, n-1]
    int timer = 0;     // used to assign indices for new nodes
    // Combine two segment values.
    // For a sum query, simply add the two values.
    inline int comb(int a, int b) {
        return a + b;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100