Submission #1175407

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1175407	2025-03-28 13:52:43	12345678	Event Hopping (BOI22_events)	C++20	20 / 100	211 ms	97212 KiB

events

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;
const int nx=1e5+5, kx=17, inf=1e9;
struct segtree
{
    struct node
    {
        pair<int, int> mn;
        node *l, *r;
        node(pair<int, int> mn=make_pair(2e9, 0)): mn(mn), l(0), r(0) {}
    };
    typedef node* pnode;
    pnode rt;
    void update(int l, int r, pnode &k, int idx, pair<int, int> vl)
    {
        if (!k) k=new node();
        if (idx<l||r<idx) return;
        //cout<<"debug "<<l<<' '<<r<<'\n';
        if (l==r) return k->mn=min(k->mn, vl), void();
        int md=(l+r)/2;
        update(l, md, k->l, idx, vl);
        update(md+1, r, k->r, idx, vl);
        k->mn=min(k->l->mn, k->r->mn);
    }
    pair<int, int> query(int l, int r, pnode k, int ql, int qr)
    {
        if (qr<l||r<ql||!k) return {2e9, 0};
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 20 / 20
• Subtask 6: 0 / 30