Submission #168161

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
168161	2019-12-11 17:13:44	AlexPop28	Triple Jump (JOI19_jumps)	C++11	100 / 100	1531 ms	101088 KiB

jumps

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 dbg() cerr <<
#define name(x) (#x) << ": " << (x) << ' ' <<
// dupa 7 ore printre care 3 de somn in care ma tot gandeam de ce luasem
// RTE, am ajuns la concluzia ca e din cauza stupizeniei de windows...
 
using namespace std;
 
struct SegmTree {
  struct Node {
    int maxv, val, lazy;
    Node(int maxv_ = 0, int val_ = 0, int lazy_ = 0) :
      maxv(maxv_), val(val_), lazy(lazy_) {}
    // maxv = val max on [l, r] in v
    // val = maximum val of jumps in [l, r]
    // lazy = max val to update children with
  };
  int n;
  vector<int> v;
  vector<Node> tree;
  SegmTree(const vector<int> v_) : n(v_.size()), v(v_), tree(4 * n) {
    Build(0, 0, n - 1);
  }
  void Recalc(int node) {
    tree[node].val = max(tree[2 * node + 1].val, tree[2 * node + 2].val);
  }
  void Build(int node, int left, int right) {
    if (left == right) {
      tree[node].maxv = v[left];
      tree[node].val = v[left];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 14 / 14
• Subtask 3: 27 / 27
• Subtask 4: 54 / 54