Submission #1047942

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1047942	2024-08-07 17:59:26	TAhmed33	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++98	64 / 100	600 ms	262144 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
    #include <bits/stdc++.h>
    #define int long long
    using namespace std; 
    int const mxN = 1e6+5;
    int n, pw; 
    vector<int> seg [4*mxN];
    int ans[4*mxN], a[4*mxN];
     
    void build ( int node, int l, int r) {
       if(l==r-1) { seg[node].push_back(a[l]); return; }
       int m = (l+r)/2;
       build(node*2+1, l, m) , build(node*2+2, m, r);
     
       seg[node] = seg[node*2+1];
       int maxi = seg[node].back();
     
       for(auto it:seg[node*2+2]) seg[node].push_back(it);
       sort(seg[node].begin(),seg[node].end());
       
       int ind = lower_bound(seg[node*2+2].begin(), seg[node*2+2].end(), maxi) - seg[node*2+2].begin(); ind--;
       if(ind<0) ans[node] = 0;
       else { ans[node] = seg[node*2+2][ind] + maxi; }
       ans[node] = max ({ans[node], ans[node*2+1], ans[node*2+2]});
    }
     
    int fin = 0, maxi = 0;
     
    void get ( int node, int l_n, int r_n, int l, int r) {
       if(l_n>=r || r_n<=l) return;
       if(l<=l_n && r>=r_n) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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