Submission #389121

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
389121	2021-04-13 16:54:24	couplefire	Food Court (JOI21_foodcourt)	C++17	100 / 100	748 ms	56348 KiB

foodcourt

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 MAXN 262144
#define INF 1000000000000000009ll
struct node{
    long long psum = 0, nsum = 0;
    pair<long long, int> minsum = {0, -1};
    node(){}
};
node tree[2*MAXN];
void build(int v = 1, int tl = 0, int tr = MAXN-1){
    tree[v].minsum.second = tl;
    if(tl == tr) return;
    int tm = (tl+tr)/2;
    build(v*2, tl, tm); build(v*2+1, tm+1, tr);
}
void upd(int id, long long val, int v = 1, int tl = 0, int tr = MAXN-1){
    if(tl > id || tr < id) return;
    if(tl == tr){
        if(val > 0) tree[v].psum = val, tree[v].nsum = 0;
        else tree[v].nsum = -val, tree[v].psum = 0;
        tree[v].minsum.first = val;
        return;
    }
    int tm = (tl+tr)/2;
    upd(id, val, v*2, tl, tm); upd(id, val, v*2+1, tm+1, tr);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 2 / 2
• Subtask 2: 5 / 5
• Subtask 3: 7 / 7
• Subtask 4: 21 / 21
• Subtask 5: 15 / 15
• Subtask 6: 13 / 13
• Subtask 7: 26 / 26
• Subtask 8: 11 / 11