oj.uz

Submission #536580

# Submission time Handle Problem Language Result Execution time Memory
536580 2022-03-13T14:35:18 Z cig32 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 829 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[2500000];
int n, m;
vector<int> v[MAXN];
void bu(int l, int r, int idx) {
  v[l].push_back(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);
}
 
int calc(int idx1) {
  return st[idx1].v.size() - 1;
}
bool cmp(int a, int b) {
  return calc(a) < calc(b);
}
void solve(int tc) {
  cin >> n >> m;
  build();
  for(int i=1; i<=n; i++) sort(v[i].begin(), v[i].end(), cmp);
  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;
        int idx1 = v[l][mid];
        int range = l + st[idx1].v.size() - 1;
        if(range <= r) lb = mid;
        else rb = mid - 1;
      }
      int idx = v[l][lb];
      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]);
      int idx1 = v[l][lb];
      int range = l + st[idx1].v.size() - 1;
      l = range + 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 51 ms 101964 KB Output is correct
2 Correct 51 ms 102072 KB Output is correct
3 Correct 57 ms 101960 KB Output is correct
4 Correct 52 ms 102020 KB Output is correct
5 Correct 48 ms 102020 KB Output is correct
6 Correct 50 ms 102032 KB Output is correct
7 Correct 60 ms 102068 KB Output is correct
8 Correct 49 ms 102120 KB Output is correct
9 Correct 50 ms 102208 KB Output is correct
10 Correct 58 ms 102092 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 101964 KB Output is correct
2 Correct 51 ms 102072 KB Output is correct
3 Correct 57 ms 101960 KB Output is correct
4 Correct 52 ms 102020 KB Output is correct
5 Correct 48 ms 102020 KB Output is correct
6 Correct 50 ms 102032 KB Output is correct
7 Correct 60 ms 102068 KB Output is correct
8 Correct 49 ms 102120 KB Output is correct
9 Correct 50 ms 102208 KB Output is correct
10 Correct 58 ms 102092 KB Output is correct
11 Correct 51 ms 102156 KB Output is correct
12 Correct 60 ms 102696 KB Output is correct
13 Correct 56 ms 102680 KB Output is correct
14 Correct 75 ms 102692 KB Output is correct
15 Correct 58 ms 102720 KB Output is correct
16 Correct 57 ms 102708 KB Output is correct
17 Correct 52 ms 102604 KB Output is correct
18 Correct 52 ms 102700 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 540 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 373 ms 117008 KB Output is correct
2 Correct 270 ms 117036 KB Output is correct
3 Correct 394 ms 116980 KB Output is correct
4 Correct 357 ms 116936 KB Output is correct
5 Correct 391 ms 116956 KB Output is correct
6 Correct 233 ms 116980 KB Output is correct
7 Correct 249 ms 116964 KB Output is correct
8 Correct 273 ms 117012 KB Output is correct
9 Correct 89 ms 102308 KB Output is correct
10 Correct 286 ms 116996 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 101964 KB Output is correct
2 Correct 51 ms 102072 KB Output is correct
3 Correct 57 ms 101960 KB Output is correct
4 Correct 52 ms 102020 KB Output is correct
5 Correct 48 ms 102020 KB Output is correct
6 Correct 50 ms 102032 KB Output is correct
7 Correct 60 ms 102068 KB Output is correct
8 Correct 49 ms 102120 KB Output is correct
9 Correct 50 ms 102208 KB Output is correct
10 Correct 58 ms 102092 KB Output is correct
11 Correct 51 ms 102156 KB Output is correct
12 Correct 60 ms 102696 KB Output is correct
13 Correct 56 ms 102680 KB Output is correct
14 Correct 75 ms 102692 KB Output is correct
15 Correct 58 ms 102720 KB Output is correct
16 Correct 57 ms 102708 KB Output is correct
17 Correct 52 ms 102604 KB Output is correct
18 Correct 52 ms 102700 KB Output is correct
19 Correct 825 ms 132780 KB Output is correct
20 Correct 828 ms 132868 KB Output is correct
21 Correct 584 ms 132792 KB Output is correct
22 Correct 608 ms 132744 KB Output is correct
23 Correct 624 ms 132844 KB Output is correct
24 Correct 528 ms 132808 KB Output is correct
25 Correct 537 ms 132780 KB Output is correct
26 Correct 755 ms 132756 KB Output is correct
27 Correct 821 ms 132812 KB Output is correct
28 Correct 824 ms 132744 KB Output is correct
29 Correct 820 ms 132904 KB Output is correct
30 Correct 829 ms 132880 KB Output is correct
31 Correct 805 ms 132796 KB Output is correct
32 Correct 782 ms 132836 KB Output is correct
33 Correct 827 ms 132684 KB Output is correct
34 Correct 530 ms 132696 KB Output is correct
35 Correct 609 ms 132856 KB Output is correct
36 Correct 502 ms 132840 KB Output is correct
37 Correct 537 ms 132720 KB Output is correct
38 Correct 532 ms 132784 KB Output is correct
39 Correct 794 ms 132888 KB Output is correct
40 Correct 514 ms 122188 KB Output is correct
41 Correct 730 ms 132776 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 101964 KB Output is correct
2 Correct 51 ms 102072 KB Output is correct
3 Correct 57 ms 101960 KB Output is correct
4 Correct 52 ms 102020 KB Output is correct
5 Correct 48 ms 102020 KB Output is correct
6 Correct 50 ms 102032 KB Output is correct
7 Correct 60 ms 102068 KB Output is correct
8 Correct 49 ms 102120 KB Output is correct
9 Correct 50 ms 102208 KB Output is correct
10 Correct 58 ms 102092 KB Output is correct
11 Correct 51 ms 102156 KB Output is correct
12 Correct 60 ms 102696 KB Output is correct
13 Correct 56 ms 102680 KB Output is correct
14 Correct 75 ms 102692 KB Output is correct
15 Correct 58 ms 102720 KB Output is correct
16 Correct 57 ms 102708 KB Output is correct
17 Correct 52 ms 102604 KB Output is correct
18 Correct 52 ms 102700 KB Output is correct
19 Runtime error 540 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -