Submission #860040

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
860040	2023-10-11 12:52:42	Alfraganus	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	Compilation error	0 ms	0 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 <iostream>
#include <vector>
using namespace std;
struct tree_type{
    int s;
    vector<pair<int, int> >arr;
};
vector<tree_type> tree;
vector<int> a;
const int inf = INT_MAX;
void build(int v, int l, int r){
    if(l == r){
        tree[v].s = -1;
        tree[v].arr.push_back({a[l-1], l});
    }
    else{
        int m = (l + r) >> 1;
        build(v<<1, l, m);
        build(v<<1|1, m+1, r);
        tree[v] = tree[v<<1];
        tree[v].s = max(tree[v].s, tree[v<<1|1].s);
        
        int mx = inf;
        
        int i = 0;
        while(i < tree[v<<1|1].arr.size() && tree[v<<1|1].arr[i] < tree[v].arr.back())
            mx = tree[v<<1|1].arr[i ++].first;
        
        if(mx != inf)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

sortbooks.cpp:11:17: error: 'INT_MAX' was not declared in this scope
   11 | const int inf = INT_MAX;
      |                 ^~~~~~~
sortbooks.cpp:3:1: note: 'INT_MAX' is defined in header '<climits>'; did you forget to '#include <climits>'?
    2 | #include <vector>
  +++ |+#include <climits>
    3 | using namespace std;
sortbooks.cpp: In function 'void build(int, int, int)':
sortbooks.cpp:27:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         while(i < tree[v<<1|1].arr.size() && tree[v<<1|1].arr[i] < tree[v].arr.back())
      |               ~~^~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:32:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |         while(i < tree[v<<1|1].arr.size())
      |               ~~^~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp: In function 'int get(int, int, int, int, int, int)':
sortbooks.cpp:48:23: error: 'upper_bound' was not declared in this scope
   48 |             auto id = upper_bound(tree[v<<1|1].arr.begin(), tree[v<<1|1].arr.end(), make_pair(k - left, inf));
      |                       ^~~~~~~~~~~
sortbooks.cpp: In function 'int main()':
sortbooks.cpp:66:17: warning: unused variable 'x' [-Wunused-variable]
   66 |             int x = get(1,1,n,l,r,k);
      |                 ^