oj.uz

답안 #161040

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161040 2019-10-31T10:05:30 Z Minnakhmetov 새 집 (APIO18_new_home) C++14
80 / 100
 5000 ms 398004 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) {
        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: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:89: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 54 ms 56696 KB Output is correct
2 Correct 54 ms 56700 KB Output is correct
3 Correct 58 ms 56768 KB Output is correct
4 Correct 58 ms 56696 KB Output is correct
5 Correct 61 ms 56824 KB Output is correct
6 Correct 56 ms 56952 KB Output is correct
7 Correct 56 ms 56952 KB Output is correct
8 Correct 58 ms 57080 KB Output is correct
9 Correct 55 ms 57080 KB Output is correct
10 Correct 57 ms 57008 KB Output is correct
11 Correct 54 ms 56952 KB Output is correct
12 Correct 59 ms 56952 KB Output is correct
13 Correct 54 ms 57000 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 54 ms 57020 KB Output is correct
16 Correct 57 ms 57208 KB Output is correct
17 Correct 61 ms 57020 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 54 ms 57080 KB Output is correct
20 Correct 54 ms 57080 KB Output is correct
21 Correct 60 ms 56884 KB Output is correct
22 Correct 54 ms 57080 KB Output is correct
23 Correct 55 ms 57080 KB Output is correct
24 Correct 78 ms 57080 KB Output is correct
25 Correct 57 ms 57092 KB Output is correct
26 Correct 138 ms 56952 KB Output is correct
27 Correct 58 ms 56952 KB Output is correct
28 Correct 57 ms 56952 KB Output is correct
29 Correct 56 ms 56952 KB Output is correct
30 Correct 56 ms 56924 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 56696 KB Output is correct
2 Correct 54 ms 56700 KB Output is correct
3 Correct 58 ms 56768 KB Output is correct
4 Correct 58 ms 56696 KB Output is correct
5 Correct 61 ms 56824 KB Output is correct
6 Correct 56 ms 56952 KB Output is correct
7 Correct 56 ms 56952 KB Output is correct
8 Correct 58 ms 57080 KB Output is correct
9 Correct 55 ms 57080 KB Output is correct
10 Correct 57 ms 57008 KB Output is correct
11 Correct 54 ms 56952 KB Output is correct
12 Correct 59 ms 56952 KB Output is correct
13 Correct 54 ms 57000 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 54 ms 57020 KB Output is correct
16 Correct 57 ms 57208 KB Output is correct
17 Correct 61 ms 57020 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 54 ms 57080 KB Output is correct
20 Correct 54 ms 57080 KB Output is correct
21 Correct 60 ms 56884 KB Output is correct
22 Correct 54 ms 57080 KB Output is correct
23 Correct 55 ms 57080 KB Output is correct
24 Correct 78 ms 57080 KB Output is correct
25 Correct 57 ms 57092 KB Output is correct
26 Correct 138 ms 56952 KB Output is correct
27 Correct 58 ms 56952 KB Output is correct
28 Correct 57 ms 56952 KB Output is correct
29 Correct 56 ms 56952 KB Output is correct
30 Correct 56 ms 56924 KB Output is correct
31 Correct 865 ms 120232 KB Output is correct
32 Correct 174 ms 63036 KB Output is correct
33 Correct 807 ms 117520 KB Output is correct
34 Correct 854 ms 117652 KB Output is correct
35 Correct 878 ms 120356 KB Output is correct
36 Correct 862 ms 120140 KB Output is correct
37 Correct 584 ms 111192 KB Output is correct
38 Correct 681 ms 110836 KB Output is correct
39 Correct 444 ms 101332 KB Output is correct
40 Correct 481 ms 103528 KB Output is correct
41 Correct 718 ms 109476 KB Output is correct
42 Correct 692 ms 110044 KB Output is correct
43 Correct 154 ms 64996 KB Output is correct
44 Correct 734 ms 108648 KB Output is correct
45 Correct 660 ms 103436 KB Output is correct
46 Correct 592 ms 94356 KB Output is correct
47 Correct 358 ms 91480 KB Output is correct
48 Correct 339 ms 90068 KB Output is correct
49 Correct 420 ms 96608 KB Output is correct
50 Correct 488 ms 106184 KB Output is correct
51 Correct 420 ms 94380 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3023 ms 204268 KB Output is correct
2 Correct 2959 ms 203984 KB Output is correct
3 Correct 2673 ms 223224 KB Output is correct
4 Correct 3090 ms 207024 KB Output is correct
5 Correct 2692 ms 200164 KB Output is correct
6 Correct 2870 ms 203996 KB Output is correct
7 Correct 2526 ms 223144 KB Output is correct
8 Correct 2525 ms 209856 KB Output is correct
9 Correct 2496 ms 207160 KB Output is correct
10 Correct 2454 ms 209856 KB Output is correct
11 Correct 1742 ms 206644 KB Output is correct
12 Correct 1783 ms 208404 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4434 ms 314964 KB Output is correct
2 Correct 723 ms 95728 KB Output is correct
3 Correct 4313 ms 314316 KB Output is correct
4 Correct 3149 ms 288380 KB Output is correct
5 Correct 4153 ms 311168 KB Output is correct
6 Correct 4278 ms 305284 KB Output is correct
7 Correct 4217 ms 316668 KB Output is correct
8 Correct 4234 ms 317380 KB Output is correct
9 Correct 2928 ms 291084 KB Output is correct
10 Correct 3772 ms 304396 KB Output is correct
11 Correct 4209 ms 315828 KB Output is correct
12 Correct 4182 ms 316532 KB Output is correct
13 Correct 1989 ms 264796 KB Output is correct
14 Correct 2212 ms 261504 KB Output is correct
15 Correct 2371 ms 280092 KB Output is correct
16 Correct 2759 ms 293952 KB Output is correct
17 Correct 2611 ms 286836 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 56696 KB Output is correct
2 Correct 54 ms 56700 KB Output is correct
3 Correct 58 ms 56768 KB Output is correct
4 Correct 58 ms 56696 KB Output is correct
5 Correct 61 ms 56824 KB Output is correct
6 Correct 56 ms 56952 KB Output is correct
7 Correct 56 ms 56952 KB Output is correct
8 Correct 58 ms 57080 KB Output is correct
9 Correct 55 ms 57080 KB Output is correct
10 Correct 57 ms 57008 KB Output is correct
11 Correct 54 ms 56952 KB Output is correct
12 Correct 59 ms 56952 KB Output is correct
13 Correct 54 ms 57000 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 54 ms 57020 KB Output is correct
16 Correct 57 ms 57208 KB Output is correct
17 Correct 61 ms 57020 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 54 ms 57080 KB Output is correct
20 Correct 54 ms 57080 KB Output is correct
21 Correct 60 ms 56884 KB Output is correct
22 Correct 54 ms 57080 KB Output is correct
23 Correct 55 ms 57080 KB Output is correct
24 Correct 78 ms 57080 KB Output is correct
25 Correct 57 ms 57092 KB Output is correct
26 Correct 138 ms 56952 KB Output is correct
27 Correct 58 ms 56952 KB Output is correct
28 Correct 57 ms 56952 KB Output is correct
29 Correct 56 ms 56952 KB Output is correct
30 Correct 56 ms 56924 KB Output is correct
31 Correct 865 ms 120232 KB Output is correct
32 Correct 174 ms 63036 KB Output is correct
33 Correct 807 ms 117520 KB Output is correct
34 Correct 854 ms 117652 KB Output is correct
35 Correct 878 ms 120356 KB Output is correct
36 Correct 862 ms 120140 KB Output is correct
37 Correct 584 ms 111192 KB Output is correct
38 Correct 681 ms 110836 KB Output is correct
39 Correct 444 ms 101332 KB Output is correct
40 Correct 481 ms 103528 KB Output is correct
41 Correct 718 ms 109476 KB Output is correct
42 Correct 692 ms 110044 KB Output is correct
43 Correct 154 ms 64996 KB Output is correct
44 Correct 734 ms 108648 KB Output is correct
45 Correct 660 ms 103436 KB Output is correct
46 Correct 592 ms 94356 KB Output is correct
47 Correct 358 ms 91480 KB Output is correct
48 Correct 339 ms 90068 KB Output is correct
49 Correct 420 ms 96608 KB Output is correct
50 Correct 488 ms 106184 KB Output is correct
51 Correct 420 ms 94380 KB Output is correct
52 Correct 647 ms 114900 KB Output is correct
53 Correct 713 ms 110756 KB Output is correct
54 Correct 790 ms 120788 KB Output is correct
55 Correct 639 ms 117716 KB Output is correct
56 Correct 633 ms 118632 KB Output is correct
57 Correct 680 ms 113620 KB Output is correct
58 Correct 664 ms 114632 KB Output is correct
59 Correct 640 ms 115668 KB Output is correct
60 Correct 707 ms 113192 KB Output is correct
61 Correct 154 ms 72976 KB Output is correct
62 Correct 612 ms 117856 KB Output is correct
63 Correct 748 ms 121356 KB Output is correct
64 Correct 778 ms 122512 KB Output is correct
65 Correct 857 ms 122088 KB Output is correct
66 Correct 738 ms 115536 KB Output is correct
67 Correct 193 ms 64552 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 56696 KB Output is correct
2 Correct 54 ms 56700 KB Output is correct
3 Correct 58 ms 56768 KB Output is correct
4 Correct 58 ms 56696 KB Output is correct
5 Correct 61 ms 56824 KB Output is correct
6 Correct 56 ms 56952 KB Output is correct
7 Correct 56 ms 56952 KB Output is correct
8 Correct 58 ms 57080 KB Output is correct
9 Correct 55 ms 57080 KB Output is correct
10 Correct 57 ms 57008 KB Output is correct
11 Correct 54 ms 56952 KB Output is correct
12 Correct 59 ms 56952 KB Output is correct
13 Correct 54 ms 57000 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 54 ms 57020 KB Output is correct
16 Correct 57 ms 57208 KB Output is correct
17 Correct 61 ms 57020 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 54 ms 57080 KB Output is correct
20 Correct 54 ms 57080 KB Output is correct
21 Correct 60 ms 56884 KB Output is correct
22 Correct 54 ms 57080 KB Output is correct
23 Correct 55 ms 57080 KB Output is correct
24 Correct 78 ms 57080 KB Output is correct
25 Correct 57 ms 57092 KB Output is correct
26 Correct 138 ms 56952 KB Output is correct
27 Correct 58 ms 56952 KB Output is correct
28 Correct 57 ms 56952 KB Output is correct
29 Correct 56 ms 56952 KB Output is correct
30 Correct 56 ms 56924 KB Output is correct
31 Correct 865 ms 120232 KB Output is correct
32 Correct 174 ms 63036 KB Output is correct
33 Correct 807 ms 117520 KB Output is correct
34 Correct 854 ms 117652 KB Output is correct
35 Correct 878 ms 120356 KB Output is correct
36 Correct 862 ms 120140 KB Output is correct
37 Correct 584 ms 111192 KB Output is correct
38 Correct 681 ms 110836 KB Output is correct
39 Correct 444 ms 101332 KB Output is correct
40 Correct 481 ms 103528 KB Output is correct
41 Correct 718 ms 109476 KB Output is correct
42 Correct 692 ms 110044 KB Output is correct
43 Correct 154 ms 64996 KB Output is correct
44 Correct 734 ms 108648 KB Output is correct
45 Correct 660 ms 103436 KB Output is correct
46 Correct 592 ms 94356 KB Output is correct
47 Correct 358 ms 91480 KB Output is correct
48 Correct 339 ms 90068 KB Output is correct
49 Correct 420 ms 96608 KB Output is correct
50 Correct 488 ms 106184 KB Output is correct
51 Correct 420 ms 94380 KB Output is correct
52 Correct 3023 ms 204268 KB Output is correct
53 Correct 2959 ms 203984 KB Output is correct
54 Correct 2673 ms 223224 KB Output is correct
55 Correct 3090 ms 207024 KB Output is correct
56 Correct 2692 ms 200164 KB Output is correct
57 Correct 2870 ms 203996 KB Output is correct
58 Correct 2526 ms 223144 KB Output is correct
59 Correct 2525 ms 209856 KB Output is correct
60 Correct 2496 ms 207160 KB Output is correct
61 Correct 2454 ms 209856 KB Output is correct
62 Correct 1742 ms 206644 KB Output is correct
63 Correct 1783 ms 208404 KB Output is correct
64 Correct 4434 ms 314964 KB Output is correct
65 Correct 723 ms 95728 KB Output is correct
66 Correct 4313 ms 314316 KB Output is correct
67 Correct 3149 ms 288380 KB Output is correct
68 Correct 4153 ms 311168 KB Output is correct
69 Correct 4278 ms 305284 KB Output is correct
70 Correct 4217 ms 316668 KB Output is correct
71 Correct 4234 ms 317380 KB Output is correct
72 Correct 2928 ms 291084 KB Output is correct
73 Correct 3772 ms 304396 KB Output is correct
74 Correct 4209 ms 315828 KB Output is correct
75 Correct 4182 ms 316532 KB Output is correct
76 Correct 1989 ms 264796 KB Output is correct
77 Correct 2212 ms 261504 KB Output is correct
78 Correct 2371 ms 280092 KB Output is correct
79 Correct 2759 ms 293952 KB Output is correct
80 Correct 2611 ms 286836 KB Output is correct
81 Correct 647 ms 114900 KB Output is correct
82 Correct 713 ms 110756 KB Output is correct
83 Correct 790 ms 120788 KB Output is correct
84 Correct 639 ms 117716 KB Output is correct
85 Correct 633 ms 118632 KB Output is correct
86 Correct 680 ms 113620 KB Output is correct
87 Correct 664 ms 114632 KB Output is correct
88 Correct 640 ms 115668 KB Output is correct
89 Correct 707 ms 113192 KB Output is correct
90 Correct 154 ms 72976 KB Output is correct
91 Correct 612 ms 117856 KB Output is correct
92 Correct 748 ms 121356 KB Output is correct
93 Correct 778 ms 122512 KB Output is correct
94 Correct 857 ms 122088 KB Output is correct
95 Correct 738 ms 115536 KB Output is correct
96 Correct 193 ms 64552 KB Output is correct
97 Correct 3890 ms 372508 KB Output is correct
98 Correct 760 ms 90432 KB Output is correct
99 Correct 4969 ms 389588 KB Output is correct
100 Correct 4075 ms 337140 KB Output is correct
101 Execution timed out 5081 ms 398004 KB Time limit exceeded
102 Halted 0 ms 0 KB -