oj.uz

답안 #937056

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937056 2024-03-03T10:20:46 Z rxlfd314 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 306912 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#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<<1], die[mxN<<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) {
    for (ql += size(cmp), qr += size(cmp) + 1; ql < qr; ql >>= 1, qr >>= 1) {
      if (ql & 1)
        st[ql++].push(v);
      if (qr & 1)
        st[--qr].push(v);
    }
  }
  void erase(int ql, int qr, int v) {
    for (ql += size(cmp), qr += size(cmp) + 1; ql < qr; ql >>= 1, qr >>= 1) {
      if (ql & 1)
        die[ql++].push(v);
      if (qr & 1)
        die[--qr].push(v);
    }
  }
  int qry(int i) {
    int res = INT_MIN;
    for (i += size(cmp); i > 0; i >>= 1)
      kill(i), res = max(res, size(st[i]) ? st[i].top() : res);
    return res;
  }
} 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;
      else
        l = x;
      int r = st_right.qry(i);
      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 lambda function:
new_home.cpp:79:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   79 |     int m = l + r + 1 >> 1;
      |             ~~~~~~^~~
new_home.cpp: In lambda function:
new_home.cpp:89:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   89 |     int m = l + r + 1 >> 1;
      |             ~~~~~~^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 75352 KB Output is correct
2 Correct 19 ms 75356 KB Output is correct
3 Correct 21 ms 75352 KB Output is correct
4 Correct 22 ms 75356 KB Output is correct
5 Correct 21 ms 75608 KB Output is correct
6 Correct 21 ms 75612 KB Output is correct
7 Correct 21 ms 75740 KB Output is correct
8 Correct 23 ms 75612 KB Output is correct
9 Correct 22 ms 75608 KB Output is correct
10 Correct 27 ms 75608 KB Output is correct
11 Correct 21 ms 75612 KB Output is correct
12 Correct 25 ms 75612 KB Output is correct
13 Correct 21 ms 75624 KB Output is correct
14 Correct 22 ms 75612 KB Output is correct
15 Correct 21 ms 75580 KB Output is correct
16 Correct 24 ms 75612 KB Output is correct
17 Correct 27 ms 75752 KB Output is correct
18 Correct 21 ms 75612 KB Output is correct
19 Correct 22 ms 75512 KB Output is correct
20 Correct 21 ms 75612 KB Output is correct
21 Correct 20 ms 75612 KB Output is correct
22 Correct 23 ms 75504 KB Output is correct
23 Correct 20 ms 75864 KB Output is correct
24 Correct 26 ms 75612 KB Output is correct
25 Correct 22 ms 75768 KB Output is correct
26 Correct 21 ms 75608 KB Output is correct
27 Correct 25 ms 75516 KB Output is correct
28 Correct 23 ms 75608 KB Output is correct
29 Correct 22 ms 75600 KB Output is correct
30 Correct 23 ms 75696 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 75352 KB Output is correct
2 Correct 19 ms 75356 KB Output is correct
3 Correct 21 ms 75352 KB Output is correct
4 Correct 22 ms 75356 KB Output is correct
5 Correct 21 ms 75608 KB Output is correct
6 Correct 21 ms 75612 KB Output is correct
7 Correct 21 ms 75740 KB Output is correct
8 Correct 23 ms 75612 KB Output is correct
9 Correct 22 ms 75608 KB Output is correct
10 Correct 27 ms 75608 KB Output is correct
11 Correct 21 ms 75612 KB Output is correct
12 Correct 25 ms 75612 KB Output is correct
13 Correct 21 ms 75624 KB Output is correct
14 Correct 22 ms 75612 KB Output is correct
15 Correct 21 ms 75580 KB Output is correct
16 Correct 24 ms 75612 KB Output is correct
17 Correct 27 ms 75752 KB Output is correct
18 Correct 21 ms 75612 KB Output is correct
19 Correct 22 ms 75512 KB Output is correct
20 Correct 21 ms 75612 KB Output is correct
21 Correct 20 ms 75612 KB Output is correct
22 Correct 23 ms 75504 KB Output is correct
23 Correct 20 ms 75864 KB Output is correct
24 Correct 26 ms 75612 KB Output is correct
25 Correct 22 ms 75768 KB Output is correct
26 Correct 21 ms 75608 KB Output is correct
27 Correct 25 ms 75516 KB Output is correct
28 Correct 23 ms 75608 KB Output is correct
29 Correct 22 ms 75600 KB Output is correct
30 Correct 23 ms 75696 KB Output is correct
31 Correct 1031 ms 114748 KB Output is correct
32 Correct 74 ms 79816 KB Output is correct
33 Correct 786 ms 98392 KB Output is correct
34 Correct 1059 ms 115528 KB Output is correct
35 Correct 989 ms 109760 KB Output is correct
36 Correct 711 ms 98908 KB Output is correct
37 Correct 590 ms 100860 KB Output is correct
38 Correct 412 ms 94740 KB Output is correct
39 Correct 343 ms 95500 KB Output is correct
40 Correct 349 ms 93632 KB Output is correct
41 Correct 754 ms 102848 KB Output is correct
42 Correct 731 ms 107892 KB Output is correct
43 Correct 76 ms 81468 KB Output is correct
44 Correct 706 ms 102336 KB Output is correct
45 Correct 675 ms 98844 KB Output is correct
46 Correct 658 ms 96704 KB Output is correct
47 Correct 309 ms 101052 KB Output is correct
48 Correct 298 ms 100128 KB Output is correct
49 Correct 391 ms 103908 KB Output is correct
50 Correct 425 ms 108444 KB Output is correct
51 Correct 408 ms 101432 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3181 ms 299604 KB Output is correct
2 Correct 2209 ms 243372 KB Output is correct
3 Correct 1309 ms 228784 KB Output is correct
4 Correct 3102 ms 288004 KB Output is correct
5 Correct 1970 ms 229704 KB Output is correct
6 Correct 2387 ms 242036 KB Output is correct
7 Correct 1466 ms 235388 KB Output is correct
8 Correct 3381 ms 306912 KB Output is correct
9 Correct 3533 ms 283100 KB Output is correct
10 Correct 2832 ms 276956 KB Output is correct
11 Correct 2159 ms 255784 KB Output is correct
12 Correct 2408 ms 269668 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 75352 KB Output is correct
2 Correct 19 ms 75356 KB Output is correct
3 Correct 21 ms 75352 KB Output is correct
4 Correct 22 ms 75356 KB Output is correct
5 Correct 21 ms 75608 KB Output is correct
6 Correct 21 ms 75612 KB Output is correct
7 Correct 21 ms 75740 KB Output is correct
8 Correct 23 ms 75612 KB Output is correct
9 Correct 22 ms 75608 KB Output is correct
10 Correct 27 ms 75608 KB Output is correct
11 Correct 21 ms 75612 KB Output is correct
12 Correct 25 ms 75612 KB Output is correct
13 Correct 21 ms 75624 KB Output is correct
14 Correct 22 ms 75612 KB Output is correct
15 Correct 21 ms 75580 KB Output is correct
16 Correct 24 ms 75612 KB Output is correct
17 Correct 27 ms 75752 KB Output is correct
18 Correct 21 ms 75612 KB Output is correct
19 Correct 22 ms 75512 KB Output is correct
20 Correct 21 ms 75612 KB Output is correct
21 Correct 20 ms 75612 KB Output is correct
22 Correct 23 ms 75504 KB Output is correct
23 Correct 20 ms 75864 KB Output is correct
24 Correct 26 ms 75612 KB Output is correct
25 Correct 22 ms 75768 KB Output is correct
26 Correct 21 ms 75608 KB Output is correct
27 Correct 25 ms 75516 KB Output is correct
28 Correct 23 ms 75608 KB Output is correct
29 Correct 22 ms 75600 KB Output is correct
30 Correct 23 ms 75696 KB Output is correct
31 Correct 1031 ms 114748 KB Output is correct
32 Correct 74 ms 79816 KB Output is correct
33 Correct 786 ms 98392 KB Output is correct
34 Correct 1059 ms 115528 KB Output is correct
35 Correct 989 ms 109760 KB Output is correct
36 Correct 711 ms 98908 KB Output is correct
37 Correct 590 ms 100860 KB Output is correct
38 Correct 412 ms 94740 KB Output is correct
39 Correct 343 ms 95500 KB Output is correct
40 Correct 349 ms 93632 KB Output is correct
41 Correct 754 ms 102848 KB Output is correct
42 Correct 731 ms 107892 KB Output is correct
43 Correct 76 ms 81468 KB Output is correct
44 Correct 706 ms 102336 KB Output is correct
45 Correct 675 ms 98844 KB Output is correct
46 Correct 658 ms 96704 KB Output is correct
47 Correct 309 ms 101052 KB Output is correct
48 Correct 298 ms 100128 KB Output is correct
49 Correct 391 ms 103908 KB Output is correct
50 Correct 425 ms 108444 KB Output is correct
51 Correct 408 ms 101432 KB Output is correct
52 Correct 362 ms 105456 KB Output is correct
53 Correct 377 ms 103876 KB Output is correct
54 Correct 695 ms 119672 KB Output is correct
55 Correct 666 ms 108316 KB Output is correct
56 Correct 634 ms 108844 KB Output is correct
57 Correct 833 ms 107600 KB Output is correct
58 Correct 585 ms 110388 KB Output is correct
59 Correct 538 ms 110124 KB Output is correct
60 Correct 703 ms 111576 KB Output is correct
61 Correct 74 ms 87844 KB Output is correct
62 Correct 340 ms 106692 KB Output is correct
63 Correct 523 ms 114768 KB Output is correct
64 Correct 616 ms 115808 KB Output is correct
65 Correct 786 ms 115476 KB Output is correct
66 Correct 866 ms 108128 KB Output is correct
67 Correct 148 ms 88128 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 75352 KB Output is correct
2 Correct 19 ms 75356 KB Output is correct
3 Correct 21 ms 75352 KB Output is correct
4 Correct 22 ms 75356 KB Output is correct
5 Correct 21 ms 75608 KB Output is correct
6 Correct 21 ms 75612 KB Output is correct
7 Correct 21 ms 75740 KB Output is correct
8 Correct 23 ms 75612 KB Output is correct
9 Correct 22 ms 75608 KB Output is correct
10 Correct 27 ms 75608 KB Output is correct
11 Correct 21 ms 75612 KB Output is correct
12 Correct 25 ms 75612 KB Output is correct
13 Correct 21 ms 75624 KB Output is correct
14 Correct 22 ms 75612 KB Output is correct
15 Correct 21 ms 75580 KB Output is correct
16 Correct 24 ms 75612 KB Output is correct
17 Correct 27 ms 75752 KB Output is correct
18 Correct 21 ms 75612 KB Output is correct
19 Correct 22 ms 75512 KB Output is correct
20 Correct 21 ms 75612 KB Output is correct
21 Correct 20 ms 75612 KB Output is correct
22 Correct 23 ms 75504 KB Output is correct
23 Correct 20 ms 75864 KB Output is correct
24 Correct 26 ms 75612 KB Output is correct
25 Correct 22 ms 75768 KB Output is correct
26 Correct 21 ms 75608 KB Output is correct
27 Correct 25 ms 75516 KB Output is correct
28 Correct 23 ms 75608 KB Output is correct
29 Correct 22 ms 75600 KB Output is correct
30 Correct 23 ms 75696 KB Output is correct
31 Correct 1031 ms 114748 KB Output is correct
32 Correct 74 ms 79816 KB Output is correct
33 Correct 786 ms 98392 KB Output is correct
34 Correct 1059 ms 115528 KB Output is correct
35 Correct 989 ms 109760 KB Output is correct
36 Correct 711 ms 98908 KB Output is correct
37 Correct 590 ms 100860 KB Output is correct
38 Correct 412 ms 94740 KB Output is correct
39 Correct 343 ms 95500 KB Output is correct
40 Correct 349 ms 93632 KB Output is correct
41 Correct 754 ms 102848 KB Output is correct
42 Correct 731 ms 107892 KB Output is correct
43 Correct 76 ms 81468 KB Output is correct
44 Correct 706 ms 102336 KB Output is correct
45 Correct 675 ms 98844 KB Output is correct
46 Correct 658 ms 96704 KB Output is correct
47 Correct 309 ms 101052 KB Output is correct
48 Correct 298 ms 100128 KB Output is correct
49 Correct 391 ms 103908 KB Output is correct
50 Correct 425 ms 108444 KB Output is correct
51 Correct 408 ms 101432 KB Output is correct
52 Correct 3181 ms 299604 KB Output is correct
53 Correct 2209 ms 243372 KB Output is correct
54 Correct 1309 ms 228784 KB Output is correct
55 Correct 3102 ms 288004 KB Output is correct
56 Correct 1970 ms 229704 KB Output is correct
57 Correct 2387 ms 242036 KB Output is correct
58 Correct 1466 ms 235388 KB Output is correct
59 Correct 3381 ms 306912 KB Output is correct
60 Correct 3533 ms 283100 KB Output is correct
61 Correct 2832 ms 276956 KB Output is correct
62 Correct 2159 ms 255784 KB Output is correct
63 Correct 2408 ms 269668 KB Output is correct
64 Execution timed out 5087 ms 302056 KB Time limit exceeded
65 Halted 0 ms 0 KB -