oj.uz

답안 #936605

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
936605 2024-03-02T10:28:42 Z rxlfd314 새 집 (APIO18_new_home) C++17
12 / 100
 5000 ms 502732 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].count(v))
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 112980 KB Output is correct
2 Correct 24 ms 112988 KB Output is correct
3 Correct 22 ms 112988 KB Output is correct
4 Correct 23 ms 112988 KB Output is correct
5 Correct 23 ms 113156 KB Output is correct
6 Correct 27 ms 113244 KB Output is correct
7 Correct 24 ms 113244 KB Output is correct
8 Correct 24 ms 113244 KB Output is correct
9 Correct 26 ms 113244 KB Output is correct
10 Correct 25 ms 113236 KB Output is correct
11 Correct 26 ms 113236 KB Output is correct
12 Correct 24 ms 112988 KB Output is correct
13 Correct 23 ms 112988 KB Output is correct
14 Correct 24 ms 112984 KB Output is correct
15 Correct 24 ms 113244 KB Output is correct
16 Correct 24 ms 113496 KB Output is correct
17 Correct 24 ms 113240 KB Output is correct
18 Correct 24 ms 113244 KB Output is correct
19 Correct 25 ms 113244 KB Output is correct
20 Correct 24 ms 113240 KB Output is correct
21 Correct 24 ms 113244 KB Output is correct
22 Correct 24 ms 113240 KB Output is correct
23 Correct 24 ms 113244 KB Output is correct
24 Correct 25 ms 113328 KB Output is correct
25 Correct 24 ms 113104 KB Output is correct
26 Correct 24 ms 112984 KB Output is correct
27 Correct 25 ms 112988 KB Output is correct
28 Correct 24 ms 112988 KB Output is correct
29 Correct 24 ms 113148 KB Output is correct
30 Correct 23 ms 113096 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 112980 KB Output is correct
2 Correct 24 ms 112988 KB Output is correct
3 Correct 22 ms 112988 KB Output is correct
4 Correct 23 ms 112988 KB Output is correct
5 Correct 23 ms 113156 KB Output is correct
6 Correct 27 ms 113244 KB Output is correct
7 Correct 24 ms 113244 KB Output is correct
8 Correct 24 ms 113244 KB Output is correct
9 Correct 26 ms 113244 KB Output is correct
10 Correct 25 ms 113236 KB Output is correct
11 Correct 26 ms 113236 KB Output is correct
12 Correct 24 ms 112988 KB Output is correct
13 Correct 23 ms 112988 KB Output is correct
14 Correct 24 ms 112984 KB Output is correct
15 Correct 24 ms 113244 KB Output is correct
16 Correct 24 ms 113496 KB Output is correct
17 Correct 24 ms 113240 KB Output is correct
18 Correct 24 ms 113244 KB Output is correct
19 Correct 25 ms 113244 KB Output is correct
20 Correct 24 ms 113240 KB Output is correct
21 Correct 24 ms 113244 KB Output is correct
22 Correct 24 ms 113240 KB Output is correct
23 Correct 24 ms 113244 KB Output is correct
24 Correct 25 ms 113328 KB Output is correct
25 Correct 24 ms 113104 KB Output is correct
26 Correct 24 ms 112984 KB Output is correct
27 Correct 25 ms 112988 KB Output is correct
28 Correct 24 ms 112988 KB Output is correct
29 Correct 24 ms 113148 KB Output is correct
30 Correct 23 ms 113096 KB Output is correct
31 Correct 1908 ms 159420 KB Output is correct
32 Correct 73 ms 118388 KB Output is correct
33 Correct 611 ms 124352 KB Output is correct
34 Correct 1550 ms 134704 KB Output is correct
35 Correct 1418 ms 149400 KB Output is correct
36 Correct 653 ms 132056 KB Output is correct
37 Correct 507 ms 119936 KB Output is correct
38 Correct 356 ms 117968 KB Output is correct
39 Correct 331 ms 118228 KB Output is correct
40 Correct 323 ms 117452 KB Output is correct
41 Correct 647 ms 117452 KB Output is correct
42 Correct 620 ms 117692 KB Output is correct
43 Correct 77 ms 118228 KB Output is correct
44 Correct 574 ms 117964 KB Output is correct
45 Correct 508 ms 118020 KB Output is correct
46 Correct 422 ms 118728 KB Output is correct
47 Correct 258 ms 118544 KB Output is correct
48 Correct 243 ms 117880 KB Output is correct
49 Correct 331 ms 117960 KB Output is correct
50 Correct 480 ms 117836 KB Output is correct
51 Correct 332 ms 117972 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 112980 KB Output is correct
2 Correct 24 ms 112988 KB Output is correct
3 Correct 22 ms 112988 KB Output is correct
4 Correct 23 ms 112988 KB Output is correct
5 Correct 23 ms 113156 KB Output is correct
6 Correct 27 ms 113244 KB Output is correct
7 Correct 24 ms 113244 KB Output is correct
8 Correct 24 ms 113244 KB Output is correct
9 Correct 26 ms 113244 KB Output is correct
10 Correct 25 ms 113236 KB Output is correct
11 Correct 26 ms 113236 KB Output is correct
12 Correct 24 ms 112988 KB Output is correct
13 Correct 23 ms 112988 KB Output is correct
14 Correct 24 ms 112984 KB Output is correct
15 Correct 24 ms 113244 KB Output is correct
16 Correct 24 ms 113496 KB Output is correct
17 Correct 24 ms 113240 KB Output is correct
18 Correct 24 ms 113244 KB Output is correct
19 Correct 25 ms 113244 KB Output is correct
20 Correct 24 ms 113240 KB Output is correct
21 Correct 24 ms 113244 KB Output is correct
22 Correct 24 ms 113240 KB Output is correct
23 Correct 24 ms 113244 KB Output is correct
24 Correct 25 ms 113328 KB Output is correct
25 Correct 24 ms 113104 KB Output is correct
26 Correct 24 ms 112984 KB Output is correct
27 Correct 25 ms 112988 KB Output is correct
28 Correct 24 ms 112988 KB Output is correct
29 Correct 24 ms 113148 KB Output is correct
30 Correct 23 ms 113096 KB Output is correct
31 Correct 1908 ms 159420 KB Output is correct
32 Correct 73 ms 118388 KB Output is correct
33 Correct 611 ms 124352 KB Output is correct
34 Correct 1550 ms 134704 KB Output is correct
35 Correct 1418 ms 149400 KB Output is correct
36 Correct 653 ms 132056 KB Output is correct
37 Correct 507 ms 119936 KB Output is correct
38 Correct 356 ms 117968 KB Output is correct
39 Correct 331 ms 118228 KB Output is correct
40 Correct 323 ms 117452 KB Output is correct
41 Correct 647 ms 117452 KB Output is correct
42 Correct 620 ms 117692 KB Output is correct
43 Correct 77 ms 118228 KB Output is correct
44 Correct 574 ms 117964 KB Output is correct
45 Correct 508 ms 118020 KB Output is correct
46 Correct 422 ms 118728 KB Output is correct
47 Correct 258 ms 118544 KB Output is correct
48 Correct 243 ms 117880 KB Output is correct
49 Correct 331 ms 117960 KB Output is correct
50 Correct 480 ms 117836 KB Output is correct
51 Correct 332 ms 117972 KB Output is correct
52 Correct 589 ms 168164 KB Output is correct
53 Correct 595 ms 140656 KB Output is correct
54 Correct 1771 ms 182068 KB Output is correct
55 Correct 692 ms 137392 KB Output is correct
56 Correct 670 ms 145724 KB Output is correct
57 Correct 677 ms 125540 KB Output is correct
58 Correct 700 ms 137300 KB Output is correct
59 Correct 721 ms 146052 KB Output is correct
60 Correct 714 ms 126588 KB Output is correct
61 Execution timed out 5020 ms 127420 KB Time limit exceeded
62 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 112980 KB Output is correct
2 Correct 24 ms 112988 KB Output is correct
3 Correct 22 ms 112988 KB Output is correct
4 Correct 23 ms 112988 KB Output is correct
5 Correct 23 ms 113156 KB Output is correct
6 Correct 27 ms 113244 KB Output is correct
7 Correct 24 ms 113244 KB Output is correct
8 Correct 24 ms 113244 KB Output is correct
9 Correct 26 ms 113244 KB Output is correct
10 Correct 25 ms 113236 KB Output is correct
11 Correct 26 ms 113236 KB Output is correct
12 Correct 24 ms 112988 KB Output is correct
13 Correct 23 ms 112988 KB Output is correct
14 Correct 24 ms 112984 KB Output is correct
15 Correct 24 ms 113244 KB Output is correct
16 Correct 24 ms 113496 KB Output is correct
17 Correct 24 ms 113240 KB Output is correct
18 Correct 24 ms 113244 KB Output is correct
19 Correct 25 ms 113244 KB Output is correct
20 Correct 24 ms 113240 KB Output is correct
21 Correct 24 ms 113244 KB Output is correct
22 Correct 24 ms 113240 KB Output is correct
23 Correct 24 ms 113244 KB Output is correct
24 Correct 25 ms 113328 KB Output is correct
25 Correct 24 ms 113104 KB Output is correct
26 Correct 24 ms 112984 KB Output is correct
27 Correct 25 ms 112988 KB Output is correct
28 Correct 24 ms 112988 KB Output is correct
29 Correct 24 ms 113148 KB Output is correct
30 Correct 23 ms 113096 KB Output is correct
31 Correct 1908 ms 159420 KB Output is correct
32 Correct 73 ms 118388 KB Output is correct
33 Correct 611 ms 124352 KB Output is correct
34 Correct 1550 ms 134704 KB Output is correct
35 Correct 1418 ms 149400 KB Output is correct
36 Correct 653 ms 132056 KB Output is correct
37 Correct 507 ms 119936 KB Output is correct
38 Correct 356 ms 117968 KB Output is correct
39 Correct 331 ms 118228 KB Output is correct
40 Correct 323 ms 117452 KB Output is correct
41 Correct 647 ms 117452 KB Output is correct
42 Correct 620 ms 117692 KB Output is correct
43 Correct 77 ms 118228 KB Output is correct
44 Correct 574 ms 117964 KB Output is correct
45 Correct 508 ms 118020 KB Output is correct
46 Correct 422 ms 118728 KB Output is correct
47 Correct 258 ms 118544 KB Output is correct
48 Correct 243 ms 117880 KB Output is correct
49 Correct 331 ms 117960 KB Output is correct
50 Correct 480 ms 117836 KB Output is correct
51 Correct 332 ms 117972 KB Output is correct
52 Execution timed out 5070 ms 502732 KB Time limit exceeded
53 Halted 0 ms 0 KB -