oj.uz

답안 #536560

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536560 2022-03-13T14:16:26 Z cig32 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 929 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<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

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 148996 KB Output is correct
2 Correct 72 ms 148996 KB Output is correct
3 Correct 90 ms 148996 KB Output is correct
4 Correct 82 ms 148960 KB Output is correct
5 Correct 71 ms 148964 KB Output is correct
6 Correct 74 ms 148984 KB Output is correct
7 Correct 80 ms 149028 KB Output is correct
8 Correct 75 ms 149080 KB Output is correct
9 Correct 72 ms 149056 KB Output is correct
10 Correct 69 ms 149096 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 148996 KB Output is correct
2 Correct 72 ms 148996 KB Output is correct
3 Correct 90 ms 148996 KB Output is correct
4 Correct 82 ms 148960 KB Output is correct
5 Correct 71 ms 148964 KB Output is correct
6 Correct 74 ms 148984 KB Output is correct
7 Correct 80 ms 149028 KB Output is correct
8 Correct 75 ms 149080 KB Output is correct
9 Correct 72 ms 149056 KB Output is correct
10 Correct 69 ms 149096 KB Output is correct
11 Correct 73 ms 149172 KB Output is correct
12 Correct 78 ms 149772 KB Output is correct
13 Correct 86 ms 149600 KB Output is correct
14 Correct 81 ms 149672 KB Output is correct
15 Correct 75 ms 149600 KB Output is correct
16 Correct 73 ms 149704 KB Output is correct
17 Correct 74 ms 149556 KB Output is correct
18 Correct 81 ms 149580 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 395 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 384 ms 164000 KB Output is correct
2 Correct 279 ms 163940 KB Output is correct
3 Correct 359 ms 163908 KB Output is correct
4 Correct 345 ms 163960 KB Output is correct
5 Correct 369 ms 163896 KB Output is correct
6 Correct 255 ms 163896 KB Output is correct
7 Correct 253 ms 163912 KB Output is correct
8 Correct 297 ms 163916 KB Output is correct
9 Correct 101 ms 149252 KB Output is correct
10 Correct 322 ms 163888 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 148996 KB Output is correct
2 Correct 72 ms 148996 KB Output is correct
3 Correct 90 ms 148996 KB Output is correct
4 Correct 82 ms 148960 KB Output is correct
5 Correct 71 ms 148964 KB Output is correct
6 Correct 74 ms 148984 KB Output is correct
7 Correct 80 ms 149028 KB Output is correct
8 Correct 75 ms 149080 KB Output is correct
9 Correct 72 ms 149056 KB Output is correct
10 Correct 69 ms 149096 KB Output is correct
11 Correct 73 ms 149172 KB Output is correct
12 Correct 78 ms 149772 KB Output is correct
13 Correct 86 ms 149600 KB Output is correct
14 Correct 81 ms 149672 KB Output is correct
15 Correct 75 ms 149600 KB Output is correct
16 Correct 73 ms 149704 KB Output is correct
17 Correct 74 ms 149556 KB Output is correct
18 Correct 81 ms 149580 KB Output is correct
19 Correct 800 ms 179748 KB Output is correct
20 Correct 803 ms 179640 KB Output is correct
21 Correct 623 ms 179744 KB Output is correct
22 Correct 550 ms 179804 KB Output is correct
23 Correct 566 ms 179756 KB Output is correct
24 Correct 603 ms 179792 KB Output is correct
25 Correct 564 ms 179740 KB Output is correct
26 Correct 789 ms 179756 KB Output is correct
27 Correct 791 ms 179752 KB Output is correct
28 Correct 823 ms 179832 KB Output is correct
29 Correct 814 ms 179792 KB Output is correct
30 Correct 802 ms 179648 KB Output is correct
31 Correct 824 ms 179844 KB Output is correct
32 Correct 813 ms 179872 KB Output is correct
33 Correct 929 ms 179760 KB Output is correct
34 Correct 554 ms 179768 KB Output is correct
35 Correct 572 ms 179836 KB Output is correct
36 Correct 561 ms 179732 KB Output is correct
37 Correct 521 ms 179660 KB Output is correct
38 Correct 540 ms 179748 KB Output is correct
39 Correct 789 ms 179740 KB Output is correct
40 Correct 504 ms 169064 KB Output is correct
41 Correct 699 ms 179748 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 148996 KB Output is correct
2 Correct 72 ms 148996 KB Output is correct
3 Correct 90 ms 148996 KB Output is correct
4 Correct 82 ms 148960 KB Output is correct
5 Correct 71 ms 148964 KB Output is correct
6 Correct 74 ms 148984 KB Output is correct
7 Correct 80 ms 149028 KB Output is correct
8 Correct 75 ms 149080 KB Output is correct
9 Correct 72 ms 149056 KB Output is correct
10 Correct 69 ms 149096 KB Output is correct
11 Correct 73 ms 149172 KB Output is correct
12 Correct 78 ms 149772 KB Output is correct
13 Correct 86 ms 149600 KB Output is correct
14 Correct 81 ms 149672 KB Output is correct
15 Correct 75 ms 149600 KB Output is correct
16 Correct 73 ms 149704 KB Output is correct
17 Correct 74 ms 149556 KB Output is correct
18 Correct 81 ms 149580 KB Output is correct
19 Runtime error 395 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -