oj.uz

Submission #536554

# Submission time Handle Problem Language Result Execution time Memory
536554 2022-03-13T14:04:10 Z cig32 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 741 ms 262144 KB 
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 1e6 + 10;
const int MOD = 1e9 + 7;
 
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
 
struct node {
  int ans; // maximum sum inversion in range
  vector<int> v; // SORTED!!! crazy memory moment
} st[3*MAXN];
int n, m;
vector<pair<int, int> > v[MAXN];
void bu(int l, int r, int idx) {
  v[l].push_back({r, idx});
  st[idx].v.resize(r-l+1);
  if(l == r) {
    int w;
    cin >> w;
    st[idx].v[0] = w;
    st[idx].ans = -1;
    return;
  }
  int mid = (l + r) >> 1;
  bu(l, mid, 2*idx + 1);
  bu(mid+1, r, 2*idx + 2);
  int lptr = 0, rptr = 0;
  int nxt = 0;
  while(!(lptr == st[2*idx + 1].v.size() && rptr == st[2*idx + 2].v.size())) {
    if(lptr == st[2*idx+1].v.size()) {
      st[idx].v[nxt] = st[2*idx+2].v[rptr];
      rptr++;
      nxt++;
    }
    else if(rptr == st[2*idx+2].v.size()) {
      st[idx].v[nxt] = st[2*idx+1].v[lptr];
      lptr++;
      nxt++;
    }
    else {
      if(st[2*idx+1].v[lptr] < st[2*idx+2].v[rptr]) {
        st[idx].v[nxt] = st[2*idx+1].v[lptr];
        lptr++;
        nxt++;
      }
      else {
        st[idx].v[nxt] = st[2*idx+2].v[rptr];
        rptr++;
        nxt++;
      }
    }
  }
  st[idx].ans = max(st[2*idx+1].ans, st[2*idx+2].ans);
  int ma = st[2*idx+1].v[st[2*idx+1].v.size() - 1];
  int lb = 0, rb = st[2*idx+2].v.size() - 1;
  while(lb < rb) {
    int mid = (lb + rb + 1) >> 1;
    if(st[2*idx+2].v[mid] < ma) lb = mid;
    else rb = mid - 1;
  }
  if(st[2*idx+2].v[lb] < ma) {
    st[idx].ans = max(st[idx].ans, st[2*idx+2].v[lb] + ma);
  }
}
 
void build() {
  bu(1, n, 0);
}
 
void solve(int tc) {
  cin >> n >> m;
  build();
  for(int i=1; i<=n; i++) {
    sort(v[i].begin(), v[i].end());
  }
  for(int i=0; i<m; i++) {
    int l, r, k;
    cin >> l >> r >> k;
    int ma = -2e9;
    int ans = -2e9;
    while(l <= r) {
      int lb = 0, rb = v[l].size() - 1;
      while(lb < rb) {
        int mid = (lb + rb + 1) >> 1;
        if(v[l][mid].first <= r) lb = mid;
        else rb = mid - 1;
      }
      int idx = v[l][lb].second;
      ans = max(ans, st[idx].ans);
      int lb2 = 0, rb2 = st[idx].v.size() - 1;
      while(lb2 < rb2) {
        int mid = (lb2 + rb2 + 1) >> 1;
        if(st[idx].v[mid] < ma) lb2 = mid;
        else rb2 = mid - 1;
      }
      if(st[idx].v[lb2] < ma) ans = max(ans, ma + st[idx].v[lb2]);
      ma = max(ma, st[idx].v[st[idx].v.size() - 1]);
      l = v[l][lb].first + 1;
    }
    cout << (ans > k ? "0\n" : "1\n");
  }
}
int32_t main(){
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
}

Compilation message

sortbooks.cpp: In function 'void bu(int, int, int)':
sortbooks.cpp:32:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   while(!(lptr == st[2*idx + 1].v.size() && rptr == st[2*idx + 2].v.size())) {
      |           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:32:50: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |   while(!(lptr == st[2*idx + 1].v.size() && rptr == st[2*idx + 2].v.size())) {
      |                                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:33:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     if(lptr == st[2*idx+1].v.size()) {
      |        ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:38:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |     else if(rptr == st[2*idx+2].v.size()) {
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 117716 KB Output is correct
2 Correct 54 ms 117704 KB Output is correct
3 Correct 62 ms 117704 KB Output is correct
4 Correct 59 ms 117728 KB Output is correct
5 Correct 72 ms 117644 KB Output is correct
6 Correct 59 ms 117704 KB Output is correct
7 Correct 62 ms 117744 KB Output is correct
8 Correct 57 ms 117752 KB Output is correct
9 Correct 58 ms 117688 KB Output is correct
10 Correct 58 ms 117812 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 117716 KB Output is correct
2 Correct 54 ms 117704 KB Output is correct
3 Correct 62 ms 117704 KB Output is correct
4 Correct 59 ms 117728 KB Output is correct
5 Correct 72 ms 117644 KB Output is correct
6 Correct 59 ms 117704 KB Output is correct
7 Correct 62 ms 117744 KB Output is correct
8 Correct 57 ms 117752 KB Output is correct
9 Correct 58 ms 117688 KB Output is correct
10 Correct 58 ms 117812 KB Output is correct
11 Correct 60 ms 117872 KB Output is correct
12 Correct 59 ms 118316 KB Output is correct
13 Correct 64 ms 118324 KB Output is correct
14 Correct 68 ms 118384 KB Output is correct
15 Correct 73 ms 118412 KB Output is correct
16 Correct 71 ms 118364 KB Output is correct
17 Correct 65 ms 118184 KB Output is correct
18 Correct 66 ms 118292 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 461 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 366 ms 133352 KB Output is correct
2 Correct 310 ms 133292 KB Output is correct
3 Correct 358 ms 133508 KB Output is correct
4 Correct 332 ms 133344 KB Output is correct
5 Correct 313 ms 133244 KB Output is correct
6 Correct 233 ms 133356 KB Output is correct
7 Correct 245 ms 133236 KB Output is correct
8 Correct 299 ms 133276 KB Output is correct
9 Correct 98 ms 118032 KB Output is correct
10 Correct 263 ms 133344 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 117716 KB Output is correct
2 Correct 54 ms 117704 KB Output is correct
3 Correct 62 ms 117704 KB Output is correct
4 Correct 59 ms 117728 KB Output is correct
5 Correct 72 ms 117644 KB Output is correct
6 Correct 59 ms 117704 KB Output is correct
7 Correct 62 ms 117744 KB Output is correct
8 Correct 57 ms 117752 KB Output is correct
9 Correct 58 ms 117688 KB Output is correct
10 Correct 58 ms 117812 KB Output is correct
11 Correct 60 ms 117872 KB Output is correct
12 Correct 59 ms 118316 KB Output is correct
13 Correct 64 ms 118324 KB Output is correct
14 Correct 68 ms 118384 KB Output is correct
15 Correct 73 ms 118412 KB Output is correct
16 Correct 71 ms 118364 KB Output is correct
17 Correct 65 ms 118184 KB Output is correct
18 Correct 66 ms 118292 KB Output is correct
19 Correct 716 ms 149868 KB Output is correct
20 Correct 694 ms 149852 KB Output is correct
21 Correct 514 ms 149672 KB Output is correct
22 Correct 562 ms 149752 KB Output is correct
23 Correct 544 ms 149896 KB Output is correct
24 Correct 557 ms 149708 KB Output is correct
25 Correct 493 ms 149720 KB Output is correct
26 Correct 699 ms 149664 KB Output is correct
27 Correct 719 ms 149944 KB Output is correct
28 Correct 741 ms 149740 KB Output is correct
29 Correct 698 ms 149736 KB Output is correct
30 Correct 673 ms 149688 KB Output is correct
31 Correct 708 ms 149816 KB Output is correct
32 Correct 687 ms 149780 KB Output is correct
33 Correct 734 ms 149748 KB Output is correct
34 Correct 524 ms 149684 KB Output is correct
35 Correct 454 ms 149764 KB Output is correct
36 Correct 483 ms 149696 KB Output is correct
37 Correct 484 ms 149800 KB Output is correct
38 Correct 458 ms 149760 KB Output is correct
39 Correct 586 ms 149728 KB Output is correct
40 Correct 386 ms 138444 KB Output is correct
41 Correct 561 ms 149776 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 117716 KB Output is correct
2 Correct 54 ms 117704 KB Output is correct
3 Correct 62 ms 117704 KB Output is correct
4 Correct 59 ms 117728 KB Output is correct
5 Correct 72 ms 117644 KB Output is correct
6 Correct 59 ms 117704 KB Output is correct
7 Correct 62 ms 117744 KB Output is correct
8 Correct 57 ms 117752 KB Output is correct
9 Correct 58 ms 117688 KB Output is correct
10 Correct 58 ms 117812 KB Output is correct
11 Correct 60 ms 117872 KB Output is correct
12 Correct 59 ms 118316 KB Output is correct
13 Correct 64 ms 118324 KB Output is correct
14 Correct 68 ms 118384 KB Output is correct
15 Correct 73 ms 118412 KB Output is correct
16 Correct 71 ms 118364 KB Output is correct
17 Correct 65 ms 118184 KB Output is correct
18 Correct 66 ms 118292 KB Output is correct
19 Runtime error 461 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -