Submission #342014

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
342014	2021-01-01 03:24:14	8e7	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	100 / 100	2280 ms	49872 KiB

sortbooks

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
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <map>
#define ll long long
#define ff first
#define ss second
#define maxn 1000005
using namespace std;
struct segtree{
  int seg[4 * maxn];
  void modify(int cur, int l, int r, int ind, int val) {
    if (r <= l) return;
    if (r - l == 1) {
      seg[cur] = max(seg[cur], val);
      //cout << l << " " << r << " " << val << endl;
      return;
    }
    int mid = (l + r) / 2;
    if (ind < mid) modify(cur * 2, l, mid, ind, val);
    else modify(cur * 2 + 1, mid, r, ind, val);
    seg[cur] = max(seg[cur * 2], seg[cur * 2 + 1]);
  }
  int query(int cur, int l, int r, int ql, int qr) {
    if (r <= l || ql >= r || qr <= l) return 0;
    if (ql <= l && qr >= r) return seg[cur];
    int mid = (l + r) / 2;
    return max(query(cur * 2, l, mid, ql, qr), query(cur * 2 + 1, mid, r, ql, qr));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 13 / 13
• Subtask 4: 17 / 17
• Subtask 5: 30 / 30
• Subtask 6: 23 / 23