oj.uz

Submission #161041

# Submission time Handle Problem Language Result Execution time Memory
161041 2019-10-31T10:07:07 Z Minnakhmetov New Home (APIO18_new_home) C++14
80 / 100
 5000 ms 385344 KB 
#include <bits/stdc++.h>
    
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
 
using namespace std;
 
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>, vector<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) {
    mp[x][y].push_back(cq);
}
 
void endSeg(int x, pair<int, int> y) {
    auto &v = mp[x][y];
    if (v.size() == 1)
        updates.push_back({v.back(), cq - 1, {x, y}});
    v.pop_back();
}

void updBetween(int x, int y, bool add) {
    if (x == y || x == -INF && y == INF)
        return;

    int m = (x + y + 1) >> 1;
    int m1 = lower_bound(all(vx), m) - vx.begin();

    if (add)
        startSeg(m1, {y, INF - x});
    else
        endSeg(m1, {y, INF - x});
}
 
void calcAns(int v, int L, int R) {
    if (L != R) {
        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 = L; j <= R; j++) {
        while (i < t[v].size() && t[v][i].first <= lt[j].first) {
            mx = max(mx, t[v][i].second.first);
            i++;
        }
        ans[lt[j].second] = max(ans[lt[j].second], mx - vx[lt[j].first]);
    }    

    i = int(t[v].size()) - 1, mx = -INF;
    for (int j = R; j >= L; j--) {
        while (i >= 0 && t[v][i].first > lt[j].first) {
            mx = max(mx, t[v][i].second.second);
            i--;
        }
        ans[lt[j].second] = max(ans[lt[j].second], mx - INF + vx[lt[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) {
        if (e.t == 0) {
            auto it = occ[e.y].upper_bound(e.x);

            updBetween(*prev(it), *it, false);
            
            if (occ[e.y].size() == 2)
                types_on++;
 
            it = occ[e.y].insert(e.x);

            updBetween(*prev(it), e.x, true);
            updBetween(e.x, *next(it), true);
 
        }
        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:54: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:86:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (i < t[v].size() && t[v][i].first <= lt[j].first) {
                ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 56852 KB Output is correct
2 Correct 54 ms 56696 KB Output is correct
3 Correct 54 ms 56736 KB Output is correct
4 Correct 54 ms 56708 KB Output is correct
5 Correct 53 ms 56824 KB Output is correct
6 Correct 56 ms 57080 KB Output is correct
7 Correct 54 ms 57128 KB Output is correct
8 Correct 56 ms 57032 KB Output is correct
9 Correct 55 ms 57080 KB Output is correct
10 Correct 56 ms 57260 KB Output is correct
11 Correct 61 ms 56952 KB Output is correct
12 Correct 56 ms 56948 KB Output is correct
13 Correct 58 ms 56952 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 57 ms 57080 KB Output is correct
16 Correct 57 ms 57036 KB Output is correct
17 Correct 56 ms 57084 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 55 ms 57080 KB Output is correct
20 Correct 57 ms 57024 KB Output is correct
21 Correct 62 ms 56764 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 63 ms 57080 KB Output is correct
24 Correct 56 ms 57068 KB Output is correct
25 Correct 56 ms 57080 KB Output is correct
26 Correct 61 ms 57020 KB Output is correct
27 Correct 55 ms 56952 KB Output is correct
28 Correct 62 ms 56952 KB Output is correct
29 Correct 58 ms 56952 KB Output is correct
30 Correct 56 ms 56952 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 56852 KB Output is correct
2 Correct 54 ms 56696 KB Output is correct
3 Correct 54 ms 56736 KB Output is correct
4 Correct 54 ms 56708 KB Output is correct
5 Correct 53 ms 56824 KB Output is correct
6 Correct 56 ms 57080 KB Output is correct
7 Correct 54 ms 57128 KB Output is correct
8 Correct 56 ms 57032 KB Output is correct
9 Correct 55 ms 57080 KB Output is correct
10 Correct 56 ms 57260 KB Output is correct
11 Correct 61 ms 56952 KB Output is correct
12 Correct 56 ms 56948 KB Output is correct
13 Correct 58 ms 56952 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 57 ms 57080 KB Output is correct
16 Correct 57 ms 57036 KB Output is correct
17 Correct 56 ms 57084 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 55 ms 57080 KB Output is correct
20 Correct 57 ms 57024 KB Output is correct
21 Correct 62 ms 56764 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 63 ms 57080 KB Output is correct
24 Correct 56 ms 57068 KB Output is correct
25 Correct 56 ms 57080 KB Output is correct
26 Correct 61 ms 57020 KB Output is correct
27 Correct 55 ms 56952 KB Output is correct
28 Correct 62 ms 56952 KB Output is correct
29 Correct 58 ms 56952 KB Output is correct
30 Correct 56 ms 56952 KB Output is correct
31 Correct 826 ms 122688 KB Output is correct
32 Correct 176 ms 63424 KB Output is correct
33 Correct 778 ms 119576 KB Output is correct
34 Correct 783 ms 119960 KB Output is correct
35 Correct 858 ms 122776 KB Output is correct
36 Correct 856 ms 122424 KB Output is correct
37 Correct 570 ms 113528 KB Output is correct
38 Correct 579 ms 113372 KB Output is correct
39 Correct 451 ms 103636 KB Output is correct
40 Correct 467 ms 105992 KB Output is correct
41 Correct 699 ms 111960 KB Output is correct
42 Correct 802 ms 112540 KB Output is correct
43 Correct 150 ms 66784 KB Output is correct
44 Correct 816 ms 111164 KB Output is correct
45 Correct 654 ms 105708 KB Output is correct
46 Correct 556 ms 96756 KB Output is correct
47 Correct 349 ms 93756 KB Output is correct
48 Correct 341 ms 92176 KB Output is correct
49 Correct 417 ms 98908 KB Output is correct
50 Correct 575 ms 108448 KB Output is correct
51 Correct 429 ms 96548 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2984 ms 209284 KB Output is correct
2 Correct 2876 ms 210540 KB Output is correct
3 Correct 2755 ms 227608 KB Output is correct
4 Correct 2928 ms 211688 KB Output is correct
5 Correct 2806 ms 206140 KB Output is correct
6 Correct 2825 ms 211168 KB Output is correct
7 Correct 2321 ms 229596 KB Output is correct
8 Correct 2839 ms 216180 KB Output is correct
9 Correct 2432 ms 214604 KB Output is correct
10 Correct 2440 ms 217420 KB Output is correct
11 Correct 1650 ms 214316 KB Output is correct
12 Correct 1790 ms 216072 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4769 ms 321800 KB Output is correct
2 Correct 734 ms 97184 KB Output is correct
3 Correct 4566 ms 319888 KB Output is correct
4 Correct 3183 ms 292864 KB Output is correct
5 Correct 4368 ms 311512 KB Output is correct
6 Correct 4033 ms 307408 KB Output is correct
7 Correct 4082 ms 314332 KB Output is correct
8 Correct 4300 ms 315020 KB Output is correct
9 Correct 2824 ms 287744 KB Output is correct
10 Correct 3800 ms 299840 KB Output is correct
11 Correct 3955 ms 311464 KB Output is correct
12 Correct 4022 ms 312348 KB Output is correct
13 Correct 2009 ms 260636 KB Output is correct
14 Correct 1933 ms 257416 KB Output is correct
15 Correct 2434 ms 275968 KB Output is correct
16 Correct 2564 ms 290356 KB Output is correct
17 Correct 2671 ms 283780 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 56852 KB Output is correct
2 Correct 54 ms 56696 KB Output is correct
3 Correct 54 ms 56736 KB Output is correct
4 Correct 54 ms 56708 KB Output is correct
5 Correct 53 ms 56824 KB Output is correct
6 Correct 56 ms 57080 KB Output is correct
7 Correct 54 ms 57128 KB Output is correct
8 Correct 56 ms 57032 KB Output is correct
9 Correct 55 ms 57080 KB Output is correct
10 Correct 56 ms 57260 KB Output is correct
11 Correct 61 ms 56952 KB Output is correct
12 Correct 56 ms 56948 KB Output is correct
13 Correct 58 ms 56952 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 57 ms 57080 KB Output is correct
16 Correct 57 ms 57036 KB Output is correct
17 Correct 56 ms 57084 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 55 ms 57080 KB Output is correct
20 Correct 57 ms 57024 KB Output is correct
21 Correct 62 ms 56764 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 63 ms 57080 KB Output is correct
24 Correct 56 ms 57068 KB Output is correct
25 Correct 56 ms 57080 KB Output is correct
26 Correct 61 ms 57020 KB Output is correct
27 Correct 55 ms 56952 KB Output is correct
28 Correct 62 ms 56952 KB Output is correct
29 Correct 58 ms 56952 KB Output is correct
30 Correct 56 ms 56952 KB Output is correct
31 Correct 826 ms 122688 KB Output is correct
32 Correct 176 ms 63424 KB Output is correct
33 Correct 778 ms 119576 KB Output is correct
34 Correct 783 ms 119960 KB Output is correct
35 Correct 858 ms 122776 KB Output is correct
36 Correct 856 ms 122424 KB Output is correct
37 Correct 570 ms 113528 KB Output is correct
38 Correct 579 ms 113372 KB Output is correct
39 Correct 451 ms 103636 KB Output is correct
40 Correct 467 ms 105992 KB Output is correct
41 Correct 699 ms 111960 KB Output is correct
42 Correct 802 ms 112540 KB Output is correct
43 Correct 150 ms 66784 KB Output is correct
44 Correct 816 ms 111164 KB Output is correct
45 Correct 654 ms 105708 KB Output is correct
46 Correct 556 ms 96756 KB Output is correct
47 Correct 349 ms 93756 KB Output is correct
48 Correct 341 ms 92176 KB Output is correct
49 Correct 417 ms 98908 KB Output is correct
50 Correct 575 ms 108448 KB Output is correct
51 Correct 429 ms 96548 KB Output is correct
52 Correct 675 ms 113636 KB Output is correct
53 Correct 656 ms 109636 KB Output is correct
54 Correct 836 ms 119508 KB Output is correct
55 Correct 645 ms 116484 KB Output is correct
56 Correct 648 ms 117620 KB Output is correct
57 Correct 688 ms 112476 KB Output is correct
58 Correct 687 ms 113400 KB Output is correct
59 Correct 683 ms 114536 KB Output is correct
60 Correct 722 ms 112032 KB Output is correct
61 Correct 159 ms 72288 KB Output is correct
62 Correct 633 ms 116660 KB Output is correct
63 Correct 778 ms 120124 KB Output is correct
64 Correct 800 ms 121428 KB Output is correct
65 Correct 845 ms 120968 KB Output is correct
66 Correct 736 ms 114592 KB Output is correct
67 Correct 192 ms 64352 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 56852 KB Output is correct
2 Correct 54 ms 56696 KB Output is correct
3 Correct 54 ms 56736 KB Output is correct
4 Correct 54 ms 56708 KB Output is correct
5 Correct 53 ms 56824 KB Output is correct
6 Correct 56 ms 57080 KB Output is correct
7 Correct 54 ms 57128 KB Output is correct
8 Correct 56 ms 57032 KB Output is correct
9 Correct 55 ms 57080 KB Output is correct
10 Correct 56 ms 57260 KB Output is correct
11 Correct 61 ms 56952 KB Output is correct
12 Correct 56 ms 56948 KB Output is correct
13 Correct 58 ms 56952 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 57 ms 57080 KB Output is correct
16 Correct 57 ms 57036 KB Output is correct
17 Correct 56 ms 57084 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 55 ms 57080 KB Output is correct
20 Correct 57 ms 57024 KB Output is correct
21 Correct 62 ms 56764 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 63 ms 57080 KB Output is correct
24 Correct 56 ms 57068 KB Output is correct
25 Correct 56 ms 57080 KB Output is correct
26 Correct 61 ms 57020 KB Output is correct
27 Correct 55 ms 56952 KB Output is correct
28 Correct 62 ms 56952 KB Output is correct
29 Correct 58 ms 56952 KB Output is correct
30 Correct 56 ms 56952 KB Output is correct
31 Correct 826 ms 122688 KB Output is correct
32 Correct 176 ms 63424 KB Output is correct
33 Correct 778 ms 119576 KB Output is correct
34 Correct 783 ms 119960 KB Output is correct
35 Correct 858 ms 122776 KB Output is correct
36 Correct 856 ms 122424 KB Output is correct
37 Correct 570 ms 113528 KB Output is correct
38 Correct 579 ms 113372 KB Output is correct
39 Correct 451 ms 103636 KB Output is correct
40 Correct 467 ms 105992 KB Output is correct
41 Correct 699 ms 111960 KB Output is correct
42 Correct 802 ms 112540 KB Output is correct
43 Correct 150 ms 66784 KB Output is correct
44 Correct 816 ms 111164 KB Output is correct
45 Correct 654 ms 105708 KB Output is correct
46 Correct 556 ms 96756 KB Output is correct
47 Correct 349 ms 93756 KB Output is correct
48 Correct 341 ms 92176 KB Output is correct
49 Correct 417 ms 98908 KB Output is correct
50 Correct 575 ms 108448 KB Output is correct
51 Correct 429 ms 96548 KB Output is correct
52 Correct 2984 ms 209284 KB Output is correct
53 Correct 2876 ms 210540 KB Output is correct
54 Correct 2755 ms 227608 KB Output is correct
55 Correct 2928 ms 211688 KB Output is correct
56 Correct 2806 ms 206140 KB Output is correct
57 Correct 2825 ms 211168 KB Output is correct
58 Correct 2321 ms 229596 KB Output is correct
59 Correct 2839 ms 216180 KB Output is correct
60 Correct 2432 ms 214604 KB Output is correct
61 Correct 2440 ms 217420 KB Output is correct
62 Correct 1650 ms 214316 KB Output is correct
63 Correct 1790 ms 216072 KB Output is correct
64 Correct 4769 ms 321800 KB Output is correct
65 Correct 734 ms 97184 KB Output is correct
66 Correct 4566 ms 319888 KB Output is correct
67 Correct 3183 ms 292864 KB Output is correct
68 Correct 4368 ms 311512 KB Output is correct
69 Correct 4033 ms 307408 KB Output is correct
70 Correct 4082 ms 314332 KB Output is correct
71 Correct 4300 ms 315020 KB Output is correct
72 Correct 2824 ms 287744 KB Output is correct
73 Correct 3800 ms 299840 KB Output is correct
74 Correct 3955 ms 311464 KB Output is correct
75 Correct 4022 ms 312348 KB Output is correct
76 Correct 2009 ms 260636 KB Output is correct
77 Correct 1933 ms 257416 KB Output is correct
78 Correct 2434 ms 275968 KB Output is correct
79 Correct 2564 ms 290356 KB Output is correct
80 Correct 2671 ms 283780 KB Output is correct
81 Correct 675 ms 113636 KB Output is correct
82 Correct 656 ms 109636 KB Output is correct
83 Correct 836 ms 119508 KB Output is correct
84 Correct 645 ms 116484 KB Output is correct
85 Correct 648 ms 117620 KB Output is correct
86 Correct 688 ms 112476 KB Output is correct
87 Correct 687 ms 113400 KB Output is correct
88 Correct 683 ms 114536 KB Output is correct
89 Correct 722 ms 112032 KB Output is correct
90 Correct 159 ms 72288 KB Output is correct
91 Correct 633 ms 116660 KB Output is correct
92 Correct 778 ms 120124 KB Output is correct
93 Correct 800 ms 121428 KB Output is correct
94 Correct 845 ms 120968 KB Output is correct
95 Correct 736 ms 114592 KB Output is correct
96 Correct 192 ms 64352 KB Output is correct
97 Correct 3889 ms 370276 KB Output is correct
98 Correct 760 ms 86708 KB Output is correct
99 Execution timed out 5034 ms 385344 KB Time limit exceeded
100 Halted 0 ms 0 KB -