Submission #984809

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
984809	2024-05-17 05:54:08	vjudge2	Fish 3 (JOI24_fish3)	C++17	100 / 100	606 ms	65260 KiB

Main

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 INF = 1e18;
struct node {
    int sum, sz, mx;
};
struct segtree {
    int size = 1;
    vector<node> seg;
    vector<int> lazy;
    void init(int n) {
        while (size < n) size *= 2;
        seg.assign(2 * size + 1, (node) {0, 0, 0});
        lazy.assign(2 * size + 1, -1);
    }
    void pull(int id) {
        seg[id].sum = seg[id * 2].sum + seg[id * 2 + 1].sum;
        seg[id].sz = seg[id * 2].sz + seg[id * 2 + 1].sz;
        seg[id].mx = max(seg[id * 2].mx, seg[id * 2 + 1].mx);
    }
    void build(int l, int r, int id) {
        if (l == r) {
            seg[id].sz = 1;
            return;
        }
        int mid = (l + r) / 2;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 7 / 7
• Subtask 3: 28 / 28
• Subtask 4: 20 / 20
• Subtask 5: 36 / 36