oj.uz

Submission #161051

# Submission time Handle Problem Language Result Execution time Memory
161051 2019-10-31T10:45:26 Z Minnakhmetov New Home (APIO18_new_home) C++14
80 / 100
 5000 ms 379884 KB 
#include <bits/stdc++.h>
    
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
 
using namespace std;

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
 
struct E {
    int p, t, x, y;
};
 
struct U {
    int l, r;
    pair<int, pair<int, int>> p;
};
 
const int N = 3e5 + 5, INF = 1e9, MAX = 1e8;
int n, q, k, cq, cc;
int ans[N];
pair<int, int> lt[N], tmp[N];
map<pair<int, int>, pair<int, int>> mp[N];
bool ok[N];
 
vector<int> vx;
multiset<int> occ[N];
vector<pair<int, pair<int, int>>> t[N * 4];
vector<U> updates;
 
void upd(int l, int r, pair<int, pair<int, int>> &p, int v, int L, int R) {
    if (l > r)
        return;
    if (L == l && R == r) {
        t[v].push_back(p);
    }
    else {
        int m = (L + R) >> 1;
        upd(l, min(m, r), p, v * 2, L, m);
        upd(max(m + 1, l), r, p, v * 2 + 1, m + 1, R);
    }
}

void startSeg(int x, pair<int, int> y) {
    auto &p = mp[x][y];
    if (p.first == 0)
        p.second = cq;
    p.first++;
}
 
void endSeg(int x, pair<int, int> y) {
    auto &p = mp[x][y];
    if (p.first == 1)
        updates.push_back({p.second, cq - 1, {x, y}});
    p.first--;    
}
 
void updBetween(int x, int y, bool add) {
    if (x == y || x == -INF && y == INF)
        return;

    int m1 = lower_bound(all(vx), (x + y + 1) >> 1) - vx.begin();
 
    if (add)
        startSeg(m1, {y, -x});
    else
        endSeg(m1, {y, -x});
}
 
void calcAns(int v, int L, int R) {
    if (L == R) {
        tmp[0] = lt[L];
    }
    else {
        int m = (L + R) >> 1;
        calcAns(v * 2, L, m);
        calcAns(v * 2 + 1, m + 1, R);
        
        int x = L, y = m + 1, z = 0;
        while (x <= m || y <= R) {
            if (x <= m && (y == R + 1 || lt[x].first < lt[y].first))
                tmp[z] = lt[x++];
            else 
                tmp[z] = lt[y++];
            z++;
        }
        for (int i = L; i <= R; i++)
            lt[i] = tmp[i - L];
    }
 
    int i = 0, mx = -INF;
    for (int j = 0; j <= R - L; j++) {
        while (i < t[v].size() && t[v][i].first <= tmp[j].first) {
            mx = max(mx, t[v][i].second.first);
            i++;
        }
        ans[tmp[j].second] = max(ans[tmp[j].second], mx - vx[tmp[j].first]);
    }    
 
    reverse(tmp, tmp + R - L + 1);
 
    for (int j = 0; j <= R - L; j++)
        tmp[j].first = cc - 1 - tmp[j].first;

    reverse(all(t[v]));
    for (auto &p : t[v]) {
        p.first = cc - p.first;
    }
 
    i = 0, mx = -INF;
    for (int j = 0; j <= R - L; j++) {
        while (i < t[v].size() && t[v][i].first <= tmp[j].first) {
            mx = max(mx, t[v][i].second.second);
            i++;
        }
        ans[tmp[j].second] = max(ans[tmp[j].second], mx + vx[cc - 1 - tmp[j].first]);
    }
}
 
void calcUpdates(vector<E> &evs) { 
    for (E &e : evs) {
        if (e.t == 2)
            vx.push_back(e.x);
    }
 
    sort(all(vx));
    vx.erase(unique(all(vx)), vx.end());
 
    cc = vx.size();
 
    cq = 0;
 
    int types_on = 0;
 
    for (E &e : evs) {
        // cout << e.p << " " << e.t << " " << e.x << " " << e.y << "\n";
        if (e.t == 0) {
            if (occ[e.y].size() == 2)
                types_on++;

            auto it = occ[e.y].insert(e.x);
 
            updBetween(*prev(it), *it, true);
            updBetween(*it, *next(it), true);
            updBetween(*prev(it), *next(it), false);
 
        }
        else if (e.t == 1) {
            auto it = occ[e.y].find(e.x);
 
            updBetween(*prev(it), *it, false);
            updBetween(*it, *next(it), false);
            updBetween(*prev(it), *next(it), true);
 
            occ[e.y].erase(it);
 
            if (occ[e.y].size() == 2)
                types_on--;
        }
        else {
            ok[e.y] = (types_on == k);
            lt[cq++] = {lower_bound(all(vx), e.x) - vx.begin(), e.y};
        }
    }
 
    sort(all(updates), [](const U &a, const U &b) {
        return a.p.first < b.p.first;
    });
}
 
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
 
    cin >> n >> k >> q;
 
    vector<E> evs;
 
    for (int i = 0; i < n; i++) {
        int x, t, a, b;
        cin >> x >> t >> a >> b;
        t--;
        evs.push_back({a, 0, x, t});
        evs.push_back({b + 1, 1, x, t});
    }
 
    for (int i = 0; i < q; i++) {
        int x, y;
        cin >> x >> y;
        evs.push_back({y, 2, x, i});
    }
 
    for (int i = 0; i < k; i++) {
        occ[i].insert(-INF);
        occ[i].insert(INF);
    }
 
    sort(all(evs), [](const E &a, const E &b) {
        return a.p == b.p ? a.t < b.t : a.p < b.p;
    });
 
    calcUpdates(evs);
 
    for (U &u : updates) {
        upd(u.l, u.r, u.p, 1, 0, q - 1);
    }
 
    calcAns(1, 0, q - 1);
 
    for (int i = 0; i < q; i++) {
        if (ok[i]) {
            cout << ans[i] << "\n";
        }
        else {
            cout << "-1\n";
        }
    }
 
    return 0;
}

Compilation message

new_home.cpp: In function 'void updBetween(int, int, bool)':
new_home.cpp:60:29: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
     if (x == y || x == -INF && y == INF)
                   ~~~~~~~~~~^~~~~~~~~~~
new_home.cpp: In function 'void calcAns(int, int, int)':
new_home.cpp:94:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (i < t[v].size() && t[v][i].first <= tmp[j].first) {
                ~~^~~~~~~~~~~~~
new_home.cpp:113:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (i < t[v].size() && t[v][i].first <= tmp[j].first) {
                ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 56696 KB Output is correct
2 Correct 54 ms 56696 KB Output is correct
3 Correct 53 ms 56696 KB Output is correct
4 Correct 53 ms 56696 KB Output is correct
5 Correct 54 ms 56824 KB Output is correct
6 Correct 54 ms 56952 KB Output is correct
7 Correct 55 ms 56952 KB Output is correct
8 Correct 55 ms 57080 KB Output is correct
9 Correct 55 ms 57028 KB Output is correct
10 Correct 55 ms 56952 KB Output is correct
11 Correct 56 ms 56952 KB Output is correct
12 Correct 59 ms 56952 KB Output is correct
13 Correct 54 ms 56824 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 55 ms 56952 KB Output is correct
16 Correct 56 ms 56952 KB Output is correct
17 Correct 56 ms 57208 KB Output is correct
18 Correct 60 ms 56952 KB Output is correct
19 Correct 55 ms 56952 KB Output is correct
20 Correct 55 ms 57080 KB Output is correct
21 Correct 55 ms 56800 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 57 ms 57080 KB Output is correct
24 Correct 61 ms 57080 KB Output is correct
25 Correct 60 ms 57056 KB Output is correct
26 Correct 56 ms 56952 KB Output is correct
27 Correct 56 ms 56924 KB Output is correct
28 Correct 55 ms 56952 KB Output is correct
29 Correct 58 ms 56952 KB Output is correct
30 Correct 54 ms 56824 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 56696 KB Output is correct
2 Correct 54 ms 56696 KB Output is correct
3 Correct 53 ms 56696 KB Output is correct
4 Correct 53 ms 56696 KB Output is correct
5 Correct 54 ms 56824 KB Output is correct
6 Correct 54 ms 56952 KB Output is correct
7 Correct 55 ms 56952 KB Output is correct
8 Correct 55 ms 57080 KB Output is correct
9 Correct 55 ms 57028 KB Output is correct
10 Correct 55 ms 56952 KB Output is correct
11 Correct 56 ms 56952 KB Output is correct
12 Correct 59 ms 56952 KB Output is correct
13 Correct 54 ms 56824 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 55 ms 56952 KB Output is correct
16 Correct 56 ms 56952 KB Output is correct
17 Correct 56 ms 57208 KB Output is correct
18 Correct 60 ms 56952 KB Output is correct
19 Correct 55 ms 56952 KB Output is correct
20 Correct 55 ms 57080 KB Output is correct
21 Correct 55 ms 56800 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 57 ms 57080 KB Output is correct
24 Correct 61 ms 57080 KB Output is correct
25 Correct 60 ms 57056 KB Output is correct
26 Correct 56 ms 56952 KB Output is correct
27 Correct 56 ms 56924 KB Output is correct
28 Correct 55 ms 56952 KB Output is correct
29 Correct 58 ms 56952 KB Output is correct
30 Correct 54 ms 56824 KB Output is correct
31 Correct 777 ms 112908 KB Output is correct
32 Correct 191 ms 62432 KB Output is correct
33 Correct 746 ms 109524 KB Output is correct
34 Correct 744 ms 109640 KB Output is correct
35 Correct 793 ms 112996 KB Output is correct
36 Correct 790 ms 112824 KB Output is correct
37 Correct 532 ms 102752 KB Output is correct
38 Correct 516 ms 102456 KB Output is correct
39 Correct 439 ms 92756 KB Output is correct
40 Correct 452 ms 95084 KB Output is correct
41 Correct 611 ms 100564 KB Output is correct
42 Correct 644 ms 101000 KB Output is correct
43 Correct 156 ms 64480 KB Output is correct
44 Correct 617 ms 99812 KB Output is correct
45 Correct 581 ms 94448 KB Output is correct
46 Correct 485 ms 85460 KB Output is correct
47 Correct 316 ms 83280 KB Output is correct
48 Correct 327 ms 81620 KB Output is correct
49 Correct 378 ms 88124 KB Output is correct
50 Correct 458 ms 97360 KB Output is correct
51 Correct 382 ms 85668 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2684 ms 171476 KB Output is correct
2 Correct 2657 ms 170788 KB Output is correct
3 Correct 2240 ms 191944 KB Output is correct
4 Correct 2630 ms 174360 KB Output is correct
5 Correct 2536 ms 167284 KB Output is correct
6 Correct 2586 ms 170276 KB Output is correct
7 Correct 2241 ms 191908 KB Output is correct
8 Correct 2312 ms 174856 KB Output is correct
9 Correct 2152 ms 171936 KB Output is correct
10 Correct 2148 ms 174200 KB Output is correct
11 Correct 1430 ms 171640 KB Output is correct
12 Correct 1535 ms 173036 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4142 ms 278204 KB Output is correct
2 Correct 703 ms 92824 KB Output is correct
3 Correct 4075 ms 277636 KB Output is correct
4 Correct 2784 ms 255972 KB Output is correct
5 Correct 4054 ms 272640 KB Output is correct
6 Correct 3882 ms 268868 KB Output is correct
7 Correct 3704 ms 276620 KB Output is correct
8 Correct 3807 ms 277436 KB Output is correct
9 Correct 2595 ms 255436 KB Output is correct
10 Correct 3495 ms 265196 KB Output is correct
11 Correct 3661 ms 276588 KB Output is correct
12 Correct 3685 ms 277852 KB Output is correct
13 Correct 1796 ms 226576 KB Output is correct
14 Correct 1841 ms 224116 KB Output is correct
15 Correct 2052 ms 242168 KB Output is correct
16 Correct 2313 ms 256748 KB Output is correct
17 Correct 2221 ms 250732 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 56696 KB Output is correct
2 Correct 54 ms 56696 KB Output is correct
3 Correct 53 ms 56696 KB Output is correct
4 Correct 53 ms 56696 KB Output is correct
5 Correct 54 ms 56824 KB Output is correct
6 Correct 54 ms 56952 KB Output is correct
7 Correct 55 ms 56952 KB Output is correct
8 Correct 55 ms 57080 KB Output is correct
9 Correct 55 ms 57028 KB Output is correct
10 Correct 55 ms 56952 KB Output is correct
11 Correct 56 ms 56952 KB Output is correct
12 Correct 59 ms 56952 KB Output is correct
13 Correct 54 ms 56824 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 55 ms 56952 KB Output is correct
16 Correct 56 ms 56952 KB Output is correct
17 Correct 56 ms 57208 KB Output is correct
18 Correct 60 ms 56952 KB Output is correct
19 Correct 55 ms 56952 KB Output is correct
20 Correct 55 ms 57080 KB Output is correct
21 Correct 55 ms 56800 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 57 ms 57080 KB Output is correct
24 Correct 61 ms 57080 KB Output is correct
25 Correct 60 ms 57056 KB Output is correct
26 Correct 56 ms 56952 KB Output is correct
27 Correct 56 ms 56924 KB Output is correct
28 Correct 55 ms 56952 KB Output is correct
29 Correct 58 ms 56952 KB Output is correct
30 Correct 54 ms 56824 KB Output is correct
31 Correct 777 ms 112908 KB Output is correct
32 Correct 191 ms 62432 KB Output is correct
33 Correct 746 ms 109524 KB Output is correct
34 Correct 744 ms 109640 KB Output is correct
35 Correct 793 ms 112996 KB Output is correct
36 Correct 790 ms 112824 KB Output is correct
37 Correct 532 ms 102752 KB Output is correct
38 Correct 516 ms 102456 KB Output is correct
39 Correct 439 ms 92756 KB Output is correct
40 Correct 452 ms 95084 KB Output is correct
41 Correct 611 ms 100564 KB Output is correct
42 Correct 644 ms 101000 KB Output is correct
43 Correct 156 ms 64480 KB Output is correct
44 Correct 617 ms 99812 KB Output is correct
45 Correct 581 ms 94448 KB Output is correct
46 Correct 485 ms 85460 KB Output is correct
47 Correct 316 ms 83280 KB Output is correct
48 Correct 327 ms 81620 KB Output is correct
49 Correct 378 ms 88124 KB Output is correct
50 Correct 458 ms 97360 KB Output is correct
51 Correct 382 ms 85668 KB Output is correct
52 Correct 592 ms 107348 KB Output is correct
53 Correct 568 ms 103244 KB Output is correct
54 Correct 723 ms 112340 KB Output is correct
55 Correct 588 ms 108024 KB Output is correct
56 Correct 574 ms 109652 KB Output is correct
57 Correct 646 ms 103412 KB Output is correct
58 Correct 639 ms 105284 KB Output is correct
59 Correct 617 ms 106972 KB Output is correct
60 Correct 645 ms 103016 KB Output is correct
61 Correct 154 ms 71008 KB Output is correct
62 Correct 541 ms 109988 KB Output is correct
63 Correct 670 ms 112452 KB Output is correct
64 Correct 723 ms 113420 KB Output is correct
65 Correct 676 ms 111772 KB Output is correct
66 Correct 667 ms 105104 KB Output is correct
67 Correct 190 ms 63584 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 56696 KB Output is correct
2 Correct 54 ms 56696 KB Output is correct
3 Correct 53 ms 56696 KB Output is correct
4 Correct 53 ms 56696 KB Output is correct
5 Correct 54 ms 56824 KB Output is correct
6 Correct 54 ms 56952 KB Output is correct
7 Correct 55 ms 56952 KB Output is correct
8 Correct 55 ms 57080 KB Output is correct
9 Correct 55 ms 57028 KB Output is correct
10 Correct 55 ms 56952 KB Output is correct
11 Correct 56 ms 56952 KB Output is correct
12 Correct 59 ms 56952 KB Output is correct
13 Correct 54 ms 56824 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 55 ms 56952 KB Output is correct
16 Correct 56 ms 56952 KB Output is correct
17 Correct 56 ms 57208 KB Output is correct
18 Correct 60 ms 56952 KB Output is correct
19 Correct 55 ms 56952 KB Output is correct
20 Correct 55 ms 57080 KB Output is correct
21 Correct 55 ms 56800 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 57 ms 57080 KB Output is correct
24 Correct 61 ms 57080 KB Output is correct
25 Correct 60 ms 57056 KB Output is correct
26 Correct 56 ms 56952 KB Output is correct
27 Correct 56 ms 56924 KB Output is correct
28 Correct 55 ms 56952 KB Output is correct
29 Correct 58 ms 56952 KB Output is correct
30 Correct 54 ms 56824 KB Output is correct
31 Correct 777 ms 112908 KB Output is correct
32 Correct 191 ms 62432 KB Output is correct
33 Correct 746 ms 109524 KB Output is correct
34 Correct 744 ms 109640 KB Output is correct
35 Correct 793 ms 112996 KB Output is correct
36 Correct 790 ms 112824 KB Output is correct
37 Correct 532 ms 102752 KB Output is correct
38 Correct 516 ms 102456 KB Output is correct
39 Correct 439 ms 92756 KB Output is correct
40 Correct 452 ms 95084 KB Output is correct
41 Correct 611 ms 100564 KB Output is correct
42 Correct 644 ms 101000 KB Output is correct
43 Correct 156 ms 64480 KB Output is correct
44 Correct 617 ms 99812 KB Output is correct
45 Correct 581 ms 94448 KB Output is correct
46 Correct 485 ms 85460 KB Output is correct
47 Correct 316 ms 83280 KB Output is correct
48 Correct 327 ms 81620 KB Output is correct
49 Correct 378 ms 88124 KB Output is correct
50 Correct 458 ms 97360 KB Output is correct
51 Correct 382 ms 85668 KB Output is correct
52 Correct 2684 ms 171476 KB Output is correct
53 Correct 2657 ms 170788 KB Output is correct
54 Correct 2240 ms 191944 KB Output is correct
55 Correct 2630 ms 174360 KB Output is correct
56 Correct 2536 ms 167284 KB Output is correct
57 Correct 2586 ms 170276 KB Output is correct
58 Correct 2241 ms 191908 KB Output is correct
59 Correct 2312 ms 174856 KB Output is correct
60 Correct 2152 ms 171936 KB Output is correct
61 Correct 2148 ms 174200 KB Output is correct
62 Correct 1430 ms 171640 KB Output is correct
63 Correct 1535 ms 173036 KB Output is correct
64 Correct 4142 ms 278204 KB Output is correct
65 Correct 703 ms 92824 KB Output is correct
66 Correct 4075 ms 277636 KB Output is correct
67 Correct 2784 ms 255972 KB Output is correct
68 Correct 4054 ms 272640 KB Output is correct
69 Correct 3882 ms 268868 KB Output is correct
70 Correct 3704 ms 276620 KB Output is correct
71 Correct 3807 ms 277436 KB Output is correct
72 Correct 2595 ms 255436 KB Output is correct
73 Correct 3495 ms 265196 KB Output is correct
74 Correct 3661 ms 276588 KB Output is correct
75 Correct 3685 ms 277852 KB Output is correct
76 Correct 1796 ms 226576 KB Output is correct
77 Correct 1841 ms 224116 KB Output is correct
78 Correct 2052 ms 242168 KB Output is correct
79 Correct 2313 ms 256748 KB Output is correct
80 Correct 2221 ms 250732 KB Output is correct
81 Correct 592 ms 107348 KB Output is correct
82 Correct 568 ms 103244 KB Output is correct
83 Correct 723 ms 112340 KB Output is correct
84 Correct 588 ms 108024 KB Output is correct
85 Correct 574 ms 109652 KB Output is correct
86 Correct 646 ms 103412 KB Output is correct
87 Correct 639 ms 105284 KB Output is correct
88 Correct 617 ms 106972 KB Output is correct
89 Correct 645 ms 103016 KB Output is correct
90 Correct 154 ms 71008 KB Output is correct
91 Correct 541 ms 109988 KB Output is correct
92 Correct 670 ms 112452 KB Output is correct
93 Correct 723 ms 113420 KB Output is correct
94 Correct 676 ms 111772 KB Output is correct
95 Correct 667 ms 105104 KB Output is correct
96 Correct 190 ms 63584 KB Output is correct
97 Correct 3533 ms 342172 KB Output is correct
98 Correct 750 ms 88880 KB Output is correct
99 Correct 4818 ms 353064 KB Output is correct
100 Correct 3598 ms 311796 KB Output is correct
101 Correct 4764 ms 368636 KB Output is correct
102 Execution timed out 5076 ms 379884 KB Time limit exceeded
103 Halted 0 ms 0 KB -