Submission #653101

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
653101	2022-10-25 17:21:44	someone	Fire (JOI20_ho_t5)	C++14	100 / 100	587 ms	84312 KiB

ho_t5

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>
#define int long long
using namespace std;
struct Query {
    bool isModif;
    int temps, deb, fin, id, modif;
};
const int M = 1 << 18, N = 2 * M, T = 18, INF = 1e18 + 42;
vector<Query> req;
vector<int> getId[M];
int n, q, print[M], pre[M], aft[M], val[M], a[N], b[N], id[M][2];
void update(int i, int upd, int t) {
    i += M;
    a[i] += upd;
    b[i] -= (t-1) * upd;
    while(i) {
        i >>= 1;
        a[i] = (a[i * 2] + a[i * 2 + 1]);
        b[i] = (b[i * 2] + b[i * 2 + 1]);
    }
}
int getSum(int i, int deb, int fin, int l, int r, int t) {
    if(fin <= l || r <= deb)
        return 0;
    if(l <= deb && fin <= r)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1
• Subtask 2: 6 / 6
• Subtask 3: 7 / 7
• Subtask 4: 6 / 6
• Subtask 5: 80 / 80