oj.uz

답안 #161048

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161048 2019-10-31T10:37:28 Z Minnakhmetov 새 집 (APIO18_new_home) C++14
80 / 100
 5000 ms 346120 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)
        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);
    }
}
 
bool dummy(int y) {
    return abs(y) == INF || abs(INF - y) == INF;
}
 
void startSeg(int x, pair<int, int> y) {
    if (dummy(y.first) && dummy(y.second))
        return;
    auto &p = mp[x][y];
    if (p.first == 0)
        p.second = cq;
    p.first++;
}
 
void endSeg(int x, pair<int, int> y) {
    if (dummy(y.first) && dummy(y.second))
        return;
    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)
        return;

    int m1 = lower_bound(all(vx), (x + y + 1) >> 1) - 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]);
    }    
 
    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 - 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) {
            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 calcAns(int, int, int)':
new_home.cpp:102: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:121: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 56 ms 56696 KB Output is correct
2 Correct 57 ms 56828 KB Output is correct
3 Correct 96 ms 56696 KB Output is correct
4 Correct 54 ms 56696 KB Output is correct
5 Correct 57 ms 56824 KB Output is correct
6 Correct 55 ms 56952 KB Output is correct
7 Correct 58 ms 57024 KB Output is correct
8 Correct 55 ms 57080 KB Output is correct
9 Correct 56 ms 57084 KB Output is correct
10 Correct 57 ms 57052 KB Output is correct
11 Correct 84 ms 56940 KB Output is correct
12 Correct 55 ms 56952 KB Output is correct
13 Correct 57 ms 56924 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 56 ms 56952 KB Output is correct
16 Correct 55 ms 56952 KB Output is correct
17 Correct 56 ms 56952 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 59 ms 56952 KB Output is correct
20 Correct 56 ms 56952 KB Output is correct
21 Correct 54 ms 56824 KB Output is correct
22 Correct 55 ms 57080 KB Output is correct
23 Correct 59 ms 57124 KB Output is correct
24 Correct 55 ms 56952 KB Output is correct
25 Correct 56 ms 57124 KB Output is correct
26 Correct 55 ms 56952 KB Output is correct
27 Correct 55 ms 56952 KB Output is correct
28 Correct 55 ms 56956 KB Output is correct
29 Correct 57 ms 56952 KB Output is correct
30 Correct 55 ms 56892 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 56696 KB Output is correct
2 Correct 57 ms 56828 KB Output is correct
3 Correct 96 ms 56696 KB Output is correct
4 Correct 54 ms 56696 KB Output is correct
5 Correct 57 ms 56824 KB Output is correct
6 Correct 55 ms 56952 KB Output is correct
7 Correct 58 ms 57024 KB Output is correct
8 Correct 55 ms 57080 KB Output is correct
9 Correct 56 ms 57084 KB Output is correct
10 Correct 57 ms 57052 KB Output is correct
11 Correct 84 ms 56940 KB Output is correct
12 Correct 55 ms 56952 KB Output is correct
13 Correct 57 ms 56924 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 56 ms 56952 KB Output is correct
16 Correct 55 ms 56952 KB Output is correct
17 Correct 56 ms 56952 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 59 ms 56952 KB Output is correct
20 Correct 56 ms 56952 KB Output is correct
21 Correct 54 ms 56824 KB Output is correct
22 Correct 55 ms 57080 KB Output is correct
23 Correct 59 ms 57124 KB Output is correct
24 Correct 55 ms 56952 KB Output is correct
25 Correct 56 ms 57124 KB Output is correct
26 Correct 55 ms 56952 KB Output is correct
27 Correct 55 ms 56952 KB Output is correct
28 Correct 55 ms 56956 KB Output is correct
29 Correct 57 ms 56952 KB Output is correct
30 Correct 55 ms 56892 KB Output is correct
31 Correct 755 ms 115092 KB Output is correct
32 Correct 174 ms 63468 KB Output is correct
33 Correct 737 ms 111560 KB Output is correct
34 Correct 715 ms 111992 KB Output is correct
35 Correct 741 ms 115164 KB Output is correct
36 Correct 745 ms 113564 KB Output is correct
37 Correct 523 ms 102868 KB Output is correct
38 Correct 517 ms 102496 KB Output is correct
39 Correct 440 ms 92756 KB Output is correct
40 Correct 439 ms 95064 KB Output is correct
41 Correct 612 ms 100628 KB Output is correct
42 Correct 637 ms 101272 KB Output is correct
43 Correct 154 ms 64480 KB Output is correct
44 Correct 619 ms 99748 KB Output is correct
45 Correct 570 ms 94512 KB Output is correct
46 Correct 484 ms 85460 KB Output is correct
47 Correct 333 ms 83360 KB Output is correct
48 Correct 311 ms 81748 KB Output is correct
49 Correct 376 ms 88016 KB Output is correct
50 Correct 471 ms 97432 KB Output is correct
51 Correct 384 ms 85588 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2720 ms 171428 KB Output is correct
2 Correct 2587 ms 170664 KB Output is correct
3 Correct 2383 ms 191792 KB Output is correct
4 Correct 2633 ms 174412 KB Output is correct
5 Correct 2401 ms 167312 KB Output is correct
6 Correct 2598 ms 170264 KB Output is correct
7 Correct 2114 ms 191888 KB Output is correct
8 Correct 2195 ms 174796 KB Output is correct
9 Correct 2130 ms 172176 KB Output is correct
10 Correct 2144 ms 174292 KB Output is correct
11 Correct 1387 ms 171660 KB Output is correct
12 Correct 1584 ms 173024 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4191 ms 278192 KB Output is correct
2 Correct 729 ms 93012 KB Output is correct
3 Correct 3954 ms 277764 KB Output is correct
4 Correct 2931 ms 256128 KB Output is correct
5 Correct 3945 ms 272740 KB Output is correct
6 Correct 3744 ms 268820 KB Output is correct
7 Correct 3689 ms 276804 KB Output is correct
8 Correct 4094 ms 277516 KB Output is correct
9 Correct 2656 ms 255424 KB Output is correct
10 Correct 3472 ms 265432 KB Output is correct
11 Correct 3825 ms 276860 KB Output is correct
12 Correct 3960 ms 277220 KB Output is correct
13 Correct 1784 ms 226040 KB Output is correct
14 Correct 1755 ms 223524 KB Output is correct
15 Correct 2084 ms 241580 KB Output is correct
16 Correct 2395 ms 255124 KB Output is correct
17 Correct 2263 ms 249124 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 56696 KB Output is correct
2 Correct 57 ms 56828 KB Output is correct
3 Correct 96 ms 56696 KB Output is correct
4 Correct 54 ms 56696 KB Output is correct
5 Correct 57 ms 56824 KB Output is correct
6 Correct 55 ms 56952 KB Output is correct
7 Correct 58 ms 57024 KB Output is correct
8 Correct 55 ms 57080 KB Output is correct
9 Correct 56 ms 57084 KB Output is correct
10 Correct 57 ms 57052 KB Output is correct
11 Correct 84 ms 56940 KB Output is correct
12 Correct 55 ms 56952 KB Output is correct
13 Correct 57 ms 56924 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 56 ms 56952 KB Output is correct
16 Correct 55 ms 56952 KB Output is correct
17 Correct 56 ms 56952 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 59 ms 56952 KB Output is correct
20 Correct 56 ms 56952 KB Output is correct
21 Correct 54 ms 56824 KB Output is correct
22 Correct 55 ms 57080 KB Output is correct
23 Correct 59 ms 57124 KB Output is correct
24 Correct 55 ms 56952 KB Output is correct
25 Correct 56 ms 57124 KB Output is correct
26 Correct 55 ms 56952 KB Output is correct
27 Correct 55 ms 56952 KB Output is correct
28 Correct 55 ms 56956 KB Output is correct
29 Correct 57 ms 56952 KB Output is correct
30 Correct 55 ms 56892 KB Output is correct
31 Correct 755 ms 115092 KB Output is correct
32 Correct 174 ms 63468 KB Output is correct
33 Correct 737 ms 111560 KB Output is correct
34 Correct 715 ms 111992 KB Output is correct
35 Correct 741 ms 115164 KB Output is correct
36 Correct 745 ms 113564 KB Output is correct
37 Correct 523 ms 102868 KB Output is correct
38 Correct 517 ms 102496 KB Output is correct
39 Correct 440 ms 92756 KB Output is correct
40 Correct 439 ms 95064 KB Output is correct
41 Correct 612 ms 100628 KB Output is correct
42 Correct 637 ms 101272 KB Output is correct
43 Correct 154 ms 64480 KB Output is correct
44 Correct 619 ms 99748 KB Output is correct
45 Correct 570 ms 94512 KB Output is correct
46 Correct 484 ms 85460 KB Output is correct
47 Correct 333 ms 83360 KB Output is correct
48 Correct 311 ms 81748 KB Output is correct
49 Correct 376 ms 88016 KB Output is correct
50 Correct 471 ms 97432 KB Output is correct
51 Correct 384 ms 85588 KB Output is correct
52 Correct 576 ms 106476 KB Output is correct
53 Correct 557 ms 102352 KB Output is correct
54 Correct 700 ms 111272 KB Output is correct
55 Correct 587 ms 107220 KB Output is correct
56 Correct 591 ms 108608 KB Output is correct
57 Correct 643 ms 102612 KB Output is correct
58 Correct 660 ms 104208 KB Output is correct
59 Correct 646 ms 106068 KB Output is correct
60 Correct 632 ms 102228 KB Output is correct
61 Correct 157 ms 69984 KB Output is correct
62 Correct 578 ms 109152 KB Output is correct
63 Correct 720 ms 111436 KB Output is correct
64 Correct 732 ms 112600 KB Output is correct
65 Correct 763 ms 111072 KB Output is correct
66 Correct 622 ms 104148 KB Output is correct
67 Correct 191 ms 62688 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 56696 KB Output is correct
2 Correct 57 ms 56828 KB Output is correct
3 Correct 96 ms 56696 KB Output is correct
4 Correct 54 ms 56696 KB Output is correct
5 Correct 57 ms 56824 KB Output is correct
6 Correct 55 ms 56952 KB Output is correct
7 Correct 58 ms 57024 KB Output is correct
8 Correct 55 ms 57080 KB Output is correct
9 Correct 56 ms 57084 KB Output is correct
10 Correct 57 ms 57052 KB Output is correct
11 Correct 84 ms 56940 KB Output is correct
12 Correct 55 ms 56952 KB Output is correct
13 Correct 57 ms 56924 KB Output is correct
14 Correct 55 ms 56952 KB Output is correct
15 Correct 56 ms 56952 KB Output is correct
16 Correct 55 ms 56952 KB Output is correct
17 Correct 56 ms 56952 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 59 ms 56952 KB Output is correct
20 Correct 56 ms 56952 KB Output is correct
21 Correct 54 ms 56824 KB Output is correct
22 Correct 55 ms 57080 KB Output is correct
23 Correct 59 ms 57124 KB Output is correct
24 Correct 55 ms 56952 KB Output is correct
25 Correct 56 ms 57124 KB Output is correct
26 Correct 55 ms 56952 KB Output is correct
27 Correct 55 ms 56952 KB Output is correct
28 Correct 55 ms 56956 KB Output is correct
29 Correct 57 ms 56952 KB Output is correct
30 Correct 55 ms 56892 KB Output is correct
31 Correct 755 ms 115092 KB Output is correct
32 Correct 174 ms 63468 KB Output is correct
33 Correct 737 ms 111560 KB Output is correct
34 Correct 715 ms 111992 KB Output is correct
35 Correct 741 ms 115164 KB Output is correct
36 Correct 745 ms 113564 KB Output is correct
37 Correct 523 ms 102868 KB Output is correct
38 Correct 517 ms 102496 KB Output is correct
39 Correct 440 ms 92756 KB Output is correct
40 Correct 439 ms 95064 KB Output is correct
41 Correct 612 ms 100628 KB Output is correct
42 Correct 637 ms 101272 KB Output is correct
43 Correct 154 ms 64480 KB Output is correct
44 Correct 619 ms 99748 KB Output is correct
45 Correct 570 ms 94512 KB Output is correct
46 Correct 484 ms 85460 KB Output is correct
47 Correct 333 ms 83360 KB Output is correct
48 Correct 311 ms 81748 KB Output is correct
49 Correct 376 ms 88016 KB Output is correct
50 Correct 471 ms 97432 KB Output is correct
51 Correct 384 ms 85588 KB Output is correct
52 Correct 2720 ms 171428 KB Output is correct
53 Correct 2587 ms 170664 KB Output is correct
54 Correct 2383 ms 191792 KB Output is correct
55 Correct 2633 ms 174412 KB Output is correct
56 Correct 2401 ms 167312 KB Output is correct
57 Correct 2598 ms 170264 KB Output is correct
58 Correct 2114 ms 191888 KB Output is correct
59 Correct 2195 ms 174796 KB Output is correct
60 Correct 2130 ms 172176 KB Output is correct
61 Correct 2144 ms 174292 KB Output is correct
62 Correct 1387 ms 171660 KB Output is correct
63 Correct 1584 ms 173024 KB Output is correct
64 Correct 4191 ms 278192 KB Output is correct
65 Correct 729 ms 93012 KB Output is correct
66 Correct 3954 ms 277764 KB Output is correct
67 Correct 2931 ms 256128 KB Output is correct
68 Correct 3945 ms 272740 KB Output is correct
69 Correct 3744 ms 268820 KB Output is correct
70 Correct 3689 ms 276804 KB Output is correct
71 Correct 4094 ms 277516 KB Output is correct
72 Correct 2656 ms 255424 KB Output is correct
73 Correct 3472 ms 265432 KB Output is correct
74 Correct 3825 ms 276860 KB Output is correct
75 Correct 3960 ms 277220 KB Output is correct
76 Correct 1784 ms 226040 KB Output is correct
77 Correct 1755 ms 223524 KB Output is correct
78 Correct 2084 ms 241580 KB Output is correct
79 Correct 2395 ms 255124 KB Output is correct
80 Correct 2263 ms 249124 KB Output is correct
81 Correct 576 ms 106476 KB Output is correct
82 Correct 557 ms 102352 KB Output is correct
83 Correct 700 ms 111272 KB Output is correct
84 Correct 587 ms 107220 KB Output is correct
85 Correct 591 ms 108608 KB Output is correct
86 Correct 643 ms 102612 KB Output is correct
87 Correct 660 ms 104208 KB Output is correct
88 Correct 646 ms 106068 KB Output is correct
89 Correct 632 ms 102228 KB Output is correct
90 Correct 157 ms 69984 KB Output is correct
91 Correct 578 ms 109152 KB Output is correct
92 Correct 720 ms 111436 KB Output is correct
93 Correct 732 ms 112600 KB Output is correct
94 Correct 763 ms 111072 KB Output is correct
95 Correct 622 ms 104148 KB Output is correct
96 Correct 191 ms 62688 KB Output is correct
97 Correct 3543 ms 338496 KB Output is correct
98 Correct 747 ms 85696 KB Output is correct
99 Execution timed out 5031 ms 346120 KB Time limit exceeded
100 Halted 0 ms 0 KB -