oj.uz

답안 #937051

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937051 2024-03-03T10:08:46 Z rxlfd314 새 집 (APIO18_new_home) C++17
47 / 100
 5000 ms 338588 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 {
  priority_queue<int> st[mxN<<2], die[mxN<<2];
  #define lc i << 1
  #define rc lc | 1
  void kill(int i) {
    while (size(st[i]) && size(die[i]) && st[i].top() == die[i].top())
      st[i].pop(), die[i].pop();
  }
  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;
    kill(i);
    if (ql <= tl && tr <= qr) {
      st[i].push(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;
    kill(i);
    if (ql <= tl && tr <= qr) {
      die[i].push(v);
      kill(i);
    } 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, int i = 1, int tl = 0, int tr = size(cmp)-1) {
    int ret = INT_MIN;
    while (tl < tr) {
      kill(i);
      if (size(st[i]))
        ret = max(ret, st[i].top());
      int tm = tl + tr >> 1;
      if (p <= tm)
        i = lc, tr = tm;
      else
        i = rc, tl = tm + 1;
    }
    kill(i);
    if (size(st[i]))
      ret = max(ret, st[i].top());
    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 = st_left.qry(i);
      if (l != INT_MIN)
        l = -l;
      int r = st_right.qry(i);
      if (r == INT_MIN)
        r = x;
      l = min(l, x);
      r = max(r, x);
      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:34:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   34 |       int tm = tl + tr >> 1;
      |                ~~~^~~~
new_home.cpp: In member function 'void ST::erase(int, int, int, int, int, int)':
new_home.cpp:47:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   47 |       int tm = tl + tr >> 1;
      |                ~~~^~~~
new_home.cpp: In member function 'int ST::qry(int, int, int, int)':
new_home.cpp:58:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   58 |       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

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 150936 KB Output is correct
2 Correct 38 ms 150728 KB Output is correct
3 Correct 40 ms 150540 KB Output is correct
4 Correct 36 ms 150612 KB Output is correct
5 Correct 37 ms 150608 KB Output is correct
6 Correct 40 ms 150860 KB Output is correct
7 Correct 40 ms 151248 KB Output is correct
8 Correct 39 ms 150900 KB Output is correct
9 Correct 39 ms 150760 KB Output is correct
10 Correct 39 ms 150872 KB Output is correct
11 Correct 38 ms 150752 KB Output is correct
12 Correct 39 ms 150744 KB Output is correct
13 Correct 40 ms 150620 KB Output is correct
14 Correct 38 ms 150608 KB Output is correct
15 Correct 40 ms 150736 KB Output is correct
16 Correct 46 ms 150872 KB Output is correct
17 Correct 39 ms 150868 KB Output is correct
18 Correct 41 ms 150840 KB Output is correct
19 Correct 40 ms 150876 KB Output is correct
20 Correct 40 ms 150876 KB Output is correct
21 Correct 38 ms 150616 KB Output is correct
22 Correct 39 ms 150868 KB Output is correct
23 Correct 38 ms 150864 KB Output is correct
24 Correct 43 ms 150928 KB Output is correct
25 Correct 39 ms 150864 KB Output is correct
26 Correct 39 ms 150804 KB Output is correct
27 Correct 43 ms 150616 KB Output is correct
28 Correct 38 ms 150844 KB Output is correct
29 Correct 38 ms 150612 KB Output is correct
30 Correct 38 ms 150620 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 150936 KB Output is correct
2 Correct 38 ms 150728 KB Output is correct
3 Correct 40 ms 150540 KB Output is correct
4 Correct 36 ms 150612 KB Output is correct
5 Correct 37 ms 150608 KB Output is correct
6 Correct 40 ms 150860 KB Output is correct
7 Correct 40 ms 151248 KB Output is correct
8 Correct 39 ms 150900 KB Output is correct
9 Correct 39 ms 150760 KB Output is correct
10 Correct 39 ms 150872 KB Output is correct
11 Correct 38 ms 150752 KB Output is correct
12 Correct 39 ms 150744 KB Output is correct
13 Correct 40 ms 150620 KB Output is correct
14 Correct 38 ms 150608 KB Output is correct
15 Correct 40 ms 150736 KB Output is correct
16 Correct 46 ms 150872 KB Output is correct
17 Correct 39 ms 150868 KB Output is correct
18 Correct 41 ms 150840 KB Output is correct
19 Correct 40 ms 150876 KB Output is correct
20 Correct 40 ms 150876 KB Output is correct
21 Correct 38 ms 150616 KB Output is correct
22 Correct 39 ms 150868 KB Output is correct
23 Correct 38 ms 150864 KB Output is correct
24 Correct 43 ms 150928 KB Output is correct
25 Correct 39 ms 150864 KB Output is correct
26 Correct 39 ms 150804 KB Output is correct
27 Correct 43 ms 150616 KB Output is correct
28 Correct 38 ms 150844 KB Output is correct
29 Correct 38 ms 150612 KB Output is correct
30 Correct 38 ms 150620 KB Output is correct
31 Correct 1475 ms 187896 KB Output is correct
32 Correct 90 ms 155848 KB Output is correct
33 Correct 791 ms 170332 KB Output is correct
34 Correct 1604 ms 185628 KB Output is correct
35 Correct 1324 ms 182596 KB Output is correct
36 Correct 799 ms 171580 KB Output is correct
37 Correct 652 ms 171696 KB Output is correct
38 Correct 469 ms 168796 KB Output is correct
39 Correct 451 ms 168892 KB Output is correct
40 Correct 423 ms 168460 KB Output is correct
41 Correct 806 ms 171648 KB Output is correct
42 Correct 788 ms 172900 KB Output is correct
43 Correct 87 ms 158920 KB Output is correct
44 Correct 762 ms 171276 KB Output is correct
45 Correct 698 ms 169232 KB Output is correct
46 Correct 554 ms 167668 KB Output is correct
47 Correct 318 ms 168128 KB Output is correct
48 Correct 317 ms 166764 KB Output is correct
49 Correct 414 ms 168584 KB Output is correct
50 Correct 540 ms 174688 KB Output is correct
51 Correct 409 ms 168912 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5081 ms 321808 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5030 ms 338588 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 150936 KB Output is correct
2 Correct 38 ms 150728 KB Output is correct
3 Correct 40 ms 150540 KB Output is correct
4 Correct 36 ms 150612 KB Output is correct
5 Correct 37 ms 150608 KB Output is correct
6 Correct 40 ms 150860 KB Output is correct
7 Correct 40 ms 151248 KB Output is correct
8 Correct 39 ms 150900 KB Output is correct
9 Correct 39 ms 150760 KB Output is correct
10 Correct 39 ms 150872 KB Output is correct
11 Correct 38 ms 150752 KB Output is correct
12 Correct 39 ms 150744 KB Output is correct
13 Correct 40 ms 150620 KB Output is correct
14 Correct 38 ms 150608 KB Output is correct
15 Correct 40 ms 150736 KB Output is correct
16 Correct 46 ms 150872 KB Output is correct
17 Correct 39 ms 150868 KB Output is correct
18 Correct 41 ms 150840 KB Output is correct
19 Correct 40 ms 150876 KB Output is correct
20 Correct 40 ms 150876 KB Output is correct
21 Correct 38 ms 150616 KB Output is correct
22 Correct 39 ms 150868 KB Output is correct
23 Correct 38 ms 150864 KB Output is correct
24 Correct 43 ms 150928 KB Output is correct
25 Correct 39 ms 150864 KB Output is correct
26 Correct 39 ms 150804 KB Output is correct
27 Correct 43 ms 150616 KB Output is correct
28 Correct 38 ms 150844 KB Output is correct
29 Correct 38 ms 150612 KB Output is correct
30 Correct 38 ms 150620 KB Output is correct
31 Correct 1475 ms 187896 KB Output is correct
32 Correct 90 ms 155848 KB Output is correct
33 Correct 791 ms 170332 KB Output is correct
34 Correct 1604 ms 185628 KB Output is correct
35 Correct 1324 ms 182596 KB Output is correct
36 Correct 799 ms 171580 KB Output is correct
37 Correct 652 ms 171696 KB Output is correct
38 Correct 469 ms 168796 KB Output is correct
39 Correct 451 ms 168892 KB Output is correct
40 Correct 423 ms 168460 KB Output is correct
41 Correct 806 ms 171648 KB Output is correct
42 Correct 788 ms 172900 KB Output is correct
43 Correct 87 ms 158920 KB Output is correct
44 Correct 762 ms 171276 KB Output is correct
45 Correct 698 ms 169232 KB Output is correct
46 Correct 554 ms 167668 KB Output is correct
47 Correct 318 ms 168128 KB Output is correct
48 Correct 317 ms 166764 KB Output is correct
49 Correct 414 ms 168584 KB Output is correct
50 Correct 540 ms 174688 KB Output is correct
51 Correct 409 ms 168912 KB Output is correct
52 Correct 501 ms 173872 KB Output is correct
53 Correct 399 ms 171924 KB Output is correct
54 Correct 1002 ms 187320 KB Output is correct
55 Correct 770 ms 177080 KB Output is correct
56 Correct 653 ms 177740 KB Output is correct
57 Correct 846 ms 176852 KB Output is correct
58 Correct 756 ms 177684 KB Output is correct
59 Correct 663 ms 178520 KB Output is correct
60 Correct 839 ms 176448 KB Output is correct
61 Correct 90 ms 163776 KB Output is correct
62 Correct 442 ms 174016 KB Output is correct
63 Correct 723 ms 182976 KB Output is correct
64 Correct 896 ms 185020 KB Output is correct
65 Correct 1010 ms 185684 KB Output is correct
66 Correct 866 ms 174784 KB Output is correct
67 Correct 230 ms 162496 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 150936 KB Output is correct
2 Correct 38 ms 150728 KB Output is correct
3 Correct 40 ms 150540 KB Output is correct
4 Correct 36 ms 150612 KB Output is correct
5 Correct 37 ms 150608 KB Output is correct
6 Correct 40 ms 150860 KB Output is correct
7 Correct 40 ms 151248 KB Output is correct
8 Correct 39 ms 150900 KB Output is correct
9 Correct 39 ms 150760 KB Output is correct
10 Correct 39 ms 150872 KB Output is correct
11 Correct 38 ms 150752 KB Output is correct
12 Correct 39 ms 150744 KB Output is correct
13 Correct 40 ms 150620 KB Output is correct
14 Correct 38 ms 150608 KB Output is correct
15 Correct 40 ms 150736 KB Output is correct
16 Correct 46 ms 150872 KB Output is correct
17 Correct 39 ms 150868 KB Output is correct
18 Correct 41 ms 150840 KB Output is correct
19 Correct 40 ms 150876 KB Output is correct
20 Correct 40 ms 150876 KB Output is correct
21 Correct 38 ms 150616 KB Output is correct
22 Correct 39 ms 150868 KB Output is correct
23 Correct 38 ms 150864 KB Output is correct
24 Correct 43 ms 150928 KB Output is correct
25 Correct 39 ms 150864 KB Output is correct
26 Correct 39 ms 150804 KB Output is correct
27 Correct 43 ms 150616 KB Output is correct
28 Correct 38 ms 150844 KB Output is correct
29 Correct 38 ms 150612 KB Output is correct
30 Correct 38 ms 150620 KB Output is correct
31 Correct 1475 ms 187896 KB Output is correct
32 Correct 90 ms 155848 KB Output is correct
33 Correct 791 ms 170332 KB Output is correct
34 Correct 1604 ms 185628 KB Output is correct
35 Correct 1324 ms 182596 KB Output is correct
36 Correct 799 ms 171580 KB Output is correct
37 Correct 652 ms 171696 KB Output is correct
38 Correct 469 ms 168796 KB Output is correct
39 Correct 451 ms 168892 KB Output is correct
40 Correct 423 ms 168460 KB Output is correct
41 Correct 806 ms 171648 KB Output is correct
42 Correct 788 ms 172900 KB Output is correct
43 Correct 87 ms 158920 KB Output is correct
44 Correct 762 ms 171276 KB Output is correct
45 Correct 698 ms 169232 KB Output is correct
46 Correct 554 ms 167668 KB Output is correct
47 Correct 318 ms 168128 KB Output is correct
48 Correct 317 ms 166764 KB Output is correct
49 Correct 414 ms 168584 KB Output is correct
50 Correct 540 ms 174688 KB Output is correct
51 Correct 409 ms 168912 KB Output is correct
52 Execution timed out 5081 ms 321808 KB Time limit exceeded
53 Halted 0 ms 0 KB -