제출 #892895

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
892895	2023-12-26 06:38:44	Trisanu_Das	Catfish Farm (IOI22_fish)	C++17	100 / 100	250 ms	25224 KiB

fish

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 "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
vector<pair<int, int> > fishes[100005];
 
struct SegmentTree{
    ll tree[1 << 18];
    void init() {
        memset(tree, 0xcf, sizeof(tree));
    }
    void upd(int idx, int s, int e, int l, int r, ll val) {
        if (e < l || r < s) return;
        if (l <= s && e <= r) {
            tree[idx] = max(tree[idx], val);
            return;
        }
        int mid = (s + e) / 2;
        upd(2 * idx, s, mid, l, r, val);
        upd(2 * idx + 1, mid + 1, e, l, r, val);
    }
    ll qry(int idx, int s, int e, int x) {
        if (s == e) return tree[idx];
        int mid = (s + e) / 2;
        if (x <= mid) return max(tree[idx], qry(2 * idx, s, mid, x));
        return max(tree[idx], qry(2 * idx + 1, mid + 1, e, x));
    }
} st_up, st_down;
 
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 6 / 6
• Subtask 3: 9 / 9
• Subtask 4: 14 / 14
• Subtask 5: 21 / 21
• Subtask 6: 17 / 17
• Subtask 7: 14 / 14
• Subtask 8: 16 / 16