Submission #579965

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
579965	2022-06-20 11:54:02	joelau	Distributing Candies (IOI21_candies)	C++17	100 / 100	1332 ms	61596 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 "candies.h"
#include <bits/stdc++.h>
using namespace std;
tuple<long long,long long,long long> queries[400005];
struct node {
  long long s,e,m,lazy; pair<long long,long long> least,most; node *l, *r;
  node (long long S, long long E) {
    s = S, e = E, m = (s+e)/2, least = make_pair(0,s), most = make_pair(0,s), lazy = 0;
    if (s != e) l = new node(s,m), r = new node(m+1,e);
  }
  void propo() {
    if (lazy == 0) return;
    least.first += lazy, most.first += lazy;
    if (s != e) l->lazy += lazy, r->lazy += lazy;
    lazy = 0;
  }
  void update (long long x, long long y, long long nv) {
    propo();
    if (s == x && e == y) lazy += nv;
    else {
      if (y <= m) l -> update(x,y,nv);
      else if (x > m) r -> update(x,y,nv);
      else l -> update(x,m,nv), r -> update(m+1,y,nv);
      l -> propo(), r -> propo();
      least = min(l->least,r->least), most = max(l->most,r->most);
    }
  }
  pair< pair<long long,long long>, pair<long long,long long> > query (long long x, long long y) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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