Submission #425257

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
425257	2021-06-12 17:38:47	Osama_Alkhodairy	Event Hopping 2 (JOI21_event2)	C++17	0 / 100	240 ms	27024 KiB

event2

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 finish(x) return cout << x << endl, 0
#define ll long long
const int N = 100001;
const int K = 20;
const int INF = (int)1e9;
int n, k, nxt[N][K];
pair <int, int> tree[4 * N];
vector <pair <int, int> > a;
void update(int idx){
    int p = a[idx].first + 2 * n;
    tree[p] = min(tree[p], make_pair(a[idx].second, idx));
    for(; p > 1 ; p >>= 1){
        tree[p >> 1] = min(tree[p], tree[p ^ 1]);
    }
}
pair <int, int> query(int l, int r){
    r++;
    auto ret = make_pair(INF, INF);
    for(l += 2 * n, r += 2 * n ; l < r ; l >>= 1, r >>= 1){
        if(l & 1) ret = min(ret, tree[l++]);
        if(r & 1) ret = min(ret, tree[--r]);
    }
    return ret;
}
int calc(int l, int r){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 7
• Subtask 2: 0 / 1
• Subtask 3: 0 / 31
• Subtask 4: 0 / 61