oj.uz

Submission #490489

# Submission time Handle Problem Language Result Execution time Memory
490489 2021-11-27T16:09:41 Z acm Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
77 / 100
 2015 ms 158616 KB 
#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define precision     \
  cout.precision(30); \
  cerr.precision(10);
#define ll long long
#define ld long double
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
  freopen((name + ".in").c_str(), "r", stdin);
  freopen((name + ".out").c_str(), "w", stdout);
}
ll n, m, a[1000005], d[1000005], w[1000005], t[8000005], h[8000005],
    la[8000005], al[800005];
pair<ll, ll> c[1000005];
vector<ll> v, q[1000005];
void build(ll v, ll l, ll r) {
  if (l == r) {
    h[v] = a[l];
    return;
  }
  ll tm = (l + r) / 2;
  build(v + v, l, tm);
  build(v + v + 1, tm + 1, r);
  h[v] = max(h[v + v], h[v + v + 1]);
}
void clear(ll v) {
  t[v] = h[v];
  al[v] = 1;
  la[v] = 0;
}
void add(ll v, ll x) {
  t[v] += x;
  la[v] += x;
}
void push(ll v, ll l, ll r) {
  if (l != r) {
    if (al[v]) {
      clear(v + v);
      clear(v + v + 1);
    }
    if (la[v]) {
      add(v + v, la[v]);
      add(v + v + 1, la[v]);
    }
  }
  al[v] = la[v] = 0;
}
void upd(ll v, ll l, ll r, ll x, ll y, ll z) {
  push(v, l, r);
  if (r < x || y < l) return;
  if (x <= l && r <= y) {
    if (z < 0)
      clear(v);
    else
      add(v, z);
    push(v, l, r);
    return;
  }
  ll tm = (l + r) / 2;
  upd(v + v, l, tm, x, y, z);
  upd(v + v + 1, tm + 1, r, x, y, z);
  t[v] = max(t[v + v], t[v + v + 1]);
}
ll get(ll v, ll l, ll r, ll x, ll y) {
  push(v, l, r);
  if (r < x || y < l) return -(1LL << 60);
  if (x <= l && r <= y) return t[v];
  ll tm = (l + r) / 2;
  return max(get(v + v, l, tm, x, y), get(v + v + 1, tm + 1, r, x, y));
}
int main() {
  speed;
  precision;
  // code
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= m; i++) {
    ll l, r, x;
    cin >> l >> r >> x;
    c[i] = mp(r, x);
    q[l].pb(i);
  }
  for (int i = n; i >= 1; i--) {
    while (sz(v) && a[v.back()] < a[i]) v.pop_back();
    w[i] = (sz(v) ? v.back() : n + 1) - 1;
    v.pb(i);
  }
  build(1, 1, n);
  for (int i = n; i >= 1; i--) {
    if (i + 1 <= w[i]) {
      upd(1, 1, n, i + 1, w[i], -1);
      upd(1, 1, n, i + 1, w[i], a[i]);
    }
    for (auto j : q[i]) d[j] = (get(1, 1, n, i, c[j].F) <= c[j].S);
  }
  for (int i = 1; i <= m; i++) cout << d[i] << "\n";
    // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

Compilation message

sortbooks.cpp: In function 'void ioi(std::string)':
sortbooks.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   freopen((name + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   freopen((name + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23756 KB Output is correct
2 Correct 12 ms 23756 KB Output is correct
3 Correct 12 ms 23884 KB Output is correct
4 Correct 14 ms 23760 KB Output is correct
5 Correct 12 ms 23768 KB Output is correct
6 Correct 13 ms 23924 KB Output is correct
7 Correct 13 ms 23884 KB Output is correct
8 Correct 13 ms 23884 KB Output is correct
9 Correct 12 ms 23884 KB Output is correct
10 Correct 12 ms 23916 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23756 KB Output is correct
2 Correct 12 ms 23756 KB Output is correct
3 Correct 12 ms 23884 KB Output is correct
4 Correct 14 ms 23760 KB Output is correct
5 Correct 12 ms 23768 KB Output is correct
6 Correct 13 ms 23924 KB Output is correct
7 Correct 13 ms 23884 KB Output is correct
8 Correct 13 ms 23884 KB Output is correct
9 Correct 12 ms 23884 KB Output is correct
10 Correct 12 ms 23916 KB Output is correct
11 Correct 13 ms 24140 KB Output is correct
12 Correct 15 ms 24524 KB Output is correct
13 Correct 16 ms 24528 KB Output is correct
14 Correct 17 ms 24584 KB Output is correct
15 Correct 16 ms 24596 KB Output is correct
16 Correct 15 ms 24672 KB Output is correct
17 Correct 13 ms 24396 KB Output is correct
18 Correct 15 ms 24656 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2015 ms 140472 KB Output is correct
2 Correct 1996 ms 140384 KB Output is correct
3 Correct 1952 ms 140528 KB Output is correct
4 Correct 1998 ms 140368 KB Output is correct
5 Correct 1453 ms 131940 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 38272 KB Output is correct
2 Correct 129 ms 37688 KB Output is correct
3 Correct 111 ms 36840 KB Output is correct
4 Correct 117 ms 37084 KB Output is correct
5 Correct 111 ms 37076 KB Output is correct
6 Correct 85 ms 32196 KB Output is correct
7 Correct 97 ms 32168 KB Output is correct
8 Correct 93 ms 37592 KB Output is correct
9 Correct 48 ms 27412 KB Output is correct
10 Correct 96 ms 37476 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23756 KB Output is correct
2 Correct 12 ms 23756 KB Output is correct
3 Correct 12 ms 23884 KB Output is correct
4 Correct 14 ms 23760 KB Output is correct
5 Correct 12 ms 23768 KB Output is correct
6 Correct 13 ms 23924 KB Output is correct
7 Correct 13 ms 23884 KB Output is correct
8 Correct 13 ms 23884 KB Output is correct
9 Correct 12 ms 23884 KB Output is correct
10 Correct 12 ms 23916 KB Output is correct
11 Correct 13 ms 24140 KB Output is correct
12 Correct 15 ms 24524 KB Output is correct
13 Correct 16 ms 24528 KB Output is correct
14 Correct 17 ms 24584 KB Output is correct
15 Correct 16 ms 24596 KB Output is correct
16 Correct 15 ms 24672 KB Output is correct
17 Correct 13 ms 24396 KB Output is correct
18 Correct 15 ms 24656 KB Output is correct
19 Correct 329 ms 52684 KB Output is correct
20 Correct 328 ms 52932 KB Output is correct
21 Correct 265 ms 51320 KB Output is correct
22 Correct 267 ms 51268 KB Output is correct
23 Correct 278 ms 51304 KB Output is correct
24 Correct 210 ms 41560 KB Output is correct
25 Correct 192 ms 41548 KB Output is correct
26 Correct 239 ms 47084 KB Output is correct
27 Correct 223 ms 47092 KB Output is correct
28 Correct 235 ms 49604 KB Output is correct
29 Correct 262 ms 50284 KB Output is correct
30 Correct 254 ms 50224 KB Output is correct
31 Correct 257 ms 50224 KB Output is correct
32 Correct 246 ms 50372 KB Output is correct
33 Correct 246 ms 50256 KB Output is correct
34 Correct 198 ms 40500 KB Output is correct
35 Correct 184 ms 40432 KB Output is correct
36 Correct 180 ms 40504 KB Output is correct
37 Correct 182 ms 40576 KB Output is correct
38 Correct 183 ms 40400 KB Output is correct
39 Correct 222 ms 50008 KB Output is correct
40 Correct 155 ms 41372 KB Output is correct
41 Correct 194 ms 50636 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23756 KB Output is correct
2 Correct 12 ms 23756 KB Output is correct
3 Correct 12 ms 23884 KB Output is correct
4 Correct 14 ms 23760 KB Output is correct
5 Correct 12 ms 23768 KB Output is correct
6 Correct 13 ms 23924 KB Output is correct
7 Correct 13 ms 23884 KB Output is correct
8 Correct 13 ms 23884 KB Output is correct
9 Correct 12 ms 23884 KB Output is correct
10 Correct 12 ms 23916 KB Output is correct
11 Correct 13 ms 24140 KB Output is correct
12 Correct 15 ms 24524 KB Output is correct
13 Correct 16 ms 24528 KB Output is correct
14 Correct 17 ms 24584 KB Output is correct
15 Correct 16 ms 24596 KB Output is correct
16 Correct 15 ms 24672 KB Output is correct
17 Correct 13 ms 24396 KB Output is correct
18 Correct 15 ms 24656 KB Output is correct
19 Correct 2015 ms 140472 KB Output is correct
20 Correct 1996 ms 140384 KB Output is correct
21 Correct 1952 ms 140528 KB Output is correct
22 Correct 1998 ms 140368 KB Output is correct
23 Correct 1453 ms 131940 KB Output is correct
24 Correct 150 ms 38272 KB Output is correct
25 Correct 129 ms 37688 KB Output is correct
26 Correct 111 ms 36840 KB Output is correct
27 Correct 117 ms 37084 KB Output is correct
28 Correct 111 ms 37076 KB Output is correct
29 Correct 85 ms 32196 KB Output is correct
30 Correct 97 ms 32168 KB Output is correct
31 Correct 93 ms 37592 KB Output is correct
32 Correct 48 ms 27412 KB Output is correct
33 Correct 96 ms 37476 KB Output is correct
34 Correct 329 ms 52684 KB Output is correct
35 Correct 328 ms 52932 KB Output is correct
36 Correct 265 ms 51320 KB Output is correct
37 Correct 267 ms 51268 KB Output is correct
38 Correct 278 ms 51304 KB Output is correct
39 Correct 210 ms 41560 KB Output is correct
40 Correct 192 ms 41548 KB Output is correct
41 Correct 239 ms 47084 KB Output is correct
42 Correct 223 ms 47092 KB Output is correct
43 Correct 235 ms 49604 KB Output is correct
44 Correct 262 ms 50284 KB Output is correct
45 Correct 254 ms 50224 KB Output is correct
46 Correct 257 ms 50224 KB Output is correct
47 Correct 246 ms 50372 KB Output is correct
48 Correct 246 ms 50256 KB Output is correct
49 Correct 198 ms 40500 KB Output is correct
50 Correct 184 ms 40432 KB Output is correct
51 Correct 180 ms 40504 KB Output is correct
52 Correct 182 ms 40576 KB Output is correct
53 Correct 183 ms 40400 KB Output is correct
54 Correct 222 ms 50008 KB Output is correct
55 Correct 155 ms 41372 KB Output is correct
56 Correct 194 ms 50636 KB Output is correct
57 Incorrect 1988 ms 158616 KB Output isn't correct
58 Halted 0 ms 0 KB -