oj.uz

Submission #490491

# Submission time Handle Problem Language Result Execution time Memory
490491 2021-11-27T16:14:30 Z acm Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
100 / 100
 2184 ms 170084 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[8000005];
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 12 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 13 ms 23752 KB Output is correct
5 Correct 15 ms 23884 KB Output is correct
6 Correct 12 ms 23884 KB Output is correct
7 Correct 14 ms 23884 KB Output is correct
8 Correct 13 ms 23940 KB Output is correct
9 Correct 14 ms 23848 KB Output is correct
10 Correct 12 ms 23884 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 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 13 ms 23752 KB Output is correct
5 Correct 15 ms 23884 KB Output is correct
6 Correct 12 ms 23884 KB Output is correct
7 Correct 14 ms 23884 KB Output is correct
8 Correct 13 ms 23940 KB Output is correct
9 Correct 14 ms 23848 KB Output is correct
10 Correct 12 ms 23884 KB Output is correct
11 Correct 14 ms 24140 KB Output is correct
12 Correct 15 ms 24524 KB Output is correct
13 Correct 16 ms 24492 KB Output is correct
14 Correct 19 ms 24700 KB Output is correct
15 Correct 17 ms 24644 KB Output is correct
16 Correct 15 ms 24652 KB Output is correct
17 Correct 14 ms 24396 KB Output is correct
18 Correct 14 ms 24652 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2184 ms 150480 KB Output is correct
2 Correct 2122 ms 150536 KB Output is correct
3 Correct 2054 ms 150516 KB Output is correct
4 Correct 1990 ms 150508 KB Output is correct
5 Correct 1459 ms 141968 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 38284 KB Output is correct
2 Correct 126 ms 37636 KB Output is correct
3 Correct 112 ms 36816 KB Output is correct
4 Correct 117 ms 37048 KB Output is correct
5 Correct 107 ms 37136 KB Output is correct
6 Correct 86 ms 32276 KB Output is correct
7 Correct 87 ms 32184 KB Output is correct
8 Correct 96 ms 37548 KB Output is correct
9 Correct 48 ms 27448 KB Output is correct
10 Correct 91 ms 37436 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 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 13 ms 23752 KB Output is correct
5 Correct 15 ms 23884 KB Output is correct
6 Correct 12 ms 23884 KB Output is correct
7 Correct 14 ms 23884 KB Output is correct
8 Correct 13 ms 23940 KB Output is correct
9 Correct 14 ms 23848 KB Output is correct
10 Correct 12 ms 23884 KB Output is correct
11 Correct 14 ms 24140 KB Output is correct
12 Correct 15 ms 24524 KB Output is correct
13 Correct 16 ms 24492 KB Output is correct
14 Correct 19 ms 24700 KB Output is correct
15 Correct 17 ms 24644 KB Output is correct
16 Correct 15 ms 24652 KB Output is correct
17 Correct 14 ms 24396 KB Output is correct
18 Correct 14 ms 24652 KB Output is correct
19 Correct 332 ms 52716 KB Output is correct
20 Correct 375 ms 52604 KB Output is correct
21 Correct 267 ms 51244 KB Output is correct
22 Correct 264 ms 51268 KB Output is correct
23 Correct 259 ms 51232 KB Output is correct
24 Correct 206 ms 41500 KB Output is correct
25 Correct 187 ms 41496 KB Output is correct
26 Correct 225 ms 46988 KB Output is correct
27 Correct 225 ms 47196 KB Output is correct
28 Correct 240 ms 49608 KB Output is correct
29 Correct 243 ms 50284 KB Output is correct
30 Correct 251 ms 50296 KB Output is correct
31 Correct 246 ms 50340 KB Output is correct
32 Correct 256 ms 50280 KB Output is correct
33 Correct 271 ms 50236 KB Output is correct
34 Correct 198 ms 40440 KB Output is correct
35 Correct 181 ms 40452 KB Output is correct
36 Correct 183 ms 40360 KB Output is correct
37 Correct 194 ms 40544 KB Output is correct
38 Correct 185 ms 40376 KB Output is correct
39 Correct 225 ms 50016 KB Output is correct
40 Correct 152 ms 41448 KB Output is correct
41 Correct 200 ms 50684 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 12 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 13 ms 23752 KB Output is correct
5 Correct 15 ms 23884 KB Output is correct
6 Correct 12 ms 23884 KB Output is correct
7 Correct 14 ms 23884 KB Output is correct
8 Correct 13 ms 23940 KB Output is correct
9 Correct 14 ms 23848 KB Output is correct
10 Correct 12 ms 23884 KB Output is correct
11 Correct 14 ms 24140 KB Output is correct
12 Correct 15 ms 24524 KB Output is correct
13 Correct 16 ms 24492 KB Output is correct
14 Correct 19 ms 24700 KB Output is correct
15 Correct 17 ms 24644 KB Output is correct
16 Correct 15 ms 24652 KB Output is correct
17 Correct 14 ms 24396 KB Output is correct
18 Correct 14 ms 24652 KB Output is correct
19 Correct 2184 ms 150480 KB Output is correct
20 Correct 2122 ms 150536 KB Output is correct
21 Correct 2054 ms 150516 KB Output is correct
22 Correct 1990 ms 150508 KB Output is correct
23 Correct 1459 ms 141968 KB Output is correct
24 Correct 144 ms 38284 KB Output is correct
25 Correct 126 ms 37636 KB Output is correct
26 Correct 112 ms 36816 KB Output is correct
27 Correct 117 ms 37048 KB Output is correct
28 Correct 107 ms 37136 KB Output is correct
29 Correct 86 ms 32276 KB Output is correct
30 Correct 87 ms 32184 KB Output is correct
31 Correct 96 ms 37548 KB Output is correct
32 Correct 48 ms 27448 KB Output is correct
33 Correct 91 ms 37436 KB Output is correct
34 Correct 332 ms 52716 KB Output is correct
35 Correct 375 ms 52604 KB Output is correct
36 Correct 267 ms 51244 KB Output is correct
37 Correct 264 ms 51268 KB Output is correct
38 Correct 259 ms 51232 KB Output is correct
39 Correct 206 ms 41500 KB Output is correct
40 Correct 187 ms 41496 KB Output is correct
41 Correct 225 ms 46988 KB Output is correct
42 Correct 225 ms 47196 KB Output is correct
43 Correct 240 ms 49608 KB Output is correct
44 Correct 243 ms 50284 KB Output is correct
45 Correct 251 ms 50296 KB Output is correct
46 Correct 246 ms 50340 KB Output is correct
47 Correct 256 ms 50280 KB Output is correct
48 Correct 271 ms 50236 KB Output is correct
49 Correct 198 ms 40440 KB Output is correct
50 Correct 181 ms 40452 KB Output is correct
51 Correct 183 ms 40360 KB Output is correct
52 Correct 194 ms 40544 KB Output is correct
53 Correct 185 ms 40376 KB Output is correct
54 Correct 225 ms 50016 KB Output is correct
55 Correct 152 ms 41448 KB Output is correct
56 Correct 200 ms 50684 KB Output is correct
57 Correct 1974 ms 151696 KB Output is correct
58 Correct 2045 ms 168848 KB Output is correct
59 Correct 1851 ms 165424 KB Output is correct
60 Correct 1892 ms 165316 KB Output is correct
61 Correct 1887 ms 165328 KB Output is correct
62 Correct 1899 ms 165532 KB Output is correct
63 Correct 1051 ms 133004 KB Output is correct
64 Correct 1042 ms 133092 KB Output is correct
65 Correct 1402 ms 154652 KB Output is correct
66 Correct 1444 ms 154732 KB Output is correct
67 Correct 1392 ms 156692 KB Output is correct
68 Correct 1505 ms 160540 KB Output is correct
69 Correct 1507 ms 160476 KB Output is correct
70 Correct 1501 ms 159772 KB Output is correct
71 Correct 1527 ms 159792 KB Output is correct
72 Correct 1484 ms 159700 KB Output is correct
73 Correct 971 ms 130644 KB Output is correct
74 Correct 1002 ms 131388 KB Output is correct
75 Correct 974 ms 130512 KB Output is correct
76 Correct 991 ms 130492 KB Output is correct
77 Correct 990 ms 130848 KB Output is correct
78 Correct 1380 ms 167724 KB Output is correct
79 Correct 862 ms 123432 KB Output is correct
80 Correct 1258 ms 170084 KB Output is correct