oj.uz

Submission #536553

# Submission time Handle Problem Language Result Execution time Memory
536553 2022-03-13T14:03:14 Z cig32 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 735 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 57 ms 117592 KB Output is correct
2 Correct 57 ms 117688 KB Output is correct
3 Correct 56 ms 117656 KB Output is correct
4 Correct 54 ms 117732 KB Output is correct
5 Correct 57 ms 117744 KB Output is correct
6 Correct 65 ms 117708 KB Output is correct
7 Correct 64 ms 117704 KB Output is correct
8 Correct 54 ms 117708 KB Output is correct
9 Correct 54 ms 117664 KB Output is correct
10 Correct 55 ms 117716 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 117592 KB Output is correct
2 Correct 57 ms 117688 KB Output is correct
3 Correct 56 ms 117656 KB Output is correct
4 Correct 54 ms 117732 KB Output is correct
5 Correct 57 ms 117744 KB Output is correct
6 Correct 65 ms 117708 KB Output is correct
7 Correct 64 ms 117704 KB Output is correct
8 Correct 54 ms 117708 KB Output is correct
9 Correct 54 ms 117664 KB Output is correct
10 Correct 55 ms 117716 KB Output is correct
11 Correct 61 ms 117864 KB Output is correct
12 Correct 71 ms 118364 KB Output is correct
13 Correct 68 ms 118380 KB Output is correct
14 Correct 64 ms 118348 KB Output is correct
15 Correct 65 ms 118432 KB Output is correct
16 Correct 64 ms 118348 KB Output is correct
17 Correct 65 ms 118252 KB Output is correct
18 Correct 60 ms 118304 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 423 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 317 ms 133268 KB Output is correct
2 Correct 272 ms 133360 KB Output is correct
3 Correct 331 ms 133320 KB Output is correct
4 Correct 340 ms 133264 KB Output is correct
5 Correct 328 ms 133404 KB Output is correct
6 Correct 254 ms 133420 KB Output is correct
7 Correct 230 ms 133264 KB Output is correct
8 Correct 258 ms 133356 KB Output is correct
9 Correct 92 ms 117956 KB Output is correct
10 Correct 244 ms 133248 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 117592 KB Output is correct
2 Correct 57 ms 117688 KB Output is correct
3 Correct 56 ms 117656 KB Output is correct
4 Correct 54 ms 117732 KB Output is correct
5 Correct 57 ms 117744 KB Output is correct
6 Correct 65 ms 117708 KB Output is correct
7 Correct 64 ms 117704 KB Output is correct
8 Correct 54 ms 117708 KB Output is correct
9 Correct 54 ms 117664 KB Output is correct
10 Correct 55 ms 117716 KB Output is correct
11 Correct 61 ms 117864 KB Output is correct
12 Correct 71 ms 118364 KB Output is correct
13 Correct 68 ms 118380 KB Output is correct
14 Correct 64 ms 118348 KB Output is correct
15 Correct 65 ms 118432 KB Output is correct
16 Correct 64 ms 118348 KB Output is correct
17 Correct 65 ms 118252 KB Output is correct
18 Correct 60 ms 118304 KB Output is correct
19 Correct 735 ms 149700 KB Output is correct
20 Correct 708 ms 149764 KB Output is correct
21 Correct 560 ms 149676 KB Output is correct
22 Correct 522 ms 149760 KB Output is correct
23 Correct 505 ms 149708 KB Output is correct
24 Correct 490 ms 149740 KB Output is correct
25 Correct 510 ms 149880 KB Output is correct
26 Correct 670 ms 149760 KB Output is correct
27 Correct 679 ms 149864 KB Output is correct
28 Correct 699 ms 149708 KB Output is correct
29 Correct 720 ms 149788 KB Output is correct
30 Correct 714 ms 149840 KB Output is correct
31 Correct 704 ms 149760 KB Output is correct
32 Correct 679 ms 149780 KB Output is correct
33 Correct 714 ms 149660 KB Output is correct
34 Correct 481 ms 149736 KB Output is correct
35 Correct 471 ms 149760 KB Output is correct
36 Correct 470 ms 149792 KB Output is correct
37 Correct 454 ms 149764 KB Output is correct
38 Correct 476 ms 149668 KB Output is correct
39 Correct 593 ms 149708 KB Output is correct
40 Correct 409 ms 138436 KB Output is correct
41 Correct 526 ms 149808 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 117592 KB Output is correct
2 Correct 57 ms 117688 KB Output is correct
3 Correct 56 ms 117656 KB Output is correct
4 Correct 54 ms 117732 KB Output is correct
5 Correct 57 ms 117744 KB Output is correct
6 Correct 65 ms 117708 KB Output is correct
7 Correct 64 ms 117704 KB Output is correct
8 Correct 54 ms 117708 KB Output is correct
9 Correct 54 ms 117664 KB Output is correct
10 Correct 55 ms 117716 KB Output is correct
11 Correct 61 ms 117864 KB Output is correct
12 Correct 71 ms 118364 KB Output is correct
13 Correct 68 ms 118380 KB Output is correct
14 Correct 64 ms 118348 KB Output is correct
15 Correct 65 ms 118432 KB Output is correct
16 Correct 64 ms 118348 KB Output is correct
17 Correct 65 ms 118252 KB Output is correct
18 Correct 60 ms 118304 KB Output is correct
19 Runtime error 423 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -