Submission #484119

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
484119	2021-11-02 06:24:10	ponytail	Exhibition (JOI19_ho_t2)	C++17	100 / 100	173 ms	9740 KiB

joi2019_ho_t2

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 MAXN = 1e5 + 10;
pair<int, int> a[4*MAXN];
void update(int l, int r, int tar, int idx, int val) {
    if(l == r) {
        a[idx] = {val, tar};
        return;
    }
    int mid = (l+r) / 2;
    if(tar <= mid) update(l, mid, tar, 2*idx+1, val);
    else update(mid+1, r, tar, 2*idx+2, val);
    a[idx] = max(a[2*idx+1], a[2*idx+2]);
}
pair<int, int> query(int l, int r, int constl, int constr, int idx) {
    if(l <= constl && constr <= r) return a[idx];
    int mid = (constl + constr) / 2;
    if(mid < l || r < constl) return query(l, r, mid+1, constr, 2*idx+2);
    else if(constr < l || r < mid+1) return query(l, r, constl, mid, 2*idx+1);
    else return max(query(l, r, constl, mid, 2*idx+1), query(l, r, mid+1, constr, 2*idx+2));
}
signed main() {
    int N, M; cin >> N >> M;
    pair<int, int> p[N+1]; for(int i=1; i<=N; i++) cin >> p[i].first >> p[i].second;
    int c[M+1]; for(int i=1; i<=M; i++) cin >> c[i];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 50 / 50