oj.uz

답안 #161039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161039 2019-10-31T10:04:19 Z Minnakhmetov 새 집 (APIO18_new_home) C++14
80 / 100
 5000 ms 412104 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) {
    if (y.first == -INF && y.second == INF)
        return;
    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) / 2;
    if ((x + y) % 2)
        m++;
    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) {
        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]);
    }    

    i = int(t[v].size()) - 1, mx = -INF;
    for (int j = R - L; j >= 0; j--) {
        while (i >= 0 && 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 - INF + 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) {
        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:56: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:93: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

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 56696 KB Output is correct
2 Correct 54 ms 56668 KB Output is correct
3 Correct 55 ms 56696 KB Output is correct
4 Correct 55 ms 56708 KB Output is correct
5 Correct 55 ms 56824 KB Output is correct
6 Correct 56 ms 57080 KB Output is correct
7 Correct 58 ms 57208 KB Output is correct
8 Correct 59 ms 57080 KB Output is correct
9 Correct 57 ms 57108 KB Output is correct
10 Correct 56 ms 57080 KB Output is correct
11 Correct 64 ms 56952 KB Output is correct
12 Correct 57 ms 56952 KB Output is correct
13 Correct 58 ms 57080 KB Output is correct
14 Correct 62 ms 56976 KB Output is correct
15 Correct 62 ms 57208 KB Output is correct
16 Correct 56 ms 57080 KB Output is correct
17 Correct 62 ms 57080 KB Output is correct
18 Correct 60 ms 57080 KB Output is correct
19 Correct 56 ms 57020 KB Output is correct
20 Correct 62 ms 57080 KB Output is correct
21 Correct 54 ms 56884 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 63 ms 56996 KB Output is correct
24 Correct 57 ms 57084 KB Output is correct
25 Correct 57 ms 56976 KB Output is correct
26 Correct 56 ms 56956 KB Output is correct
27 Correct 56 ms 56952 KB Output is correct
28 Correct 61 ms 56952 KB Output is correct
29 Correct 62 ms 56952 KB Output is correct
30 Correct 63 ms 56952 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 56696 KB Output is correct
2 Correct 54 ms 56668 KB Output is correct
3 Correct 55 ms 56696 KB Output is correct
4 Correct 55 ms 56708 KB Output is correct
5 Correct 55 ms 56824 KB Output is correct
6 Correct 56 ms 57080 KB Output is correct
7 Correct 58 ms 57208 KB Output is correct
8 Correct 59 ms 57080 KB Output is correct
9 Correct 57 ms 57108 KB Output is correct
10 Correct 56 ms 57080 KB Output is correct
11 Correct 64 ms 56952 KB Output is correct
12 Correct 57 ms 56952 KB Output is correct
13 Correct 58 ms 57080 KB Output is correct
14 Correct 62 ms 56976 KB Output is correct
15 Correct 62 ms 57208 KB Output is correct
16 Correct 56 ms 57080 KB Output is correct
17 Correct 62 ms 57080 KB Output is correct
18 Correct 60 ms 57080 KB Output is correct
19 Correct 56 ms 57020 KB Output is correct
20 Correct 62 ms 57080 KB Output is correct
21 Correct 54 ms 56884 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 63 ms 56996 KB Output is correct
24 Correct 57 ms 57084 KB Output is correct
25 Correct 57 ms 56976 KB Output is correct
26 Correct 56 ms 56956 KB Output is correct
27 Correct 56 ms 56952 KB Output is correct
28 Correct 61 ms 56952 KB Output is correct
29 Correct 62 ms 56952 KB Output is correct
30 Correct 63 ms 56952 KB Output is correct
31 Correct 861 ms 122812 KB Output is correct
32 Correct 174 ms 63520 KB Output is correct
33 Correct 811 ms 119692 KB Output is correct
34 Correct 823 ms 120108 KB Output is correct
35 Correct 908 ms 122708 KB Output is correct
36 Correct 893 ms 122420 KB Output is correct
37 Correct 644 ms 113696 KB Output is correct
38 Correct 586 ms 113476 KB Output is correct
39 Correct 473 ms 103892 KB Output is correct
40 Correct 478 ms 105940 KB Output is correct
41 Correct 697 ms 111840 KB Output is correct
42 Correct 712 ms 112560 KB Output is correct
43 Correct 153 ms 66784 KB Output is correct
44 Correct 724 ms 111168 KB Output is correct
45 Correct 646 ms 105812 KB Output is correct
46 Correct 869 ms 96732 KB Output is correct
47 Correct 353 ms 93776 KB Output is correct
48 Correct 345 ms 92248 KB Output is correct
49 Correct 451 ms 99036 KB Output is correct
50 Correct 521 ms 108616 KB Output is correct
51 Correct 442 ms 96608 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2972 ms 212516 KB Output is correct
2 Correct 3260 ms 207472 KB Output is correct
3 Correct 2846 ms 227252 KB Output is correct
4 Correct 3004 ms 211436 KB Output is correct
5 Correct 2617 ms 203500 KB Output is correct
6 Correct 3034 ms 207332 KB Output is correct
7 Correct 2799 ms 227548 KB Output is correct
8 Correct 2491 ms 213264 KB Output is correct
9 Correct 2385 ms 209824 KB Output is correct
10 Correct 2467 ms 212044 KB Output is correct
11 Correct 1613 ms 208164 KB Output is correct
12 Correct 1856 ms 210956 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4660 ms 315836 KB Output is correct
2 Correct 726 ms 95812 KB Output is correct
3 Correct 4609 ms 314276 KB Output is correct
4 Correct 3033 ms 287724 KB Output is correct
5 Correct 4318 ms 307092 KB Output is correct
6 Correct 4392 ms 304228 KB Output is correct
7 Correct 4463 ms 313540 KB Output is correct
8 Correct 4609 ms 314088 KB Output is correct
9 Correct 3258 ms 286856 KB Output is correct
10 Correct 3755 ms 298612 KB Output is correct
11 Correct 4051 ms 310360 KB Output is correct
12 Correct 4239 ms 311132 KB Output is correct
13 Correct 2057 ms 259404 KB Output is correct
14 Correct 1983 ms 256100 KB Output is correct
15 Correct 2284 ms 274780 KB Output is correct
16 Correct 2697 ms 288828 KB Output is correct
17 Correct 2580 ms 282296 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 56696 KB Output is correct
2 Correct 54 ms 56668 KB Output is correct
3 Correct 55 ms 56696 KB Output is correct
4 Correct 55 ms 56708 KB Output is correct
5 Correct 55 ms 56824 KB Output is correct
6 Correct 56 ms 57080 KB Output is correct
7 Correct 58 ms 57208 KB Output is correct
8 Correct 59 ms 57080 KB Output is correct
9 Correct 57 ms 57108 KB Output is correct
10 Correct 56 ms 57080 KB Output is correct
11 Correct 64 ms 56952 KB Output is correct
12 Correct 57 ms 56952 KB Output is correct
13 Correct 58 ms 57080 KB Output is correct
14 Correct 62 ms 56976 KB Output is correct
15 Correct 62 ms 57208 KB Output is correct
16 Correct 56 ms 57080 KB Output is correct
17 Correct 62 ms 57080 KB Output is correct
18 Correct 60 ms 57080 KB Output is correct
19 Correct 56 ms 57020 KB Output is correct
20 Correct 62 ms 57080 KB Output is correct
21 Correct 54 ms 56884 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 63 ms 56996 KB Output is correct
24 Correct 57 ms 57084 KB Output is correct
25 Correct 57 ms 56976 KB Output is correct
26 Correct 56 ms 56956 KB Output is correct
27 Correct 56 ms 56952 KB Output is correct
28 Correct 61 ms 56952 KB Output is correct
29 Correct 62 ms 56952 KB Output is correct
30 Correct 63 ms 56952 KB Output is correct
31 Correct 861 ms 122812 KB Output is correct
32 Correct 174 ms 63520 KB Output is correct
33 Correct 811 ms 119692 KB Output is correct
34 Correct 823 ms 120108 KB Output is correct
35 Correct 908 ms 122708 KB Output is correct
36 Correct 893 ms 122420 KB Output is correct
37 Correct 644 ms 113696 KB Output is correct
38 Correct 586 ms 113476 KB Output is correct
39 Correct 473 ms 103892 KB Output is correct
40 Correct 478 ms 105940 KB Output is correct
41 Correct 697 ms 111840 KB Output is correct
42 Correct 712 ms 112560 KB Output is correct
43 Correct 153 ms 66784 KB Output is correct
44 Correct 724 ms 111168 KB Output is correct
45 Correct 646 ms 105812 KB Output is correct
46 Correct 869 ms 96732 KB Output is correct
47 Correct 353 ms 93776 KB Output is correct
48 Correct 345 ms 92248 KB Output is correct
49 Correct 451 ms 99036 KB Output is correct
50 Correct 521 ms 108616 KB Output is correct
51 Correct 442 ms 96608 KB Output is correct
52 Correct 631 ms 113528 KB Output is correct
53 Correct 649 ms 109360 KB Output is correct
54 Correct 805 ms 119444 KB Output is correct
55 Correct 643 ms 116352 KB Output is correct
56 Correct 633 ms 117344 KB Output is correct
57 Correct 684 ms 112268 KB Output is correct
58 Correct 676 ms 113184 KB Output is correct
59 Correct 675 ms 114340 KB Output is correct
60 Correct 681 ms 111920 KB Output is correct
61 Correct 181 ms 72156 KB Output is correct
62 Correct 596 ms 116384 KB Output is correct
63 Correct 753 ms 120044 KB Output is correct
64 Correct 795 ms 121184 KB Output is correct
65 Correct 811 ms 120772 KB Output is correct
66 Correct 701 ms 114296 KB Output is correct
67 Correct 194 ms 64520 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 56696 KB Output is correct
2 Correct 54 ms 56668 KB Output is correct
3 Correct 55 ms 56696 KB Output is correct
4 Correct 55 ms 56708 KB Output is correct
5 Correct 55 ms 56824 KB Output is correct
6 Correct 56 ms 57080 KB Output is correct
7 Correct 58 ms 57208 KB Output is correct
8 Correct 59 ms 57080 KB Output is correct
9 Correct 57 ms 57108 KB Output is correct
10 Correct 56 ms 57080 KB Output is correct
11 Correct 64 ms 56952 KB Output is correct
12 Correct 57 ms 56952 KB Output is correct
13 Correct 58 ms 57080 KB Output is correct
14 Correct 62 ms 56976 KB Output is correct
15 Correct 62 ms 57208 KB Output is correct
16 Correct 56 ms 57080 KB Output is correct
17 Correct 62 ms 57080 KB Output is correct
18 Correct 60 ms 57080 KB Output is correct
19 Correct 56 ms 57020 KB Output is correct
20 Correct 62 ms 57080 KB Output is correct
21 Correct 54 ms 56884 KB Output is correct
22 Correct 56 ms 57080 KB Output is correct
23 Correct 63 ms 56996 KB Output is correct
24 Correct 57 ms 57084 KB Output is correct
25 Correct 57 ms 56976 KB Output is correct
26 Correct 56 ms 56956 KB Output is correct
27 Correct 56 ms 56952 KB Output is correct
28 Correct 61 ms 56952 KB Output is correct
29 Correct 62 ms 56952 KB Output is correct
30 Correct 63 ms 56952 KB Output is correct
31 Correct 861 ms 122812 KB Output is correct
32 Correct 174 ms 63520 KB Output is correct
33 Correct 811 ms 119692 KB Output is correct
34 Correct 823 ms 120108 KB Output is correct
35 Correct 908 ms 122708 KB Output is correct
36 Correct 893 ms 122420 KB Output is correct
37 Correct 644 ms 113696 KB Output is correct
38 Correct 586 ms 113476 KB Output is correct
39 Correct 473 ms 103892 KB Output is correct
40 Correct 478 ms 105940 KB Output is correct
41 Correct 697 ms 111840 KB Output is correct
42 Correct 712 ms 112560 KB Output is correct
43 Correct 153 ms 66784 KB Output is correct
44 Correct 724 ms 111168 KB Output is correct
45 Correct 646 ms 105812 KB Output is correct
46 Correct 869 ms 96732 KB Output is correct
47 Correct 353 ms 93776 KB Output is correct
48 Correct 345 ms 92248 KB Output is correct
49 Correct 451 ms 99036 KB Output is correct
50 Correct 521 ms 108616 KB Output is correct
51 Correct 442 ms 96608 KB Output is correct
52 Correct 2972 ms 212516 KB Output is correct
53 Correct 3260 ms 207472 KB Output is correct
54 Correct 2846 ms 227252 KB Output is correct
55 Correct 3004 ms 211436 KB Output is correct
56 Correct 2617 ms 203500 KB Output is correct
57 Correct 3034 ms 207332 KB Output is correct
58 Correct 2799 ms 227548 KB Output is correct
59 Correct 2491 ms 213264 KB Output is correct
60 Correct 2385 ms 209824 KB Output is correct
61 Correct 2467 ms 212044 KB Output is correct
62 Correct 1613 ms 208164 KB Output is correct
63 Correct 1856 ms 210956 KB Output is correct
64 Correct 4660 ms 315836 KB Output is correct
65 Correct 726 ms 95812 KB Output is correct
66 Correct 4609 ms 314276 KB Output is correct
67 Correct 3033 ms 287724 KB Output is correct
68 Correct 4318 ms 307092 KB Output is correct
69 Correct 4392 ms 304228 KB Output is correct
70 Correct 4463 ms 313540 KB Output is correct
71 Correct 4609 ms 314088 KB Output is correct
72 Correct 3258 ms 286856 KB Output is correct
73 Correct 3755 ms 298612 KB Output is correct
74 Correct 4051 ms 310360 KB Output is correct
75 Correct 4239 ms 311132 KB Output is correct
76 Correct 2057 ms 259404 KB Output is correct
77 Correct 1983 ms 256100 KB Output is correct
78 Correct 2284 ms 274780 KB Output is correct
79 Correct 2697 ms 288828 KB Output is correct
80 Correct 2580 ms 282296 KB Output is correct
81 Correct 631 ms 113528 KB Output is correct
82 Correct 649 ms 109360 KB Output is correct
83 Correct 805 ms 119444 KB Output is correct
84 Correct 643 ms 116352 KB Output is correct
85 Correct 633 ms 117344 KB Output is correct
86 Correct 684 ms 112268 KB Output is correct
87 Correct 676 ms 113184 KB Output is correct
88 Correct 675 ms 114340 KB Output is correct
89 Correct 681 ms 111920 KB Output is correct
90 Correct 181 ms 72156 KB Output is correct
91 Correct 596 ms 116384 KB Output is correct
92 Correct 753 ms 120044 KB Output is correct
93 Correct 795 ms 121184 KB Output is correct
94 Correct 811 ms 120772 KB Output is correct
95 Correct 701 ms 114296 KB Output is correct
96 Correct 194 ms 64520 KB Output is correct
97 Correct 4011 ms 369140 KB Output is correct
98 Correct 756 ms 88216 KB Output is correct
99 Correct 5000 ms 385876 KB Output is correct
100 Correct 3894 ms 350072 KB Output is correct
101 Execution timed out 5052 ms 412104 KB Time limit exceeded
102 Halted 0 ms 0 KB -