oj.uz

답안 #1029442

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029442 2024-07-20T21:42:16 Z erray 새 집 (APIO18_new_home) C++17
12 / 100
 5000 ms 540024 KB 
// author: erray
#include <bits/stdc++.h>

#ifdef DEBUG
  #include "debug.h"
#else
  #define debug(...) void(37)
#endif

using namespace std;

template<typename T> 
T PT(T* x) {
  const static T n = T{};
  return (x == NULL ? n : *x);
}

constexpr int inf = int(3e8);
struct node {
  node* L = NULL, *R = NULL;
  int mx = -inf;
  multiset<int> acts;
  void add(int x) {
    acts.insert(x);
    mx = *acts.rbegin();
  }
  void rem(int x) {
    acts.erase(acts.find(x));
    mx = (acts.empty() ? -inf : *acts.rbegin());
  }
  void pull() {
    mx = max(PT(L).mx, PT(R).mx); 
  }
  void branch() {
    if (L == NULL) L = new node{};
    if (R == NULL) R = new node{};
  }
};

int get(node* v, int l, int r, int ll, int rr) {
  if (l >= ll && rr >= r) {
    return v->mx;
  }
  int mid = (l + r) >> 1;
  int res = -inf;
  if (ll <= mid && v->L != NULL) {
    res = max(res, get(v->L, l, mid, ll, rr));
  }
  if (mid < rr && v->R != NULL) {
    res = max(res, get(v->R, mid + 1, r, ll, rr));
  }
  return res;
}

struct SegTree {
  void modify(node* v, int l, int r, int p, int x, int t) {
    if (l == r) {
      if (t) {
        v->add(x);
      } else {
        v->rem(x);
      }
      return;
    }
    v->branch();
    int mid = (l + r) >> 1;
    if (p <= mid) {
      modify(v->L, l, mid, p, x, t);
    } else {
      modify(v->R, mid + 1, r, p, x, t);
    }
    v->pull();
  }
  int get(node* v, int l, int r, int ll, int rr) {
    if (l >= ll && rr >= r) {
      return v->mx;
    }
    int mid = (l + r) >> 1;
    int res = -inf;
    if (ll <= mid && v->L != NULL) {
      res = max(res, get(v->L, l, mid, ll, rr));
    }
    if (mid < rr && v->R != NULL) {
      res = max(res, get(v->R, mid + 1, r, ll, rr));
    }
    return res;
  }
  int mn, mx;
  node* root;
  SegTree(int _mn, int _mx) : mn(_mn), mx(_mx) {
    root = new 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);
  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 456 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 8 ms 5168 KB Output is correct
7 Correct 8 ms 588 KB Output is correct
8 Correct 10 ms 2836 KB Output is correct
9 Correct 14 ms 652 KB Output is correct
10 Correct 9 ms 5860 KB Output is correct
11 Correct 7 ms 2140 KB Output is correct
12 Correct 7 ms 4956 KB Output is correct
13 Correct 4 ms 980 KB Output is correct
14 Correct 5 ms 2648 KB Output is correct
15 Correct 10 ms 2260 KB Output is correct
16 Correct 12 ms 1884 KB Output is correct
17 Correct 9 ms 2908 KB Output is correct
18 Correct 11 ms 2212 KB Output is correct
19 Correct 12 ms 1884 KB Output is correct
20 Correct 8 ms 2820 KB Output is correct
21 Correct 13 ms 652 KB Output is correct
22 Correct 14 ms 564 KB Output is correct
23 Correct 13 ms 1624 KB Output is correct
24 Correct 12 ms 2392 KB Output is correct
25 Correct 9 ms 3164 KB Output is correct
26 Correct 6 ms 3416 KB Output is correct
27 Correct 6 ms 348 KB Output is correct
28 Correct 6 ms 2396 KB Output is correct
29 Correct 5 ms 2408 KB Output is correct
30 Correct 3 ms 1372 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 456 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 8 ms 5168 KB Output is correct
7 Correct 8 ms 588 KB Output is correct
8 Correct 10 ms 2836 KB Output is correct
9 Correct 14 ms 652 KB Output is correct
10 Correct 9 ms 5860 KB Output is correct
11 Correct 7 ms 2140 KB Output is correct
12 Correct 7 ms 4956 KB Output is correct
13 Correct 4 ms 980 KB Output is correct
14 Correct 5 ms 2648 KB Output is correct
15 Correct 10 ms 2260 KB Output is correct
16 Correct 12 ms 1884 KB Output is correct
17 Correct 9 ms 2908 KB Output is correct
18 Correct 11 ms 2212 KB Output is correct
19 Correct 12 ms 1884 KB Output is correct
20 Correct 8 ms 2820 KB Output is correct
21 Correct 13 ms 652 KB Output is correct
22 Correct 14 ms 564 KB Output is correct
23 Correct 13 ms 1624 KB Output is correct
24 Correct 12 ms 2392 KB Output is correct
25 Correct 9 ms 3164 KB Output is correct
26 Correct 6 ms 3416 KB Output is correct
27 Correct 6 ms 348 KB Output is correct
28 Correct 6 ms 2396 KB Output is correct
29 Correct 5 ms 2408 KB Output is correct
30 Correct 3 ms 1372 KB Output is correct
31 Correct 2257 ms 517112 KB Output is correct
32 Correct 48 ms 4824 KB Output is correct
33 Correct 1677 ms 527032 KB Output is correct
34 Correct 2224 ms 496472 KB Output is correct
35 Correct 1844 ms 531916 KB Output is correct
36 Correct 1664 ms 540024 KB Output is correct
37 Correct 1242 ms 516916 KB Output is correct
38 Correct 1229 ms 523740 KB Output is correct
39 Correct 1014 ms 504808 KB Output is correct
40 Correct 1030 ms 516728 KB Output is correct
41 Correct 2975 ms 273876 KB Output is correct
42 Correct 3983 ms 274728 KB Output is correct
43 Correct 63 ms 6356 KB Output is correct
44 Correct 2494 ms 274824 KB Output is correct
45 Correct 1351 ms 275396 KB Output is correct
46 Correct 935 ms 274692 KB Output is correct
47 Correct 673 ms 215884 KB Output is correct
48 Correct 654 ms 236808 KB Output is correct
49 Correct 831 ms 257820 KB Output is correct
50 Correct 2224 ms 244424 KB Output is correct
51 Correct 733 ms 264656 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 456 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 8 ms 5168 KB Output is correct
7 Correct 8 ms 588 KB Output is correct
8 Correct 10 ms 2836 KB Output is correct
9 Correct 14 ms 652 KB Output is correct
10 Correct 9 ms 5860 KB Output is correct
11 Correct 7 ms 2140 KB Output is correct
12 Correct 7 ms 4956 KB Output is correct
13 Correct 4 ms 980 KB Output is correct
14 Correct 5 ms 2648 KB Output is correct
15 Correct 10 ms 2260 KB Output is correct
16 Correct 12 ms 1884 KB Output is correct
17 Correct 9 ms 2908 KB Output is correct
18 Correct 11 ms 2212 KB Output is correct
19 Correct 12 ms 1884 KB Output is correct
20 Correct 8 ms 2820 KB Output is correct
21 Correct 13 ms 652 KB Output is correct
22 Correct 14 ms 564 KB Output is correct
23 Correct 13 ms 1624 KB Output is correct
24 Correct 12 ms 2392 KB Output is correct
25 Correct 9 ms 3164 KB Output is correct
26 Correct 6 ms 3416 KB Output is correct
27 Correct 6 ms 348 KB Output is correct
28 Correct 6 ms 2396 KB Output is correct
29 Correct 5 ms 2408 KB Output is correct
30 Correct 3 ms 1372 KB Output is correct
31 Correct 2257 ms 517112 KB Output is correct
32 Correct 48 ms 4824 KB Output is correct
33 Correct 1677 ms 527032 KB Output is correct
34 Correct 2224 ms 496472 KB Output is correct
35 Correct 1844 ms 531916 KB Output is correct
36 Correct 1664 ms 540024 KB Output is correct
37 Correct 1242 ms 516916 KB Output is correct
38 Correct 1229 ms 523740 KB Output is correct
39 Correct 1014 ms 504808 KB Output is correct
40 Correct 1030 ms 516728 KB Output is correct
41 Correct 2975 ms 273876 KB Output is correct
42 Correct 3983 ms 274728 KB Output is correct
43 Correct 63 ms 6356 KB Output is correct
44 Correct 2494 ms 274824 KB Output is correct
45 Correct 1351 ms 275396 KB Output is correct
46 Correct 935 ms 274692 KB Output is correct
47 Correct 673 ms 215884 KB Output is correct
48 Correct 654 ms 236808 KB Output is correct
49 Correct 831 ms 257820 KB Output is correct
50 Correct 2224 ms 244424 KB Output is correct
51 Correct 733 ms 264656 KB Output is correct
52 Execution timed out 5053 ms 11624 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 456 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 532 KB Output is correct
6 Correct 8 ms 5168 KB Output is correct
7 Correct 8 ms 588 KB Output is correct
8 Correct 10 ms 2836 KB Output is correct
9 Correct 14 ms 652 KB Output is correct
10 Correct 9 ms 5860 KB Output is correct
11 Correct 7 ms 2140 KB Output is correct
12 Correct 7 ms 4956 KB Output is correct
13 Correct 4 ms 980 KB Output is correct
14 Correct 5 ms 2648 KB Output is correct
15 Correct 10 ms 2260 KB Output is correct
16 Correct 12 ms 1884 KB Output is correct
17 Correct 9 ms 2908 KB Output is correct
18 Correct 11 ms 2212 KB Output is correct
19 Correct 12 ms 1884 KB Output is correct
20 Correct 8 ms 2820 KB Output is correct
21 Correct 13 ms 652 KB Output is correct
22 Correct 14 ms 564 KB Output is correct
23 Correct 13 ms 1624 KB Output is correct
24 Correct 12 ms 2392 KB Output is correct
25 Correct 9 ms 3164 KB Output is correct
26 Correct 6 ms 3416 KB Output is correct
27 Correct 6 ms 348 KB Output is correct
28 Correct 6 ms 2396 KB Output is correct
29 Correct 5 ms 2408 KB Output is correct
30 Correct 3 ms 1372 KB Output is correct
31 Correct 2257 ms 517112 KB Output is correct
32 Correct 48 ms 4824 KB Output is correct
33 Correct 1677 ms 527032 KB Output is correct
34 Correct 2224 ms 496472 KB Output is correct
35 Correct 1844 ms 531916 KB Output is correct
36 Correct 1664 ms 540024 KB Output is correct
37 Correct 1242 ms 516916 KB Output is correct
38 Correct 1229 ms 523740 KB Output is correct
39 Correct 1014 ms 504808 KB Output is correct
40 Correct 1030 ms 516728 KB Output is correct
41 Correct 2975 ms 273876 KB Output is correct
42 Correct 3983 ms 274728 KB Output is correct
43 Correct 63 ms 6356 KB Output is correct
44 Correct 2494 ms 274824 KB Output is correct
45 Correct 1351 ms 275396 KB Output is correct
46 Correct 935 ms 274692 KB Output is correct
47 Correct 673 ms 215884 KB Output is correct
48 Correct 654 ms 236808 KB Output is correct
49 Correct 831 ms 257820 KB Output is correct
50 Correct 2224 ms 244424 KB Output is correct
51 Correct 733 ms 264656 KB Output is correct
52 Execution timed out 5034 ms 37776 KB Time limit exceeded
53 Halted 0 ms 0 KB -