oj.uz

Submission #936606

# Submission time Handle Problem Language Result Execution time Memory
936606 2024-03-02T10:34:49 Z rxlfd314 New Home (APIO18_new_home) C++17
47 / 100
 5000 ms 502124 KB 
#include <bits/stdc++.h>
using namespace std;
using ari2 = array<int, 2>;
using ari3 = array<int, 3>;
using ari4 = array<int, 4>;
 
#define vt vector
#define size(x) (int((x).size()))
#define all(x) begin(x), end(x)
 
#define REP(a, b, c, d) for (int a = (b); (d) > 0 ? a <= (c) : a >= (c); a += (d))
#define FOR(a, b, c) REP(a, b, c, 1)
#define ROF(a, b, c) REP(a, b, c, -1)
 
constexpr int mxN = 300000;
int N, K, Q;
vt<int> cmp;
 
struct ST {
  multiset<int> st[mxN<<2];
  #define lc i << 1
  #define rc lc | 1
  void insert(int ql, int qr, int v, int i = 1, int tl = 0, int tr = size(cmp)-1) {
    if (tl > qr || tr < ql)
      return;
    if (ql <= tl && tr <= qr)
      st[i].insert(v);
    else {
      int tm = tl + tr >> 1;
      insert(ql, qr, v, lc, tl, tm);
      insert(ql, qr, v, rc, tm+1, tr);
    }
  }
  void erase(int ql, int qr, int v, int i = 1, int tl = 0, int tr = size(cmp)-1) {
    if (tl > qr || tr < ql)
      return;
    if (ql <= tl && tr <= qr) {
      if (st[i].find(v) != end(st[i]))
        st[i].erase(st[i].find(v));
    } else {
      int tm = tl + tr >> 1;
      erase(ql, qr, v, lc, tl, tm);
      erase(ql, qr, v, rc, tm+1, tr);
    }
  }
  int qry(int p, bool last, int i = 1, int tl = 0, int tr = size(cmp)-1) {
    int ret = last ? -1 : INT_MAX;
    while (tl < tr) {
      if (size(st[i])) {
        if (last)
          ret = max(ret, *prev(end(st[i])));
        else
          ret = min(ret, *begin(st[i]));
      }
      int tm = tl + tr >> 1;
      if (p <= tm)
        i = lc, tr = tm;
      else
        i = rc, tl = tm + 1;
    }
    if (size(st[i])) {
      if (last)
        ret = max(ret, *prev(end(st[i])));
      else
        ret = min(ret, *begin(st[i]));
    }
    return ret;
  }
#undef lc
#undef rc
} st_left, st_right;

signed main() {
#ifndef DEBUG
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
#endif
  cin >> N >> K >> Q;
  vt<ari4> events;
  FOR(i, 0, N-1) {
    int x, t, a, b;
    cin >> x >> t >> a >> b, t--;
    events.push_back({a, 0, x, t}); // time, (0 = insert, 1 = remove, 2 = is year), location, type
    events.push_back({b+1, 1, x, t});
  }
  FOR(i, 0, Q-1) {
    int year, x;
    cin >> x >> year;
    events.push_back({year, 2, x, i}); // time, is year, location, query index
    cmp.push_back(x);
  }
  sort(all(cmp));
  cmp.erase(unique(all(cmp)), end(cmp));
  sort(all(events));

  auto ind = [&](int v) {
    return lower_bound(all(cmp), v) - begin(cmp);
  };
  auto erase = [&](int l, int r) {
    assert(l + r + 1 >= 0);
    int m = l + r + 1 >> 1;
    int li = ind(l), ri = ind(r), mi = ind(m);
    ri -= cmp[ri] > r;
    if (mi - 1 >= li)
      st_left.erase(li, mi-1, l); 
    if (ri >= mi)
      st_right.erase(mi, ri, r);
  };
  auto insert = [&](int l, int r) {
    assert(l + r + 1 >= 0);
    int m = l + r + 1 >> 1;
    int li = ind(l), ri = ind(r), mi = ind(m);
    ri -= cmp[ri] > r;
    if (mi - 1 >= li)
      st_left.insert(li, mi-1, l);
    if (ri >= mi)
      st_right.insert(mi, ri, r);
  };

  vt<int> ans(Q), present(K);
  vt<map<int, int>> positions(K);
  int present_cnt = 0;
  for (auto &[t, is_query, x, type] : events) {
    if (is_query == 2) {
      if (present_cnt < K) {
        ans[type] = -1;
        continue;
      }
      int i = ind(x);
      int l = min(x, st_left.qry(i, false));
      int r = max(x, st_right.qry(i, true));
      ans[type] = max(r - x, x - l);
#ifdef DEBUG
      cout << "at time " << t << " answer for " << x << " is:\n";
      cout << "L: " << l << '\n';
      cout << "R: " << r << '\n';
#endif
    } else if (is_query) {
      auto &xs = positions[type];
      if (xs[x] == 1) {
        auto it = xs.find(x);
        int l = it != begin(xs) ? prev(it)->first : -1;
        int r = next(it) != end(xs) ? next(it)->first : INT_MAX;
        xs.erase(it);
        if (l >= 0)
          erase(l, x);
        else
          erase(-x, x);
        if (r < INT_MAX)
          erase(x, r); 
        else
          erase(x, INT_MAX - x - 1);

        if (l >= 0 && r < INT_MAX)
          insert(l, r);
        else if (l >= 0)
          insert(l, INT_MAX - l - 1);
        else if (r < INT_MAX)
          insert(-r, r);
      } else {
        xs[x]--;
      }
      present_cnt -= --present[type] == 0;
    } else {
      auto &xs = positions[type];
      if (xs[x])
        xs[x]++;
      else {
        xs[x] = 1;
        auto it = xs.find(x);
        int l = it != begin(xs) ? prev(it)->first : -1;
        int r = next(it) != end(xs) ? next(it)->first : INT_MAX;
        if (l >= 0 && r < INT_MAX)
          erase(l, r);
        else if (l >= 0)
          erase(l, INT_MAX - l - 1);
        else if (r < INT_MAX)
          erase(-r, r);

        if (l >= 0)
          insert(l, x);
        else
          insert(-x, x);
        if (r < INT_MAX)
          insert(x, r);
        else
          insert(x, INT_MAX - x - 1);
      }
      present_cnt += ++present[type] == 1;
    }
  }

  for (int &i : ans)
    cout << i << '\n';
}

Compilation message

new_home.cpp: In member function 'void ST::insert(int, int, int, int, int, int)':
new_home.cpp:29:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |       int tm = tl + tr >> 1;
      |                ~~~^~~~
new_home.cpp: In member function 'void ST::erase(int, int, int, int, int, int)':
new_home.cpp:41:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   41 |       int tm = tl + tr >> 1;
      |                ~~~^~~~
new_home.cpp: In member function 'int ST::qry(int, bool, int, int, int)':
new_home.cpp:55:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |       int tm = tl + tr >> 1;
      |                ~~~^~~~
new_home.cpp: In lambda function:
new_home.cpp:101:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  101 |     int m = l + r + 1 >> 1;
      |             ~~~~~~^~~
new_home.cpp: In lambda function:
new_home.cpp:111:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  111 |     int m = l + r + 1 >> 1;
      |             ~~~~~~^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 112976 KB Output is correct
2 Correct 22 ms 112984 KB Output is correct
3 Correct 24 ms 113176 KB Output is correct
4 Correct 23 ms 112984 KB Output is correct
5 Correct 27 ms 113248 KB Output is correct
6 Correct 25 ms 113088 KB Output is correct
7 Correct 24 ms 113496 KB Output is correct
8 Correct 25 ms 113244 KB Output is correct
9 Correct 24 ms 113300 KB Output is correct
10 Correct 24 ms 113240 KB Output is correct
11 Correct 24 ms 112988 KB Output is correct
12 Correct 24 ms 112988 KB Output is correct
13 Correct 24 ms 113160 KB Output is correct
14 Correct 24 ms 112988 KB Output is correct
15 Correct 25 ms 113240 KB Output is correct
16 Correct 25 ms 113308 KB Output is correct
17 Correct 26 ms 113240 KB Output is correct
18 Correct 29 ms 113448 KB Output is correct
19 Correct 24 ms 113244 KB Output is correct
20 Correct 26 ms 113244 KB Output is correct
21 Correct 24 ms 113244 KB Output is correct
22 Correct 26 ms 113244 KB Output is correct
23 Correct 26 ms 113244 KB Output is correct
24 Correct 25 ms 113244 KB Output is correct
25 Correct 25 ms 113244 KB Output is correct
26 Correct 24 ms 113100 KB Output is correct
27 Correct 24 ms 112988 KB Output is correct
28 Correct 24 ms 112988 KB Output is correct
29 Correct 25 ms 113232 KB Output is correct
30 Correct 24 ms 113240 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 112976 KB Output is correct
2 Correct 22 ms 112984 KB Output is correct
3 Correct 24 ms 113176 KB Output is correct
4 Correct 23 ms 112984 KB Output is correct
5 Correct 27 ms 113248 KB Output is correct
6 Correct 25 ms 113088 KB Output is correct
7 Correct 24 ms 113496 KB Output is correct
8 Correct 25 ms 113244 KB Output is correct
9 Correct 24 ms 113300 KB Output is correct
10 Correct 24 ms 113240 KB Output is correct
11 Correct 24 ms 112988 KB Output is correct
12 Correct 24 ms 112988 KB Output is correct
13 Correct 24 ms 113160 KB Output is correct
14 Correct 24 ms 112988 KB Output is correct
15 Correct 25 ms 113240 KB Output is correct
16 Correct 25 ms 113308 KB Output is correct
17 Correct 26 ms 113240 KB Output is correct
18 Correct 29 ms 113448 KB Output is correct
19 Correct 24 ms 113244 KB Output is correct
20 Correct 26 ms 113244 KB Output is correct
21 Correct 24 ms 113244 KB Output is correct
22 Correct 26 ms 113244 KB Output is correct
23 Correct 26 ms 113244 KB Output is correct
24 Correct 25 ms 113244 KB Output is correct
25 Correct 25 ms 113244 KB Output is correct
26 Correct 24 ms 113100 KB Output is correct
27 Correct 24 ms 112988 KB Output is correct
28 Correct 24 ms 112988 KB Output is correct
29 Correct 25 ms 113232 KB Output is correct
30 Correct 24 ms 113240 KB Output is correct
31 Correct 1828 ms 158020 KB Output is correct
32 Correct 85 ms 118248 KB Output is correct
33 Correct 730 ms 125380 KB Output is correct
34 Correct 1496 ms 135608 KB Output is correct
35 Correct 1397 ms 149496 KB Output is correct
36 Correct 713 ms 132220 KB Output is correct
37 Correct 505 ms 118808 KB Output is correct
38 Correct 359 ms 117716 KB Output is correct
39 Correct 332 ms 117716 KB Output is correct
40 Correct 313 ms 118224 KB Output is correct
41 Correct 569 ms 117964 KB Output is correct
42 Correct 628 ms 118220 KB Output is correct
43 Correct 81 ms 117880 KB Output is correct
44 Correct 556 ms 118380 KB Output is correct
45 Correct 458 ms 117704 KB Output is correct
46 Correct 428 ms 117448 KB Output is correct
47 Correct 248 ms 118368 KB Output is correct
48 Correct 241 ms 119040 KB Output is correct
49 Correct 319 ms 119104 KB Output is correct
50 Correct 457 ms 118472 KB Output is correct
51 Correct 322 ms 117460 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5078 ms 502124 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5050 ms 445348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 112976 KB Output is correct
2 Correct 22 ms 112984 KB Output is correct
3 Correct 24 ms 113176 KB Output is correct
4 Correct 23 ms 112984 KB Output is correct
5 Correct 27 ms 113248 KB Output is correct
6 Correct 25 ms 113088 KB Output is correct
7 Correct 24 ms 113496 KB Output is correct
8 Correct 25 ms 113244 KB Output is correct
9 Correct 24 ms 113300 KB Output is correct
10 Correct 24 ms 113240 KB Output is correct
11 Correct 24 ms 112988 KB Output is correct
12 Correct 24 ms 112988 KB Output is correct
13 Correct 24 ms 113160 KB Output is correct
14 Correct 24 ms 112988 KB Output is correct
15 Correct 25 ms 113240 KB Output is correct
16 Correct 25 ms 113308 KB Output is correct
17 Correct 26 ms 113240 KB Output is correct
18 Correct 29 ms 113448 KB Output is correct
19 Correct 24 ms 113244 KB Output is correct
20 Correct 26 ms 113244 KB Output is correct
21 Correct 24 ms 113244 KB Output is correct
22 Correct 26 ms 113244 KB Output is correct
23 Correct 26 ms 113244 KB Output is correct
24 Correct 25 ms 113244 KB Output is correct
25 Correct 25 ms 113244 KB Output is correct
26 Correct 24 ms 113100 KB Output is correct
27 Correct 24 ms 112988 KB Output is correct
28 Correct 24 ms 112988 KB Output is correct
29 Correct 25 ms 113232 KB Output is correct
30 Correct 24 ms 113240 KB Output is correct
31 Correct 1828 ms 158020 KB Output is correct
32 Correct 85 ms 118248 KB Output is correct
33 Correct 730 ms 125380 KB Output is correct
34 Correct 1496 ms 135608 KB Output is correct
35 Correct 1397 ms 149496 KB Output is correct
36 Correct 713 ms 132220 KB Output is correct
37 Correct 505 ms 118808 KB Output is correct
38 Correct 359 ms 117716 KB Output is correct
39 Correct 332 ms 117716 KB Output is correct
40 Correct 313 ms 118224 KB Output is correct
41 Correct 569 ms 117964 KB Output is correct
42 Correct 628 ms 118220 KB Output is correct
43 Correct 81 ms 117880 KB Output is correct
44 Correct 556 ms 118380 KB Output is correct
45 Correct 458 ms 117704 KB Output is correct
46 Correct 428 ms 117448 KB Output is correct
47 Correct 248 ms 118368 KB Output is correct
48 Correct 241 ms 119040 KB Output is correct
49 Correct 319 ms 119104 KB Output is correct
50 Correct 457 ms 118472 KB Output is correct
51 Correct 322 ms 117460 KB Output is correct
52 Correct 640 ms 167868 KB Output is correct
53 Correct 611 ms 137932 KB Output is correct
54 Correct 1723 ms 179364 KB Output is correct
55 Correct 646 ms 134332 KB Output is correct
56 Correct 647 ms 142528 KB Output is correct
57 Correct 664 ms 122800 KB Output is correct
58 Correct 697 ms 134620 KB Output is correct
59 Correct 736 ms 143812 KB Output is correct
60 Correct 650 ms 122560 KB Output is correct
61 Correct 94 ms 125808 KB Output is correct
62 Correct 596 ms 171400 KB Output is correct
63 Correct 1227 ms 169468 KB Output is correct
64 Correct 1526 ms 160620 KB Output is correct
65 Correct 1309 ms 133928 KB Output is correct
66 Correct 656 ms 121240 KB Output is correct
67 Correct 330 ms 122556 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 112976 KB Output is correct
2 Correct 22 ms 112984 KB Output is correct
3 Correct 24 ms 113176 KB Output is correct
4 Correct 23 ms 112984 KB Output is correct
5 Correct 27 ms 113248 KB Output is correct
6 Correct 25 ms 113088 KB Output is correct
7 Correct 24 ms 113496 KB Output is correct
8 Correct 25 ms 113244 KB Output is correct
9 Correct 24 ms 113300 KB Output is correct
10 Correct 24 ms 113240 KB Output is correct
11 Correct 24 ms 112988 KB Output is correct
12 Correct 24 ms 112988 KB Output is correct
13 Correct 24 ms 113160 KB Output is correct
14 Correct 24 ms 112988 KB Output is correct
15 Correct 25 ms 113240 KB Output is correct
16 Correct 25 ms 113308 KB Output is correct
17 Correct 26 ms 113240 KB Output is correct
18 Correct 29 ms 113448 KB Output is correct
19 Correct 24 ms 113244 KB Output is correct
20 Correct 26 ms 113244 KB Output is correct
21 Correct 24 ms 113244 KB Output is correct
22 Correct 26 ms 113244 KB Output is correct
23 Correct 26 ms 113244 KB Output is correct
24 Correct 25 ms 113244 KB Output is correct
25 Correct 25 ms 113244 KB Output is correct
26 Correct 24 ms 113100 KB Output is correct
27 Correct 24 ms 112988 KB Output is correct
28 Correct 24 ms 112988 KB Output is correct
29 Correct 25 ms 113232 KB Output is correct
30 Correct 24 ms 113240 KB Output is correct
31 Correct 1828 ms 158020 KB Output is correct
32 Correct 85 ms 118248 KB Output is correct
33 Correct 730 ms 125380 KB Output is correct
34 Correct 1496 ms 135608 KB Output is correct
35 Correct 1397 ms 149496 KB Output is correct
36 Correct 713 ms 132220 KB Output is correct
37 Correct 505 ms 118808 KB Output is correct
38 Correct 359 ms 117716 KB Output is correct
39 Correct 332 ms 117716 KB Output is correct
40 Correct 313 ms 118224 KB Output is correct
41 Correct 569 ms 117964 KB Output is correct
42 Correct 628 ms 118220 KB Output is correct
43 Correct 81 ms 117880 KB Output is correct
44 Correct 556 ms 118380 KB Output is correct
45 Correct 458 ms 117704 KB Output is correct
46 Correct 428 ms 117448 KB Output is correct
47 Correct 248 ms 118368 KB Output is correct
48 Correct 241 ms 119040 KB Output is correct
49 Correct 319 ms 119104 KB Output is correct
50 Correct 457 ms 118472 KB Output is correct
51 Correct 322 ms 117460 KB Output is correct
52 Execution timed out 5078 ms 502124 KB Time limit exceeded
53 Halted 0 ms 0 KB -