Submission #417927

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
417927	2021-06-04 14:42:00	aymanrs	Rainforest Jumps (APIO21_jumps)	C++14	21 / 100	2876 ms	1048580 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>
using namespace std;
struct node {
  int l, r, v = 1e9, i, lz = 0;
  node *le = nullptr, *ri = nullptr, *c;
};
vector<node*> versions;
void prop(node* n){
  if(n->l == n->r) goto gh;
  if(n->le->i != n->i){
    prop(n->le);
    prop(n->c->le);
    n->le = new node(*n->le);
    n->le->i = n->i;
    n->le->c = n->c->le;
    n->le->v = min(n->le->v, n->le->c->v);
  }
  if(n->ri->i != n->i){
    prop(n->ri);
    prop(n->c->ri);
    n->ri = new node(*n->ri);
    n->ri->i = n->i;
    n->ri->c = n->c->ri;
    n->ri->v = min(n->ri->v, n->ri->c->v);
  }
  gh:
  if(n->lz){
    n->v += n->lz;
    if(n->l != n->r){
      n->le->lz += n->lz;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 4
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19