Submission #484048

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
484048	2021-11-02 00:30:12	ponytail	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	775 ms	18240 KiB

foehn_phenomena

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;
#define int long long
const int MAXN = 200010;
struct node {
    int upd = 0, ans = 0;
} a[4*MAXN];
void update(int l, int r, int constl, int constr, int idx, int val) {
    if(l<=constl && constr<=r) {
        a[idx].upd += val;
        a[idx].ans += val;
        return;
    }
    int mid = (constl+constr)>>1;
    if(mid<l || r<constl) update(l, r, mid+1, constr, 2*idx+2, val);
    else if(constr<l || r<mid+1) update(l, r, constl, mid, 2*idx+1, val);
    else {
        update(l, r, constl, mid, 2*idx+1, val);
        update(l, r, mid+1, constr, 2*idx+2, val);
    }
    a[idx].ans = a[idx].upd + min(a[2*idx+1].ans, a[2*idx+2].ans);
}
int query(int l, int r, int constl, int constr, int idx) {
    if(l<=constl && constr<=r) return a[idx].ans;
    int mid = (constl+constr)>>1;
    if(mid<l || r<constl) return a[idx].upd + query(l, r, mid+1, constr, 2*idx+2);
    else if(constr<l || r<mid+1) return a[idx].upd + query(l, r, constl, mid, 2*idx+1);
    else {
        return a[idx].upd + min(query(l, r, constl, mid, 2*idx+1), query(l, r, mid+1, constr, 2*idx+2));
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 30 / 30
• Subtask 2: 10 / 10
• Subtask 3: 60 / 60