oj.uz

Submission #536545

# Submission time Handle Problem Language Result Execution time Memory
536545 2022-03-13T13:47:59 Z cig32 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 780 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[4*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 80 ms 149028 KB Output is correct
2 Correct 75 ms 149028 KB Output is correct
3 Correct 72 ms 148936 KB Output is correct
4 Correct 69 ms 149004 KB Output is correct
5 Correct 72 ms 149060 KB Output is correct
6 Correct 75 ms 148992 KB Output is correct
7 Correct 87 ms 148988 KB Output is correct
8 Correct 78 ms 149060 KB Output is correct
9 Correct 71 ms 149068 KB Output is correct
10 Correct 72 ms 149036 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 149028 KB Output is correct
2 Correct 75 ms 149028 KB Output is correct
3 Correct 72 ms 148936 KB Output is correct
4 Correct 69 ms 149004 KB Output is correct
5 Correct 72 ms 149060 KB Output is correct
6 Correct 75 ms 148992 KB Output is correct
7 Correct 87 ms 148988 KB Output is correct
8 Correct 78 ms 149060 KB Output is correct
9 Correct 71 ms 149068 KB Output is correct
10 Correct 72 ms 149036 KB Output is correct
11 Correct 79 ms 149124 KB Output is correct
12 Correct 81 ms 149612 KB Output is correct
13 Correct 79 ms 149700 KB Output is correct
14 Correct 76 ms 149736 KB Output is correct
15 Correct 80 ms 149676 KB Output is correct
16 Correct 93 ms 149724 KB Output is correct
17 Correct 83 ms 149600 KB Output is correct
18 Correct 86 ms 149628 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 360 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 324 ms 164648 KB Output is correct
2 Correct 314 ms 164596 KB Output is correct
3 Correct 321 ms 164668 KB Output is correct
4 Correct 370 ms 164708 KB Output is correct
5 Correct 325 ms 164760 KB Output is correct
6 Correct 271 ms 164552 KB Output is correct
7 Correct 266 ms 164620 KB Output is correct
8 Correct 286 ms 164748 KB Output is correct
9 Correct 103 ms 149300 KB Output is correct
10 Correct 304 ms 164612 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 149028 KB Output is correct
2 Correct 75 ms 149028 KB Output is correct
3 Correct 72 ms 148936 KB Output is correct
4 Correct 69 ms 149004 KB Output is correct
5 Correct 72 ms 149060 KB Output is correct
6 Correct 75 ms 148992 KB Output is correct
7 Correct 87 ms 148988 KB Output is correct
8 Correct 78 ms 149060 KB Output is correct
9 Correct 71 ms 149068 KB Output is correct
10 Correct 72 ms 149036 KB Output is correct
11 Correct 79 ms 149124 KB Output is correct
12 Correct 81 ms 149612 KB Output is correct
13 Correct 79 ms 149700 KB Output is correct
14 Correct 76 ms 149736 KB Output is correct
15 Correct 80 ms 149676 KB Output is correct
16 Correct 93 ms 149724 KB Output is correct
17 Correct 83 ms 149600 KB Output is correct
18 Correct 86 ms 149628 KB Output is correct
19 Correct 765 ms 181116 KB Output is correct
20 Correct 749 ms 181068 KB Output is correct
21 Correct 526 ms 180972 KB Output is correct
22 Correct 545 ms 181068 KB Output is correct
23 Correct 605 ms 181080 KB Output is correct
24 Correct 570 ms 181148 KB Output is correct
25 Correct 501 ms 180996 KB Output is correct
26 Correct 711 ms 181052 KB Output is correct
27 Correct 713 ms 181296 KB Output is correct
28 Correct 772 ms 181072 KB Output is correct
29 Correct 730 ms 180960 KB Output is correct
30 Correct 727 ms 180976 KB Output is correct
31 Correct 743 ms 181168 KB Output is correct
32 Correct 780 ms 181220 KB Output is correct
33 Correct 735 ms 181068 KB Output is correct
34 Correct 497 ms 181048 KB Output is correct
35 Correct 500 ms 181060 KB Output is correct
36 Correct 500 ms 181148 KB Output is correct
37 Correct 488 ms 181068 KB Output is correct
38 Correct 514 ms 181180 KB Output is correct
39 Correct 605 ms 181072 KB Output is correct
40 Correct 397 ms 169640 KB Output is correct
41 Correct 592 ms 181184 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 149028 KB Output is correct
2 Correct 75 ms 149028 KB Output is correct
3 Correct 72 ms 148936 KB Output is correct
4 Correct 69 ms 149004 KB Output is correct
5 Correct 72 ms 149060 KB Output is correct
6 Correct 75 ms 148992 KB Output is correct
7 Correct 87 ms 148988 KB Output is correct
8 Correct 78 ms 149060 KB Output is correct
9 Correct 71 ms 149068 KB Output is correct
10 Correct 72 ms 149036 KB Output is correct
11 Correct 79 ms 149124 KB Output is correct
12 Correct 81 ms 149612 KB Output is correct
13 Correct 79 ms 149700 KB Output is correct
14 Correct 76 ms 149736 KB Output is correct
15 Correct 80 ms 149676 KB Output is correct
16 Correct 93 ms 149724 KB Output is correct
17 Correct 83 ms 149600 KB Output is correct
18 Correct 86 ms 149628 KB Output is correct
19 Runtime error 360 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -