Submission #467882

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
467882	2021-08-25 11:23:02	warner1129	Magic Tree (CEOI19_magictree)	C++17	100 / 100	207 ms	45868 KiB

magictree

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>
#define ff first
#define ss second
using namespace std;
struct segment_tree {
  static const int maxn = 2e6 + 5;
  int ls[maxn] = {}, rs[maxn] = {};
  long long ma[maxn] = {}, tag[maxn] = {};
  int buf = 0;
  inline void updata(int p, long long v) { ma[p] += v, tag[p] += v; }
  inline void pull(int p) { ma[p] = max(ma[ls[p]], ma[rs[p]]); }
  inline void push(int p) {
    if (!tag[p] || !p) return;
    if (ls[p]) updata(ls[p], tag[p]);
    if (rs[p]) updata(rs[p], tag[p]);
    tag[p] = 0;
  }
  void add(int &p, int l, int r, int pos, long long val, long long m) {
    if (!p) p = ++buf;
    if (l == r) { ma[p] = val + max(m, ma[p]); return; }
    push(p);
    int mid = (l + r) >> 1;
    if (pos <= mid) add(ls[p], l, mid, pos, val, m);  
    else add(rs[p], mid+1, r, pos, val, max(m, ma[ls[p]]));
    pull(p);
  }
  void Merge(int &a, const int &b, int l, int r, long long am, long long bm) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 6 / 6
• Subtask 2: 3 / 3
• Subtask 3: 11 / 11
• Subtask 4: 12 / 12
• Subtask 5: 16 / 16
• Subtask 6: 13 / 13
• Subtask 7: 22 / 22
• Subtask 8: 17 / 17