oj.uz

답안 #1029604

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029604 2024-07-21T05:42:17 Z erray 새 집 (APIO18_new_home) C++17
47 / 100
 1482 ms 552224 KB 
// author: erray
#include <bits/stdc++.h>
 
#ifdef DEBUG
  #include "debug.h"
#else
  #define debug(...) void(37)
#endif
 
using namespace std;
 
vector<multiset<int>> mss;
constexpr int NODES = int(1e7);

constexpr int inf = int(3e8);
struct node {
  int L, R;
  int mx;
  int multiset_id;
  void add(int x) {
    if (multiset_id == -1) {
      multiset_id = int(mss.size());
      mss.emplace_back();
    }
    mss[multiset_id].insert(x);
    mx = *mss[multiset_id].rbegin();
  }
  void rem(int x) {
    mss[multiset_id].erase(mss[multiset_id].find(x));
    mx = (mss[multiset_id].empty() ? -inf : *mss[multiset_id].rbegin());
  }
  void init() {
    L = 0, R = 0;
    mx = -inf;
    multiset_id = -1;
  }
};

node nodes[NODES];
int last_node = 1;

void pull(node& x) {
  x.mx = max(nodes[x.L].mx, nodes[x.R].mx);
}
void branch(node& x) {
  if (x.L == 0) {
    nodes[last_node].init();
    x.L = last_node++;
  } 
  if (x.R == 0) {
    nodes[last_node].init();
    x.R = last_node++;
  } 
}
 
struct SegTree {
  void modify(int v, int l, int r, int p, int x, int t) {
    if (l == r) {
      if (t) {
        nodes[v].add(x);
      } else {
        nodes[v].rem(x);
      }
      return;
    }
    branch(nodes[v]);
    int mid = (l + r) >> 1;
    if (p <= mid) {
      modify(nodes[v].L, l, mid, p, x, t);
    } else {
      modify(nodes[v].R, mid + 1, r, p, x, t);
    }
    pull(nodes[v]);
  }
  int get(int v, int l, int r, int ll, int rr) {
    if (l >= ll && rr >= r) {
      return nodes[v].mx;
    }
    int mid = (l + r) >> 1;
    int res = -inf;
    if (ll <= mid && nodes[v].R != 0) {
      res = max(res, get(nodes[v].L, l, mid, ll, rr));
    }
    if (mid < rr && nodes[v].R != 0) {
      res = max(res, get(nodes[v].R, mid + 1, r, ll, rr));
    }
    return res;
  }
  int mn, mx;
  int root;
  SegTree(int _mn, int _mx) : mn(_mn), mx(_mx) {
    nodes[last_node].init();
    root = last_node++;
  }
  void modify(int p, int x, int t) {
    modify(root, mn, mx, p, x, t);
  }
  int get(int ll, int rr) {
    return get(root, mn, mx, ll, rr);
  }
};
 
constexpr int POS = int(1e8);
 
int main() {
 
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  nodes[0].init();
  int N, K, Q;
  cin >> N >> K >> Q;
  vector<int> X(N), T(N), A(N), B(N);
  for (int i = 0; i < N; ++i) {
    cin >> X[i] >> T[i] >> A[i] >> B[i];
    --T[i];
  }
  vector<int> L(Q), Y(Q);
  for (int i = 0; i < Q; ++i) {
    cin >> L[i] >> Y[i];
  }
  vector<array<int, 2>> events;
  for (int i = 0; i < N; ++i) {
    events.push_back({A[i], i});
    events.push_back({B[i] + 1, ~i}); 
  }
  for (int i = 0; i < Q; ++i) {
    events.push_back({Y[i], i + N});
  }
  debug(events);
  sort(events.begin(), events.end());
  SegTree pref(1, POS), suf(1, POS);
  vector<map<int, int>> acts(K);
  auto Updates = [&](int t, int x) -> vector<array<int, 3>> {
    debug(t, x);
    if (acts[t].empty()) {
      return {};
    }
    vector<array<int, 3>> res;
    auto it = acts[t].lower_bound(x);
    vector<array<int, 2>> regulars;
    if (it != acts[t].end() && it->first == x) {
       if (next(it) == acts[t].end()) {
         res.push_back({t, POS, POS - x});
       } else {
         regulars.push_back({it->first, next(it)->first});
       }
       if (it == acts[t].begin()) {
         res.push_back({t, 1, x - 1});
       } else {
         regulars.push_back({prev(it)->first, it->first});
       }
    } else {
      if (it == acts[t].end()) {
        res.push_back({t, POS, POS - prev(it)->first});
      } else if (it == acts[t].begin()) {
        res.push_back({t, 1, it->first - 1});
      } else {
        regulars.push_back({prev(it)->first, it->first});
      }
    }
    for (auto[l, r] : regulars) {
      int dist = (r - l) / 2, mid = (l + r) / 2;
      if ((l + r) % 2 == 1) {
        res.push_back({t, mid, dist});
        res.push_back({t, mid + 1, dist});
      } else {
        res.push_back({t, mid, dist}); 
      }
    }
    return res;
  };
  auto Rem = [&](vector<array<int, 3>> a) {
    for (auto[t, x, v] : a) {
      pref.modify(x, v + x, 0);
      suf.modify(x, v - x, 0);
    }
  };
  auto Add = [&](vector<array<int, 3>> a) {
    for (auto[t, x, v] : a) {
      pref.modify(x, v + x, 1);
      suf.modify(x, v - x, 1);
    }
  };
  
  vector<int> ans(Q);
  int exists = 0;
  for (auto[foo, t] : events) {
    debug(foo, t);
    if (t < 0) {
      t = ~t;
      debug(T[t]);
      if (--acts[T[t]][X[t]] == 0) {
        Rem(Updates(T[t], X[t])); 
        acts[T[t]].erase(X[t]);
        Add(Updates(T[t], X[t]));
      }
      exists -= (acts[T[t]].empty());    
    } else if (t < N) {
      exists += (acts[T[t]].empty());
      if (!acts[T[t]].count(X[t])) {
        Rem(Updates(T[t], X[t])); 
        acts[T[t]][X[t]] = 0;
        Add(Updates(T[t], X[t]));
      } 
      acts[T[t]][X[t]]++;
    } else {
      t -= N;
      ans[t] = (exists == K ? max(pref.get(1, L[t]) - L[t], suf.get(L[t], POS) + L[t]) : -1);
    }
  }
  for (int i = 0; i < Q; ++i) {
    cout << ans[i] << '\n';
  }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 2908 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 3 ms 2908 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 3 ms 2908 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 3 ms 2900 KB Output is correct
26 Correct 3 ms 2908 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 2648 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 2908 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 3 ms 2908 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 3 ms 2908 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 3 ms 2900 KB Output is correct
26 Correct 3 ms 2908 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 2648 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 635 ms 141744 KB Output is correct
32 Correct 48 ms 4824 KB Output is correct
33 Correct 593 ms 137724 KB Output is correct
34 Correct 565 ms 130600 KB Output is correct
35 Correct 649 ms 145292 KB Output is correct
36 Correct 698 ms 146956 KB Output is correct
37 Correct 476 ms 133268 KB Output is correct
38 Correct 504 ms 134808 KB Output is correct
39 Correct 391 ms 130192 KB Output is correct
40 Correct 422 ms 133260 KB Output is correct
41 Correct 367 ms 72908 KB Output is correct
42 Correct 337 ms 72992 KB Output is correct
43 Correct 44 ms 6360 KB Output is correct
44 Correct 353 ms 73400 KB Output is correct
45 Correct 323 ms 73392 KB Output is correct
46 Correct 297 ms 73256 KB Output is correct
47 Correct 229 ms 58292 KB Output is correct
48 Correct 221 ms 63412 KB Output is correct
49 Correct 257 ms 68784 KB Output is correct
50 Correct 257 ms 65456 KB Output is correct
51 Correct 275 ms 70520 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1482 ms 552224 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1096 ms 501644 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 2908 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 3 ms 2908 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 3 ms 2908 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 3 ms 2900 KB Output is correct
26 Correct 3 ms 2908 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 2648 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 635 ms 141744 KB Output is correct
32 Correct 48 ms 4824 KB Output is correct
33 Correct 593 ms 137724 KB Output is correct
34 Correct 565 ms 130600 KB Output is correct
35 Correct 649 ms 145292 KB Output is correct
36 Correct 698 ms 146956 KB Output is correct
37 Correct 476 ms 133268 KB Output is correct
38 Correct 504 ms 134808 KB Output is correct
39 Correct 391 ms 130192 KB Output is correct
40 Correct 422 ms 133260 KB Output is correct
41 Correct 367 ms 72908 KB Output is correct
42 Correct 337 ms 72992 KB Output is correct
43 Correct 44 ms 6360 KB Output is correct
44 Correct 353 ms 73400 KB Output is correct
45 Correct 323 ms 73392 KB Output is correct
46 Correct 297 ms 73256 KB Output is correct
47 Correct 229 ms 58292 KB Output is correct
48 Correct 221 ms 63412 KB Output is correct
49 Correct 257 ms 68784 KB Output is correct
50 Correct 257 ms 65456 KB Output is correct
51 Correct 275 ms 70520 KB Output is correct
52 Correct 199 ms 23496 KB Output is correct
53 Correct 191 ms 14792 KB Output is correct
54 Correct 390 ms 69556 KB Output is correct
55 Correct 337 ms 59060 KB Output is correct
56 Correct 303 ms 51648 KB Output is correct
57 Correct 362 ms 68976 KB Output is correct
58 Correct 339 ms 57784 KB Output is correct
59 Correct 335 ms 50068 KB Output is correct
60 Correct 369 ms 67740 KB Output is correct
61 Correct 171 ms 23244 KB Output is correct
62 Correct 199 ms 23752 KB Output is correct
63 Correct 351 ms 48572 KB Output is correct
64 Correct 398 ms 59840 KB Output is correct
65 Correct 447 ms 67256 KB Output is correct
66 Correct 430 ms 72880 KB Output is correct
67 Correct 335 ms 8048 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 3 ms 2908 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 3 ms 2908 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 2908 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 3 ms 2908 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2652 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 3 ms 2900 KB Output is correct
26 Correct 3 ms 2908 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 2 ms 2648 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 1 ms 2652 KB Output is correct
31 Correct 635 ms 141744 KB Output is correct
32 Correct 48 ms 4824 KB Output is correct
33 Correct 593 ms 137724 KB Output is correct
34 Correct 565 ms 130600 KB Output is correct
35 Correct 649 ms 145292 KB Output is correct
36 Correct 698 ms 146956 KB Output is correct
37 Correct 476 ms 133268 KB Output is correct
38 Correct 504 ms 134808 KB Output is correct
39 Correct 391 ms 130192 KB Output is correct
40 Correct 422 ms 133260 KB Output is correct
41 Correct 367 ms 72908 KB Output is correct
42 Correct 337 ms 72992 KB Output is correct
43 Correct 44 ms 6360 KB Output is correct
44 Correct 353 ms 73400 KB Output is correct
45 Correct 323 ms 73392 KB Output is correct
46 Correct 297 ms 73256 KB Output is correct
47 Correct 229 ms 58292 KB Output is correct
48 Correct 221 ms 63412 KB Output is correct
49 Correct 257 ms 68784 KB Output is correct
50 Correct 257 ms 65456 KB Output is correct
51 Correct 275 ms 70520 KB Output is correct
52 Runtime error 1482 ms 552224 KB Execution killed with signal 11
53 Halted 0 ms 0 KB -