oj.uz

답안 #560305

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
560305 2022-05-11T09:10:58 Z hoanghq2004 새 집 (APIO18_new_home) C++14
12 / 100
 4123 ms 1048576 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 3e5 + 10;

int n, k, q;
multiset <int> s[N];
int ans[N];
int cnt, nNode = 1;

void go(int& x) {
    if (!x) x = ++nNode;
}

struct node {
    int lhs, rhs;
    multiset <int> lft, rgt;
} st[N * 30];

int ok;

void upd(int id, int L, int R, int u, int v, int a, int b, int mode) {
    if (u > R || L > v) return;
    if (u <= L && R <= v) {
        if (a < 0) {
            if (mode > 0) st[id].lft.insert(b);
            else st[id].lft.erase(st[id].lft.find(b));
        } else {
            if (mode > 0) st[id].rgt.insert(b);
            else st[id].rgt.erase(st[id].rgt.find(b));
        }
        return;
    }
    int mid = L + R >> 1;
    go(st[id].lhs), go(st[id].rhs);
    upd(st[id].lhs, L, mid, u, v, a, b, mode);
    upd(st[id].rhs, mid + 1, R, u, v, a, b, mode);
}

void solve(int id, int L, int R, int x, int &ans) {
    if (st[id].rgt.size()) ans = max(ans, x / 2 + *(--st[id].rgt.end()));
    if (st[id].lft.size()) ans = max(ans, - x / 2 + *(--st[id].lft.end()));
    if (L == R) return;
    int mid = L + R >> 1;
    if (x <= mid) {
        if (st[id].lhs) solve(st[id].lhs, L, mid, x, ans);
    } else {
        if (st[id].rhs) solve(st[id].rhs, mid + 1, R, x, ans);
    }
}

void add(int t, int x) {
    cnt -= (s[t].size() == 2);
    int L = *(--s[t].upper_bound(x));
    int R = *s[t].upper_bound(x);
    upd(1, - 4e8, 4e8, L * 2, L + R, 1, - L, -1);
    upd(1, - 4e8, 4e8, L + R, R * 2, -1, R, -1);
    upd(1, - 4e8, 4e8, L * 2, L + x, 1, - L, 1);
    upd(1, - 4e8, 4e8, L + x, x * 2, -1, x, 1);
    upd(1, - 4e8, 4e8, x * 2, x + R, 1, - x, 1);
    upd(1, - 4e8, 4e8, x + R, R * 2, -1, R, 1);
    s[t].insert(x);
}

void rev(int t, int x) {
    s[t].erase(s[t].find(x));
    int L = *(--s[t].upper_bound(x));
    int R = *s[t].upper_bound(x);
    upd(1, - 4e8, 4e8, L * 2, L + R, 1, - L, 1);
    upd(1, - 4e8, 4e8, L + R, R * 2, -1, R, 1);
    upd(1, - 4e8, 4e8, L * 2, L + x, 1, - L, -1);
    upd(1, - 4e8, 4e8, L + x, x * 2, -1, x, -1);
    upd(1, - 4e8, 4e8, x * 2, x + R, 1, - x, -1);
    upd(1, - 4e8, 4e8, x + R, R * 2, -1, R, -1);
    cnt += (s[t].size() == 2);
}

int main() {
    ios :: sync_with_stdio(0); cin.tie(0);
    vector <tuple <int, int, int, int> > events;
    cin >> n >> k >> q;
    for (int i = 0; i < n; ++i) {
        int x, t, a, b;
        cin >> x >> t >> a >> b;
        events.push_back({a, -1, x, t});
        events.push_back({b + 1, 1, x, t});
    }
    for (int i = 1; i <= k; ++i) {
        int L = - 2e8, R = 2e8;
        s[i].insert(L), s[i].insert(R);
        upd(1, - 4e8, 4e8, L * 2, L + R, 1, - L, 1);
        upd(1, - 4e8, 4e8, L + R, R * 2, - 1, R, 1);
    }
    cnt = k;
    vector <tuple <int, int, int> > work;
    for (int i = 1; i <= q; ++i) {
        int x, y;
        cin >> x >> y;
        work.push_back({y, x * 2, i});
    }
    sort(events.begin(), events.end());
    sort(work.begin(), work.end());
    int i = 0;
    for (auto [y, x, id]: work) {
        while (i < events.size() && get<0>(events[i]) <= y) {
            auto [_, cmd, x, t] = events[i];
            if (cmd == -1) add(t, x);
            else rev(t, x);
            ++i;
        }
        if (cnt) ans[id] = -1;
        else solve(1, - 4e8, 4e8, x, ans[id]);
    }
    for (int i = 1; i <= q; ++i) cout << ans[i] << '\n';
}

Compilation message

new_home.cpp: In function 'void upd(int, int, int, int, int, int, int, int)':
new_home.cpp:43:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   43 |     int mid = L + R >> 1;
      |               ~~^~~
new_home.cpp: In function 'void solve(int, int, int, int, int&)':
new_home.cpp:53:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   53 |     int mid = L + R >> 1;
      |               ~~^~~
new_home.cpp: In function 'int main()':
new_home.cpp:113:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  113 |     for (auto [y, x, id]: work) {
      |               ^
new_home.cpp:114:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int, int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |         while (i < events.size() && get<0>(events[i]) <= y) {
      |                ~~^~~~~~~~~~~~~~~
new_home.cpp:115:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  115 |             auto [_, cmd, x, t] = events[i];
      |                  ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 451 ms 930400 KB Output is correct
2 Correct 406 ms 930352 KB Output is correct
3 Correct 406 ms 930308 KB Output is correct
4 Correct 397 ms 930256 KB Output is correct
5 Correct 401 ms 930284 KB Output is correct
6 Correct 428 ms 930680 KB Output is correct
7 Correct 406 ms 931096 KB Output is correct
8 Correct 407 ms 931408 KB Output is correct
9 Correct 419 ms 932116 KB Output is correct
10 Correct 407 ms 931136 KB Output is correct
11 Correct 413 ms 930440 KB Output is correct
12 Correct 401 ms 930436 KB Output is correct
13 Correct 442 ms 930284 KB Output is correct
14 Correct 392 ms 930280 KB Output is correct
15 Correct 444 ms 931004 KB Output is correct
16 Correct 394 ms 931192 KB Output is correct
17 Correct 430 ms 930724 KB Output is correct
18 Correct 417 ms 931032 KB Output is correct
19 Correct 398 ms 931304 KB Output is correct
20 Correct 463 ms 930628 KB Output is correct
21 Correct 401 ms 930552 KB Output is correct
22 Correct 441 ms 931940 KB Output is correct
23 Correct 401 ms 931532 KB Output is correct
24 Correct 412 ms 931192 KB Output is correct
25 Correct 411 ms 930508 KB Output is correct
26 Correct 428 ms 930288 KB Output is correct
27 Correct 397 ms 930384 KB Output is correct
28 Correct 403 ms 930500 KB Output is correct
29 Correct 434 ms 930296 KB Output is correct
30 Correct 411 ms 930348 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 451 ms 930400 KB Output is correct
2 Correct 406 ms 930352 KB Output is correct
3 Correct 406 ms 930308 KB Output is correct
4 Correct 397 ms 930256 KB Output is correct
5 Correct 401 ms 930284 KB Output is correct
6 Correct 428 ms 930680 KB Output is correct
7 Correct 406 ms 931096 KB Output is correct
8 Correct 407 ms 931408 KB Output is correct
9 Correct 419 ms 932116 KB Output is correct
10 Correct 407 ms 931136 KB Output is correct
11 Correct 413 ms 930440 KB Output is correct
12 Correct 401 ms 930436 KB Output is correct
13 Correct 442 ms 930284 KB Output is correct
14 Correct 392 ms 930280 KB Output is correct
15 Correct 444 ms 931004 KB Output is correct
16 Correct 394 ms 931192 KB Output is correct
17 Correct 430 ms 930724 KB Output is correct
18 Correct 417 ms 931032 KB Output is correct
19 Correct 398 ms 931304 KB Output is correct
20 Correct 463 ms 930628 KB Output is correct
21 Correct 401 ms 930552 KB Output is correct
22 Correct 441 ms 931940 KB Output is correct
23 Correct 401 ms 931532 KB Output is correct
24 Correct 412 ms 931192 KB Output is correct
25 Correct 411 ms 930508 KB Output is correct
26 Correct 428 ms 930288 KB Output is correct
27 Correct 397 ms 930384 KB Output is correct
28 Correct 403 ms 930500 KB Output is correct
29 Correct 434 ms 930296 KB Output is correct
30 Correct 411 ms 930348 KB Output is correct
31 Correct 4123 ms 1044444 KB Output is correct
32 Correct 750 ms 938268 KB Output is correct
33 Correct 2527 ms 967968 KB Output is correct
34 Correct 4097 ms 979680 KB Output is correct
35 Correct 3482 ms 1035032 KB Output is correct
36 Correct 2402 ms 1014388 KB Output is correct
37 Correct 2343 ms 943232 KB Output is correct
38 Correct 1929 ms 941924 KB Output is correct
39 Correct 1265 ms 937092 KB Output is correct
40 Correct 1293 ms 937276 KB Output is correct
41 Correct 2642 ms 938208 KB Output is correct
42 Correct 2728 ms 938640 KB Output is correct
43 Correct 584 ms 944596 KB Output is correct
44 Correct 2495 ms 937904 KB Output is correct
45 Correct 1961 ms 937308 KB Output is correct
46 Correct 1538 ms 937260 KB Output is correct
47 Correct 1352 ms 936784 KB Output is correct
48 Correct 1163 ms 936912 KB Output is correct
49 Correct 1403 ms 937028 KB Output is correct
50 Correct 2001 ms 937592 KB Output is correct
51 Correct 1351 ms 936980 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 451 ms 930400 KB Output is correct
2 Correct 406 ms 930352 KB Output is correct
3 Correct 406 ms 930308 KB Output is correct
4 Correct 397 ms 930256 KB Output is correct
5 Correct 401 ms 930284 KB Output is correct
6 Correct 428 ms 930680 KB Output is correct
7 Correct 406 ms 931096 KB Output is correct
8 Correct 407 ms 931408 KB Output is correct
9 Correct 419 ms 932116 KB Output is correct
10 Correct 407 ms 931136 KB Output is correct
11 Correct 413 ms 930440 KB Output is correct
12 Correct 401 ms 930436 KB Output is correct
13 Correct 442 ms 930284 KB Output is correct
14 Correct 392 ms 930280 KB Output is correct
15 Correct 444 ms 931004 KB Output is correct
16 Correct 394 ms 931192 KB Output is correct
17 Correct 430 ms 930724 KB Output is correct
18 Correct 417 ms 931032 KB Output is correct
19 Correct 398 ms 931304 KB Output is correct
20 Correct 463 ms 930628 KB Output is correct
21 Correct 401 ms 930552 KB Output is correct
22 Correct 441 ms 931940 KB Output is correct
23 Correct 401 ms 931532 KB Output is correct
24 Correct 412 ms 931192 KB Output is correct
25 Correct 411 ms 930508 KB Output is correct
26 Correct 428 ms 930288 KB Output is correct
27 Correct 397 ms 930384 KB Output is correct
28 Correct 403 ms 930500 KB Output is correct
29 Correct 434 ms 930296 KB Output is correct
30 Correct 411 ms 930348 KB Output is correct
31 Correct 4123 ms 1044444 KB Output is correct
32 Correct 750 ms 938268 KB Output is correct
33 Correct 2527 ms 967968 KB Output is correct
34 Correct 4097 ms 979680 KB Output is correct
35 Correct 3482 ms 1035032 KB Output is correct
36 Correct 2402 ms 1014388 KB Output is correct
37 Correct 2343 ms 943232 KB Output is correct
38 Correct 1929 ms 941924 KB Output is correct
39 Correct 1265 ms 937092 KB Output is correct
40 Correct 1293 ms 937276 KB Output is correct
41 Correct 2642 ms 938208 KB Output is correct
42 Correct 2728 ms 938640 KB Output is correct
43 Correct 584 ms 944596 KB Output is correct
44 Correct 2495 ms 937904 KB Output is correct
45 Correct 1961 ms 937308 KB Output is correct
46 Correct 1538 ms 937260 KB Output is correct
47 Correct 1352 ms 936784 KB Output is correct
48 Correct 1163 ms 936912 KB Output is correct
49 Correct 1403 ms 937028 KB Output is correct
50 Correct 2001 ms 937592 KB Output is correct
51 Correct 1351 ms 936980 KB Output is correct
52 Runtime error 1097 ms 1048576 KB Execution killed with signal 9
53 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 451 ms 930400 KB Output is correct
2 Correct 406 ms 930352 KB Output is correct
3 Correct 406 ms 930308 KB Output is correct
4 Correct 397 ms 930256 KB Output is correct
5 Correct 401 ms 930284 KB Output is correct
6 Correct 428 ms 930680 KB Output is correct
7 Correct 406 ms 931096 KB Output is correct
8 Correct 407 ms 931408 KB Output is correct
9 Correct 419 ms 932116 KB Output is correct
10 Correct 407 ms 931136 KB Output is correct
11 Correct 413 ms 930440 KB Output is correct
12 Correct 401 ms 930436 KB Output is correct
13 Correct 442 ms 930284 KB Output is correct
14 Correct 392 ms 930280 KB Output is correct
15 Correct 444 ms 931004 KB Output is correct
16 Correct 394 ms 931192 KB Output is correct
17 Correct 430 ms 930724 KB Output is correct
18 Correct 417 ms 931032 KB Output is correct
19 Correct 398 ms 931304 KB Output is correct
20 Correct 463 ms 930628 KB Output is correct
21 Correct 401 ms 930552 KB Output is correct
22 Correct 441 ms 931940 KB Output is correct
23 Correct 401 ms 931532 KB Output is correct
24 Correct 412 ms 931192 KB Output is correct
25 Correct 411 ms 930508 KB Output is correct
26 Correct 428 ms 930288 KB Output is correct
27 Correct 397 ms 930384 KB Output is correct
28 Correct 403 ms 930500 KB Output is correct
29 Correct 434 ms 930296 KB Output is correct
30 Correct 411 ms 930348 KB Output is correct
31 Correct 4123 ms 1044444 KB Output is correct
32 Correct 750 ms 938268 KB Output is correct
33 Correct 2527 ms 967968 KB Output is correct
34 Correct 4097 ms 979680 KB Output is correct
35 Correct 3482 ms 1035032 KB Output is correct
36 Correct 2402 ms 1014388 KB Output is correct
37 Correct 2343 ms 943232 KB Output is correct
38 Correct 1929 ms 941924 KB Output is correct
39 Correct 1265 ms 937092 KB Output is correct
40 Correct 1293 ms 937276 KB Output is correct
41 Correct 2642 ms 938208 KB Output is correct
42 Correct 2728 ms 938640 KB Output is correct
43 Correct 584 ms 944596 KB Output is correct
44 Correct 2495 ms 937904 KB Output is correct
45 Correct 1961 ms 937308 KB Output is correct
46 Correct 1538 ms 937260 KB Output is correct
47 Correct 1352 ms 936784 KB Output is correct
48 Correct 1163 ms 936912 KB Output is correct
49 Correct 1403 ms 937028 KB Output is correct
50 Correct 2001 ms 937592 KB Output is correct
51 Correct 1351 ms 936980 KB Output is correct
52 Runtime error 1150 ms 1048576 KB Execution killed with signal 9
53 Halted 0 ms 0 KB -