Submission #597763

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
597763	2022-07-16 20:25:25	idiot123	Distributing Candies (IOI21_candies)	C++17	100 / 100	630 ms	42948 KiB

candies

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>
#include "candies.h"
using namespace std;
const long long INF = 1e18;
class Tree{
  private:
  int lrSize = 2;
  vector<long long> maxVal;
  vector<long long> minVal;
  vector<long long> lazy;
  
  void update(int pos, bool up){
    minVal[pos] = min(minVal[2*pos], minVal[2*pos+1]);
    maxVal[pos] = max(maxVal[2*pos], maxVal[2*pos+1]);
    if(pos > 1 && up)update(pos/2, true);
  }
  
  void push(int pos){
    minVal[2*pos] += lazy[pos];
    maxVal[2*pos] += lazy[pos];
    lazy[2*pos] += lazy[pos];
    minVal[2*pos + 1] += lazy[pos];
    maxVal[2*pos + 1] += lazy[pos];
    lazy[2*pos + 1] += lazy[pos];
    lazy[pos] = 0;
  }
  
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 8 / 8
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29
• Subtask 5: 33 / 33