oj.uz

Submission #161053

# Submission time Handle Problem Language Result Execution time Memory
161053 2019-10-31T10:48:50 Z Minnakhmetov New Home (APIO18_new_home) C++14
80 / 100
 5000 ms 367184 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 || r < L)
        return;
    if (L >= l && R <= r) {
        t[v].push_back(p);
    }
    else {
        int m = (L + R) >> 1;
        upd(l, r, p, v * 2, L, m);
        upd(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[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 56824 KB Output is correct
2 Correct 53 ms 56696 KB Output is correct
3 Correct 65 ms 56648 KB Output is correct
4 Correct 54 ms 56784 KB Output is correct
5 Correct 54 ms 56724 KB Output is correct
6 Correct 56 ms 57012 KB Output is correct
7 Correct 55 ms 56952 KB Output is correct
8 Correct 55 ms 56952 KB Output is correct
9 Correct 57 ms 57060 KB Output is correct
10 Correct 57 ms 57080 KB Output is correct
11 Correct 56 ms 57016 KB Output is correct
12 Correct 55 ms 56952 KB Output is correct
13 Correct 55 ms 56956 KB Output is correct
14 Correct 57 ms 56824 KB Output is correct
15 Correct 59 ms 57080 KB Output is correct
16 Correct 55 ms 57080 KB Output is correct
17 Correct 56 ms 56952 KB Output is correct
18 Correct 56 ms 56956 KB Output is correct
19 Correct 56 ms 57080 KB Output is correct
20 Correct 56 ms 56952 KB Output is correct
21 Correct 57 ms 56796 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 62 ms 56952 KB Output is correct
24 Correct 71 ms 57080 KB Output is correct
25 Correct 63 ms 56824 KB Output is correct
26 Correct 63 ms 56952 KB Output is correct
27 Correct 62 ms 56952 KB Output is correct
28 Correct 56 ms 57080 KB Output is correct
29 Correct 56 ms 56952 KB Output is correct
30 Correct 57 ms 56824 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 56824 KB Output is correct
2 Correct 53 ms 56696 KB Output is correct
3 Correct 65 ms 56648 KB Output is correct
4 Correct 54 ms 56784 KB Output is correct
5 Correct 54 ms 56724 KB Output is correct
6 Correct 56 ms 57012 KB Output is correct
7 Correct 55 ms 56952 KB Output is correct
8 Correct 55 ms 56952 KB Output is correct
9 Correct 57 ms 57060 KB Output is correct
10 Correct 57 ms 57080 KB Output is correct
11 Correct 56 ms 57016 KB Output is correct
12 Correct 55 ms 56952 KB Output is correct
13 Correct 55 ms 56956 KB Output is correct
14 Correct 57 ms 56824 KB Output is correct
15 Correct 59 ms 57080 KB Output is correct
16 Correct 55 ms 57080 KB Output is correct
17 Correct 56 ms 56952 KB Output is correct
18 Correct 56 ms 56956 KB Output is correct
19 Correct 56 ms 57080 KB Output is correct
20 Correct 56 ms 56952 KB Output is correct
21 Correct 57 ms 56796 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 62 ms 56952 KB Output is correct
24 Correct 71 ms 57080 KB Output is correct
25 Correct 63 ms 56824 KB Output is correct
26 Correct 63 ms 56952 KB Output is correct
27 Correct 62 ms 56952 KB Output is correct
28 Correct 56 ms 57080 KB Output is correct
29 Correct 56 ms 56952 KB Output is correct
30 Correct 57 ms 56824 KB Output is correct
31 Correct 782 ms 115852 KB Output is correct
32 Correct 173 ms 63588 KB Output is correct
33 Correct 757 ms 112136 KB Output is correct
34 Correct 783 ms 112604 KB Output is correct
35 Correct 1097 ms 115848 KB Output is correct
36 Correct 802 ms 115664 KB Output is correct
37 Correct 538 ms 105176 KB Output is correct
38 Correct 529 ms 104788 KB Output is correct
39 Correct 476 ms 95444 KB Output is correct
40 Correct 440 ms 97600 KB Output is correct
41 Correct 610 ms 103032 KB Output is correct
42 Correct 611 ms 103512 KB Output is correct
43 Correct 147 ms 66976 KB Output is correct
44 Correct 614 ms 102228 KB Output is correct
45 Correct 574 ms 96856 KB Output is correct
46 Correct 496 ms 87892 KB Output is correct
47 Correct 325 ms 85844 KB Output is correct
48 Correct 322 ms 84328 KB Output is correct
49 Correct 383 ms 90640 KB Output is correct
50 Correct 458 ms 100052 KB Output is correct
51 Correct 391 ms 88116 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2627 ms 176072 KB Output is correct
2 Correct 2611 ms 176444 KB Output is correct
3 Correct 2234 ms 197556 KB Output is correct
4 Correct 2697 ms 179652 KB Output is correct
5 Correct 2339 ms 172620 KB Output is correct
6 Correct 2543 ms 175616 KB Output is correct
7 Correct 2104 ms 197156 KB Output is correct
8 Correct 2297 ms 180104 KB Output is correct
9 Correct 2133 ms 177332 KB Output is correct
10 Correct 2155 ms 179528 KB Output is correct
11 Correct 1386 ms 176424 KB Output is correct
12 Correct 1845 ms 177928 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4122 ms 285444 KB Output is correct
2 Correct 708 ms 95552 KB Output is correct
3 Correct 4014 ms 282404 KB Output is correct
4 Correct 2771 ms 260420 KB Output is correct
5 Correct 3916 ms 276896 KB Output is correct
6 Correct 3912 ms 272976 KB Output is correct
7 Correct 3929 ms 279020 KB Output is correct
8 Correct 3997 ms 279092 KB Output is correct
9 Correct 2660 ms 257104 KB Output is correct
10 Correct 3501 ms 267044 KB Output is correct
11 Correct 3770 ms 278568 KB Output is correct
12 Correct 3770 ms 278380 KB Output is correct
13 Correct 1778 ms 225968 KB Output is correct
14 Correct 1821 ms 223652 KB Output is correct
15 Correct 2112 ms 241480 KB Output is correct
16 Correct 2331 ms 255148 KB Output is correct
17 Correct 2264 ms 248876 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 56824 KB Output is correct
2 Correct 53 ms 56696 KB Output is correct
3 Correct 65 ms 56648 KB Output is correct
4 Correct 54 ms 56784 KB Output is correct
5 Correct 54 ms 56724 KB Output is correct
6 Correct 56 ms 57012 KB Output is correct
7 Correct 55 ms 56952 KB Output is correct
8 Correct 55 ms 56952 KB Output is correct
9 Correct 57 ms 57060 KB Output is correct
10 Correct 57 ms 57080 KB Output is correct
11 Correct 56 ms 57016 KB Output is correct
12 Correct 55 ms 56952 KB Output is correct
13 Correct 55 ms 56956 KB Output is correct
14 Correct 57 ms 56824 KB Output is correct
15 Correct 59 ms 57080 KB Output is correct
16 Correct 55 ms 57080 KB Output is correct
17 Correct 56 ms 56952 KB Output is correct
18 Correct 56 ms 56956 KB Output is correct
19 Correct 56 ms 57080 KB Output is correct
20 Correct 56 ms 56952 KB Output is correct
21 Correct 57 ms 56796 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 62 ms 56952 KB Output is correct
24 Correct 71 ms 57080 KB Output is correct
25 Correct 63 ms 56824 KB Output is correct
26 Correct 63 ms 56952 KB Output is correct
27 Correct 62 ms 56952 KB Output is correct
28 Correct 56 ms 57080 KB Output is correct
29 Correct 56 ms 56952 KB Output is correct
30 Correct 57 ms 56824 KB Output is correct
31 Correct 782 ms 115852 KB Output is correct
32 Correct 173 ms 63588 KB Output is correct
33 Correct 757 ms 112136 KB Output is correct
34 Correct 783 ms 112604 KB Output is correct
35 Correct 1097 ms 115848 KB Output is correct
36 Correct 802 ms 115664 KB Output is correct
37 Correct 538 ms 105176 KB Output is correct
38 Correct 529 ms 104788 KB Output is correct
39 Correct 476 ms 95444 KB Output is correct
40 Correct 440 ms 97600 KB Output is correct
41 Correct 610 ms 103032 KB Output is correct
42 Correct 611 ms 103512 KB Output is correct
43 Correct 147 ms 66976 KB Output is correct
44 Correct 614 ms 102228 KB Output is correct
45 Correct 574 ms 96856 KB Output is correct
46 Correct 496 ms 87892 KB Output is correct
47 Correct 325 ms 85844 KB Output is correct
48 Correct 322 ms 84328 KB Output is correct
49 Correct 383 ms 90640 KB Output is correct
50 Correct 458 ms 100052 KB Output is correct
51 Correct 391 ms 88116 KB Output is correct
52 Correct 546 ms 106336 KB Output is correct
53 Correct 665 ms 102500 KB Output is correct
54 Correct 706 ms 111472 KB Output is correct
55 Correct 583 ms 107220 KB Output is correct
56 Correct 579 ms 108808 KB Output is correct
57 Correct 612 ms 102440 KB Output is correct
58 Correct 615 ms 104500 KB Output is correct
59 Correct 631 ms 106072 KB Output is correct
60 Correct 627 ms 102204 KB Output is correct
61 Correct 154 ms 70112 KB Output is correct
62 Correct 566 ms 109076 KB Output is correct
63 Correct 804 ms 111640 KB Output is correct
64 Correct 678 ms 112708 KB Output is correct
65 Correct 724 ms 110992 KB Output is correct
66 Correct 630 ms 104148 KB Output is correct
67 Correct 191 ms 62732 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 56824 KB Output is correct
2 Correct 53 ms 56696 KB Output is correct
3 Correct 65 ms 56648 KB Output is correct
4 Correct 54 ms 56784 KB Output is correct
5 Correct 54 ms 56724 KB Output is correct
6 Correct 56 ms 57012 KB Output is correct
7 Correct 55 ms 56952 KB Output is correct
8 Correct 55 ms 56952 KB Output is correct
9 Correct 57 ms 57060 KB Output is correct
10 Correct 57 ms 57080 KB Output is correct
11 Correct 56 ms 57016 KB Output is correct
12 Correct 55 ms 56952 KB Output is correct
13 Correct 55 ms 56956 KB Output is correct
14 Correct 57 ms 56824 KB Output is correct
15 Correct 59 ms 57080 KB Output is correct
16 Correct 55 ms 57080 KB Output is correct
17 Correct 56 ms 56952 KB Output is correct
18 Correct 56 ms 56956 KB Output is correct
19 Correct 56 ms 57080 KB Output is correct
20 Correct 56 ms 56952 KB Output is correct
21 Correct 57 ms 56796 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 62 ms 56952 KB Output is correct
24 Correct 71 ms 57080 KB Output is correct
25 Correct 63 ms 56824 KB Output is correct
26 Correct 63 ms 56952 KB Output is correct
27 Correct 62 ms 56952 KB Output is correct
28 Correct 56 ms 57080 KB Output is correct
29 Correct 56 ms 56952 KB Output is correct
30 Correct 57 ms 56824 KB Output is correct
31 Correct 782 ms 115852 KB Output is correct
32 Correct 173 ms 63588 KB Output is correct
33 Correct 757 ms 112136 KB Output is correct
34 Correct 783 ms 112604 KB Output is correct
35 Correct 1097 ms 115848 KB Output is correct
36 Correct 802 ms 115664 KB Output is correct
37 Correct 538 ms 105176 KB Output is correct
38 Correct 529 ms 104788 KB Output is correct
39 Correct 476 ms 95444 KB Output is correct
40 Correct 440 ms 97600 KB Output is correct
41 Correct 610 ms 103032 KB Output is correct
42 Correct 611 ms 103512 KB Output is correct
43 Correct 147 ms 66976 KB Output is correct
44 Correct 614 ms 102228 KB Output is correct
45 Correct 574 ms 96856 KB Output is correct
46 Correct 496 ms 87892 KB Output is correct
47 Correct 325 ms 85844 KB Output is correct
48 Correct 322 ms 84328 KB Output is correct
49 Correct 383 ms 90640 KB Output is correct
50 Correct 458 ms 100052 KB Output is correct
51 Correct 391 ms 88116 KB Output is correct
52 Correct 2627 ms 176072 KB Output is correct
53 Correct 2611 ms 176444 KB Output is correct
54 Correct 2234 ms 197556 KB Output is correct
55 Correct 2697 ms 179652 KB Output is correct
56 Correct 2339 ms 172620 KB Output is correct
57 Correct 2543 ms 175616 KB Output is correct
58 Correct 2104 ms 197156 KB Output is correct
59 Correct 2297 ms 180104 KB Output is correct
60 Correct 2133 ms 177332 KB Output is correct
61 Correct 2155 ms 179528 KB Output is correct
62 Correct 1386 ms 176424 KB Output is correct
63 Correct 1845 ms 177928 KB Output is correct
64 Correct 4122 ms 285444 KB Output is correct
65 Correct 708 ms 95552 KB Output is correct
66 Correct 4014 ms 282404 KB Output is correct
67 Correct 2771 ms 260420 KB Output is correct
68 Correct 3916 ms 276896 KB Output is correct
69 Correct 3912 ms 272976 KB Output is correct
70 Correct 3929 ms 279020 KB Output is correct
71 Correct 3997 ms 279092 KB Output is correct
72 Correct 2660 ms 257104 KB Output is correct
73 Correct 3501 ms 267044 KB Output is correct
74 Correct 3770 ms 278568 KB Output is correct
75 Correct 3770 ms 278380 KB Output is correct
76 Correct 1778 ms 225968 KB Output is correct
77 Correct 1821 ms 223652 KB Output is correct
78 Correct 2112 ms 241480 KB Output is correct
79 Correct 2331 ms 255148 KB Output is correct
80 Correct 2264 ms 248876 KB Output is correct
81 Correct 546 ms 106336 KB Output is correct
82 Correct 665 ms 102500 KB Output is correct
83 Correct 706 ms 111472 KB Output is correct
84 Correct 583 ms 107220 KB Output is correct
85 Correct 579 ms 108808 KB Output is correct
86 Correct 612 ms 102440 KB Output is correct
87 Correct 615 ms 104500 KB Output is correct
88 Correct 631 ms 106072 KB Output is correct
89 Correct 627 ms 102204 KB Output is correct
90 Correct 154 ms 70112 KB Output is correct
91 Correct 566 ms 109076 KB Output is correct
92 Correct 804 ms 111640 KB Output is correct
93 Correct 678 ms 112708 KB Output is correct
94 Correct 724 ms 110992 KB Output is correct
95 Correct 630 ms 104148 KB Output is correct
96 Correct 191 ms 62732 KB Output is correct
97 Correct 3602 ms 338476 KB Output is correct
98 Correct 835 ms 85568 KB Output is correct
99 Correct 4694 ms 346260 KB Output is correct
100 Correct 3592 ms 310108 KB Output is correct
101 Execution timed out 5098 ms 367184 KB Time limit exceeded
102 Halted 0 ms 0 KB -