oj.uz

답안 #161029

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161029 2019-10-31T09:12:38 Z Minnakhmetov 새 집 (APIO18_new_home) C++14
57 / 100
 5000 ms 419064 KB 
#include <bits/stdc++.h>
    
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()

#pragma GCC optimize("O3")
 
using namespace std;
 
struct E {
    int p, t, x, y;
};
 
struct U {
    int l, r;
    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];
unordered_map<int, vector<int>> mp[2][N];
bool ok[N];
 
vector<int> vx;
multiset<int> occ[N];
vector<pair<int, int>> t[2][N * 4];
vector<U> updates[2];
 
void upd(int type, int l, int r, pair<int, int> p, int v, int L, int R) {
    if (l > r)
        return;
    if (L == l && R == r) {
        t[type][v].push_back(p);
    }
    else {
        int m = (L + R) >> 1;
        upd(type, l, min(m, r), p, v * 2, L, m);
        upd(type, max(m + 1, l), r, p, v * 2 + 1, m + 1, R);
    }
}
 
void startSeg(int type, int x, int y) {
    mp[type][x][y].push_back(cq);
}
 
void endSeg(int type, int x, int y) {
    auto &v = mp[type][x][y];
    if (v.size() == 1)
        updates[type].push_back({v.back(), cq - 1, {x, y}});
    v.pop_back();
}
 
void updBeg(int x, bool add) {
    if (add)
        startSeg(0, 0, x);
    else
        endSeg(0, 0, x);
}
 
void updBetween(int x, int y, bool add) {
    if (x == y)
        return;
    int m = (x + y) / 2;
    if ((x + y) % 2)
        m++;
 
    // cout << "BET " << x << " " << y << " " << add << "\n";
 
    int m1 = lower_bound(all(vx), m) - vx.begin();
    if (add) {
        startSeg(0, m1, y);
        startSeg(1, cc - m1, INF - x);
    }
    else {
        endSeg(0, m1, y);
        endSeg(1, cc - m1, INF - x);
    }
}
 
void updEnd(int x, bool add) {
    if (add)
        startSeg(1, 0, INF - x);
    else
        endSeg(1, 0, 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[0][v].size() && t[0][v][i].first <= tmp[j].first) {
            mx = max(mx, t[0][v][i].second);
            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;
 
    // for (int j = 0; j <= R - L; j++) {
    //     cout << tmp[j].first << " " << tmp[j].second << "\n";
    // }
 
    // for (auto p : t[1][v]) {
    //     cout << p.first << " " << p.second << "\n";
    // }
 
    // cout << ans[0] << "\n";
 
    i = 0, mx = -INF;
    for (int j = 0; j <= R - L; j++) {
        while (i < t[1][v].size() && t[1][v][i].first <= tmp[j].first) {
            mx = max(mx, t[1][v][i].second);
            i++;
        }
        ans[tmp[j].second] = max(ans[tmp[j].second], mx - INF + 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) {
            auto it = occ[e.y].upper_bound(e.x);
            if (!occ[e.y].empty()) {
                if (it != occ[e.y].begin() && it != occ[e.y].end()) {
                    updBetween(*prev(it), *it, false);
                }
                if (it == occ[e.y].begin()) {
                    updBeg(*it, false);
                }
                if (it == occ[e.y].end()) {
                    updEnd(*prev(it), false);
                }
            }
            else {
                types_on++;
            }
 
            it = occ[e.y].insert(e.x);
 
            if (it == occ[e.y].begin()) 
                updBeg(e.x, true);
            else
                updBetween(*prev(it), e.x, true);
 
            if (next(it) != occ[e.y].end())
                updBetween(e.x, *next(it), true);
            else
                updEnd(e.x, true);
 
        }
        else if (e.t == 1) {
            auto it = occ[e.y].find(e.x);
 
            if (it == occ[e.y].begin()) 
                updBeg(*it, false);
            else
                updBetween(*prev(it), *it, false);
 
            if (next(it) != occ[e.y].end())
                updBetween(*it, *next(it), false);
            else
                updEnd(e.x, false);
 
            if (it != occ[e.y].begin() && next(it) != occ[e.y].end())
                updBetween(*prev(it), *next(it), true);
            if (it == occ[e.y].begin() && occ[e.y].size() > 1)
                updBeg(*next(it), true);
 
            if (next(it) == occ[e.y].end() &&
                occ[e.y].size() > 1)
                updEnd(*prev(it), true);
 
            occ[e.y].erase(it);

            if (occ[e.y].empty())
                types_on--;
        }
        else {
            ok[e.y] = (types_on == k);
            lt[cq++] = {lower_bound(all(vx), e.x) - vx.begin(), e.y};
        }
    }
 
    for (int i = 0; i < 2; i++) {
        sort(all(updates[i]), [](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});
    }
 
    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 (int i = 0; i < 2; i++) {
        for (U &u : updates[i]) {
            upd(i, 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 calcAns(int, int, int)':
new_home.cpp:112:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (i < t[0][v].size() && t[0][v][i].first <= tmp[j].first) {
                ~~^~~~~~~~~~~~~~~~
new_home.cpp:136:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (i < t[1][v].size() && t[1][v][i].first <= tmp[j].first) {
                ~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 103736 KB Output is correct
2 Correct 99 ms 103624 KB Output is correct
3 Correct 102 ms 103732 KB Output is correct
4 Correct 106 ms 103732 KB Output is correct
5 Correct 101 ms 103812 KB Output is correct
6 Correct 104 ms 104096 KB Output is correct
7 Correct 100 ms 103844 KB Output is correct
8 Correct 101 ms 104060 KB Output is correct
9 Correct 108 ms 103976 KB Output is correct
10 Correct 104 ms 104172 KB Output is correct
11 Correct 102 ms 103976 KB Output is correct
12 Correct 100 ms 104052 KB Output is correct
13 Correct 100 ms 103928 KB Output is correct
14 Correct 111 ms 103968 KB Output is correct
15 Correct 108 ms 103988 KB Output is correct
16 Correct 107 ms 104048 KB Output is correct
17 Correct 105 ms 104076 KB Output is correct
18 Correct 100 ms 104048 KB Output is correct
19 Correct 104 ms 104100 KB Output is correct
20 Correct 104 ms 104068 KB Output is correct
21 Correct 98 ms 103836 KB Output is correct
22 Correct 102 ms 103984 KB Output is correct
23 Correct 100 ms 104048 KB Output is correct
24 Correct 104 ms 104056 KB Output is correct
25 Correct 104 ms 104088 KB Output is correct
26 Correct 103 ms 104028 KB Output is correct
27 Correct 102 ms 103844 KB Output is correct
28 Correct 101 ms 103904 KB Output is correct
29 Correct 102 ms 104056 KB Output is correct
30 Correct 99 ms 103800 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 103736 KB Output is correct
2 Correct 99 ms 103624 KB Output is correct
3 Correct 102 ms 103732 KB Output is correct
4 Correct 106 ms 103732 KB Output is correct
5 Correct 101 ms 103812 KB Output is correct
6 Correct 104 ms 104096 KB Output is correct
7 Correct 100 ms 103844 KB Output is correct
8 Correct 101 ms 104060 KB Output is correct
9 Correct 108 ms 103976 KB Output is correct
10 Correct 104 ms 104172 KB Output is correct
11 Correct 102 ms 103976 KB Output is correct
12 Correct 100 ms 104052 KB Output is correct
13 Correct 100 ms 103928 KB Output is correct
14 Correct 111 ms 103968 KB Output is correct
15 Correct 108 ms 103988 KB Output is correct
16 Correct 107 ms 104048 KB Output is correct
17 Correct 105 ms 104076 KB Output is correct
18 Correct 100 ms 104048 KB Output is correct
19 Correct 104 ms 104100 KB Output is correct
20 Correct 104 ms 104068 KB Output is correct
21 Correct 98 ms 103836 KB Output is correct
22 Correct 102 ms 103984 KB Output is correct
23 Correct 100 ms 104048 KB Output is correct
24 Correct 104 ms 104056 KB Output is correct
25 Correct 104 ms 104088 KB Output is correct
26 Correct 103 ms 104028 KB Output is correct
27 Correct 102 ms 103844 KB Output is correct
28 Correct 101 ms 103904 KB Output is correct
29 Correct 102 ms 104056 KB Output is correct
30 Correct 99 ms 103800 KB Output is correct
31 Correct 1357 ms 192420 KB Output is correct
32 Correct 240 ms 109604 KB Output is correct
33 Correct 1332 ms 190032 KB Output is correct
34 Correct 1405 ms 189212 KB Output is correct
35 Correct 1545 ms 193192 KB Output is correct
36 Correct 1407 ms 192048 KB Output is correct
37 Correct 965 ms 181940 KB Output is correct
38 Correct 939 ms 179020 KB Output is correct
39 Correct 726 ms 166432 KB Output is correct
40 Correct 753 ms 168968 KB Output is correct
41 Correct 928 ms 160604 KB Output is correct
42 Correct 1020 ms 161504 KB Output is correct
43 Correct 198 ms 111428 KB Output is correct
44 Correct 898 ms 159644 KB Output is correct
45 Correct 849 ms 155028 KB Output is correct
46 Correct 758 ms 146560 KB Output is correct
47 Correct 503 ms 140728 KB Output is correct
48 Correct 494 ms 140256 KB Output is correct
49 Correct 596 ms 147936 KB Output is correct
50 Correct 689 ms 155480 KB Output is correct
51 Correct 604 ms 146124 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3427 ms 268708 KB Output is correct
2 Correct 4724 ms 308596 KB Output is correct
3 Correct 2064 ms 228072 KB Output is correct
4 Correct 3206 ms 264864 KB Output is correct
5 Correct 3650 ms 280144 KB Output is correct
6 Correct 4309 ms 300144 KB Output is correct
7 Correct 1727 ms 225832 KB Output is correct
8 Correct 2690 ms 260464 KB Output is correct
9 Correct 3509 ms 291484 KB Output is correct
10 Correct 3853 ms 322732 KB Output is correct
11 Correct 2493 ms 313340 KB Output is correct
12 Correct 3293 ms 317660 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5128 ms 419064 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 103736 KB Output is correct
2 Correct 99 ms 103624 KB Output is correct
3 Correct 102 ms 103732 KB Output is correct
4 Correct 106 ms 103732 KB Output is correct
5 Correct 101 ms 103812 KB Output is correct
6 Correct 104 ms 104096 KB Output is correct
7 Correct 100 ms 103844 KB Output is correct
8 Correct 101 ms 104060 KB Output is correct
9 Correct 108 ms 103976 KB Output is correct
10 Correct 104 ms 104172 KB Output is correct
11 Correct 102 ms 103976 KB Output is correct
12 Correct 100 ms 104052 KB Output is correct
13 Correct 100 ms 103928 KB Output is correct
14 Correct 111 ms 103968 KB Output is correct
15 Correct 108 ms 103988 KB Output is correct
16 Correct 107 ms 104048 KB Output is correct
17 Correct 105 ms 104076 KB Output is correct
18 Correct 100 ms 104048 KB Output is correct
19 Correct 104 ms 104100 KB Output is correct
20 Correct 104 ms 104068 KB Output is correct
21 Correct 98 ms 103836 KB Output is correct
22 Correct 102 ms 103984 KB Output is correct
23 Correct 100 ms 104048 KB Output is correct
24 Correct 104 ms 104056 KB Output is correct
25 Correct 104 ms 104088 KB Output is correct
26 Correct 103 ms 104028 KB Output is correct
27 Correct 102 ms 103844 KB Output is correct
28 Correct 101 ms 103904 KB Output is correct
29 Correct 102 ms 104056 KB Output is correct
30 Correct 99 ms 103800 KB Output is correct
31 Correct 1357 ms 192420 KB Output is correct
32 Correct 240 ms 109604 KB Output is correct
33 Correct 1332 ms 190032 KB Output is correct
34 Correct 1405 ms 189212 KB Output is correct
35 Correct 1545 ms 193192 KB Output is correct
36 Correct 1407 ms 192048 KB Output is correct
37 Correct 965 ms 181940 KB Output is correct
38 Correct 939 ms 179020 KB Output is correct
39 Correct 726 ms 166432 KB Output is correct
40 Correct 753 ms 168968 KB Output is correct
41 Correct 928 ms 160604 KB Output is correct
42 Correct 1020 ms 161504 KB Output is correct
43 Correct 198 ms 111428 KB Output is correct
44 Correct 898 ms 159644 KB Output is correct
45 Correct 849 ms 155028 KB Output is correct
46 Correct 758 ms 146560 KB Output is correct
47 Correct 503 ms 140728 KB Output is correct
48 Correct 494 ms 140256 KB Output is correct
49 Correct 596 ms 147936 KB Output is correct
50 Correct 689 ms 155480 KB Output is correct
51 Correct 604 ms 146124 KB Output is correct
52 Correct 560 ms 141892 KB Output is correct
53 Correct 516 ms 139840 KB Output is correct
54 Correct 922 ms 165088 KB Output is correct
55 Correct 766 ms 158432 KB Output is correct
56 Correct 698 ms 155252 KB Output is correct
57 Correct 886 ms 159672 KB Output is correct
58 Correct 803 ms 156896 KB Output is correct
59 Correct 716 ms 153448 KB Output is correct
60 Correct 850 ms 160032 KB Output is correct
61 Correct 193 ms 111968 KB Output is correct
62 Correct 560 ms 144252 KB Output is correct
63 Correct 803 ms 157664 KB Output is correct
64 Correct 903 ms 163252 KB Output is correct
65 Correct 959 ms 169436 KB Output is correct
66 Correct 971 ms 164264 KB Output is correct
67 Correct 234 ms 109408 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 103736 KB Output is correct
2 Correct 99 ms 103624 KB Output is correct
3 Correct 102 ms 103732 KB Output is correct
4 Correct 106 ms 103732 KB Output is correct
5 Correct 101 ms 103812 KB Output is correct
6 Correct 104 ms 104096 KB Output is correct
7 Correct 100 ms 103844 KB Output is correct
8 Correct 101 ms 104060 KB Output is correct
9 Correct 108 ms 103976 KB Output is correct
10 Correct 104 ms 104172 KB Output is correct
11 Correct 102 ms 103976 KB Output is correct
12 Correct 100 ms 104052 KB Output is correct
13 Correct 100 ms 103928 KB Output is correct
14 Correct 111 ms 103968 KB Output is correct
15 Correct 108 ms 103988 KB Output is correct
16 Correct 107 ms 104048 KB Output is correct
17 Correct 105 ms 104076 KB Output is correct
18 Correct 100 ms 104048 KB Output is correct
19 Correct 104 ms 104100 KB Output is correct
20 Correct 104 ms 104068 KB Output is correct
21 Correct 98 ms 103836 KB Output is correct
22 Correct 102 ms 103984 KB Output is correct
23 Correct 100 ms 104048 KB Output is correct
24 Correct 104 ms 104056 KB Output is correct
25 Correct 104 ms 104088 KB Output is correct
26 Correct 103 ms 104028 KB Output is correct
27 Correct 102 ms 103844 KB Output is correct
28 Correct 101 ms 103904 KB Output is correct
29 Correct 102 ms 104056 KB Output is correct
30 Correct 99 ms 103800 KB Output is correct
31 Correct 1357 ms 192420 KB Output is correct
32 Correct 240 ms 109604 KB Output is correct
33 Correct 1332 ms 190032 KB Output is correct
34 Correct 1405 ms 189212 KB Output is correct
35 Correct 1545 ms 193192 KB Output is correct
36 Correct 1407 ms 192048 KB Output is correct
37 Correct 965 ms 181940 KB Output is correct
38 Correct 939 ms 179020 KB Output is correct
39 Correct 726 ms 166432 KB Output is correct
40 Correct 753 ms 168968 KB Output is correct
41 Correct 928 ms 160604 KB Output is correct
42 Correct 1020 ms 161504 KB Output is correct
43 Correct 198 ms 111428 KB Output is correct
44 Correct 898 ms 159644 KB Output is correct
45 Correct 849 ms 155028 KB Output is correct
46 Correct 758 ms 146560 KB Output is correct
47 Correct 503 ms 140728 KB Output is correct
48 Correct 494 ms 140256 KB Output is correct
49 Correct 596 ms 147936 KB Output is correct
50 Correct 689 ms 155480 KB Output is correct
51 Correct 604 ms 146124 KB Output is correct
52 Correct 3427 ms 268708 KB Output is correct
53 Correct 4724 ms 308596 KB Output is correct
54 Correct 2064 ms 228072 KB Output is correct
55 Correct 3206 ms 264864 KB Output is correct
56 Correct 3650 ms 280144 KB Output is correct
57 Correct 4309 ms 300144 KB Output is correct
58 Correct 1727 ms 225832 KB Output is correct
59 Correct 2690 ms 260464 KB Output is correct
60 Correct 3509 ms 291484 KB Output is correct
61 Correct 3853 ms 322732 KB Output is correct
62 Correct 2493 ms 313340 KB Output is correct
63 Correct 3293 ms 317660 KB Output is correct
64 Execution timed out 5128 ms 419064 KB Time limit exceeded
65 Halted 0 ms 0 KB -