oj.uz

답안 #161052

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161052 2019-10-31T10:46:11 Z Minnakhmetov 새 집 (APIO18_new_home) C++14
80 / 100
 5000 ms 348840 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);
    }
}

void startSeg(int x, pair<int, int> y) {
    auto &p = mp[x][y];
    if (p.first == 0)
        p.second = cq;
    p.first++;
}
 
void endSeg(int x, pair<int, int> y) {
    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 || x == -INF && y == INF)
        return;

    int m1 = lower_bound(all(vx), (x + y + 1) >> 1) - vx.begin();
 
    if (add)
        startSeg(m1, {y, -x});
    else
        endSeg(m1, {y, -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 + 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) {
        // 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 updBetween(int, int, bool)':
new_home.cpp:60: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:94: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:113: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 53 ms 56668 KB Output is correct
2 Correct 52 ms 56720 KB Output is correct
3 Correct 53 ms 56716 KB Output is correct
4 Correct 52 ms 56696 KB Output is correct
5 Correct 53 ms 56824 KB Output is correct
6 Correct 54 ms 56952 KB Output is correct
7 Correct 53 ms 56924 KB Output is correct
8 Correct 55 ms 57052 KB Output is correct
9 Correct 55 ms 57048 KB Output is correct
10 Correct 55 ms 56924 KB Output is correct
11 Correct 58 ms 56848 KB Output is correct
12 Correct 54 ms 56992 KB Output is correct
13 Correct 54 ms 56856 KB Output is correct
14 Correct 55 ms 56796 KB Output is correct
15 Correct 59 ms 56952 KB Output is correct
16 Correct 55 ms 57080 KB Output is correct
17 Correct 55 ms 56992 KB Output is correct
18 Correct 53 ms 56952 KB Output is correct
19 Correct 53 ms 56952 KB Output is correct
20 Correct 54 ms 56956 KB Output is correct
21 Correct 53 ms 56904 KB Output is correct
22 Correct 54 ms 56952 KB Output is correct
23 Correct 57 ms 57076 KB Output is correct
24 Correct 55 ms 56968 KB Output is correct
25 Correct 106 ms 57032 KB Output is correct
26 Correct 53 ms 56952 KB Output is correct
27 Correct 53 ms 56824 KB Output is correct
28 Correct 58 ms 56952 KB Output is correct
29 Correct 53 ms 56824 KB Output is correct
30 Correct 52 ms 56824 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 56668 KB Output is correct
2 Correct 52 ms 56720 KB Output is correct
3 Correct 53 ms 56716 KB Output is correct
4 Correct 52 ms 56696 KB Output is correct
5 Correct 53 ms 56824 KB Output is correct
6 Correct 54 ms 56952 KB Output is correct
7 Correct 53 ms 56924 KB Output is correct
8 Correct 55 ms 57052 KB Output is correct
9 Correct 55 ms 57048 KB Output is correct
10 Correct 55 ms 56924 KB Output is correct
11 Correct 58 ms 56848 KB Output is correct
12 Correct 54 ms 56992 KB Output is correct
13 Correct 54 ms 56856 KB Output is correct
14 Correct 55 ms 56796 KB Output is correct
15 Correct 59 ms 56952 KB Output is correct
16 Correct 55 ms 57080 KB Output is correct
17 Correct 55 ms 56992 KB Output is correct
18 Correct 53 ms 56952 KB Output is correct
19 Correct 53 ms 56952 KB Output is correct
20 Correct 54 ms 56956 KB Output is correct
21 Correct 53 ms 56904 KB Output is correct
22 Correct 54 ms 56952 KB Output is correct
23 Correct 57 ms 57076 KB Output is correct
24 Correct 55 ms 56968 KB Output is correct
25 Correct 106 ms 57032 KB Output is correct
26 Correct 53 ms 56952 KB Output is correct
27 Correct 53 ms 56824 KB Output is correct
28 Correct 58 ms 56952 KB Output is correct
29 Correct 53 ms 56824 KB Output is correct
30 Correct 52 ms 56824 KB Output is correct
31 Correct 754 ms 113052 KB Output is correct
32 Correct 169 ms 62432 KB Output is correct
33 Correct 701 ms 109320 KB Output is correct
34 Correct 747 ms 109580 KB Output is correct
35 Correct 819 ms 112836 KB Output is correct
36 Correct 774 ms 112816 KB Output is correct
37 Correct 541 ms 102708 KB Output is correct
38 Correct 525 ms 102328 KB Output is correct
39 Correct 409 ms 92776 KB Output is correct
40 Correct 449 ms 95064 KB Output is correct
41 Correct 627 ms 100564 KB Output is correct
42 Correct 615 ms 101076 KB Output is correct
43 Correct 146 ms 64372 KB Output is correct
44 Correct 608 ms 99884 KB Output is correct
45 Correct 596 ms 94436 KB Output is correct
46 Correct 473 ms 85428 KB Output is correct
47 Correct 318 ms 83284 KB Output is correct
48 Correct 316 ms 81712 KB Output is correct
49 Correct 383 ms 87888 KB Output is correct
50 Correct 469 ms 97396 KB Output is correct
51 Correct 380 ms 85616 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2679 ms 171432 KB Output is correct
2 Correct 2541 ms 170664 KB Output is correct
3 Correct 2276 ms 191848 KB Output is correct
4 Correct 2636 ms 174276 KB Output is correct
5 Correct 2386 ms 167128 KB Output is correct
6 Correct 2562 ms 170092 KB Output is correct
7 Correct 2079 ms 191800 KB Output is correct
8 Correct 2314 ms 174724 KB Output is correct
9 Correct 2127 ms 172008 KB Output is correct
10 Correct 2160 ms 174964 KB Output is correct
11 Correct 1544 ms 172064 KB Output is correct
12 Correct 1522 ms 173552 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4067 ms 278728 KB Output is correct
2 Correct 720 ms 93928 KB Output is correct
3 Correct 3852 ms 279448 KB Output is correct
4 Correct 2852 ms 258376 KB Output is correct
5 Correct 3997 ms 274960 KB Output is correct
6 Correct 3837 ms 271104 KB Output is correct
7 Correct 3634 ms 279492 KB Output is correct
8 Correct 4210 ms 280848 KB Output is correct
9 Correct 2787 ms 258904 KB Output is correct
10 Correct 3448 ms 268740 KB Output is correct
11 Correct 3957 ms 280160 KB Output is correct
12 Correct 3786 ms 280756 KB Output is correct
13 Correct 1809 ms 230396 KB Output is correct
14 Correct 1827 ms 228060 KB Output is correct
15 Correct 2062 ms 245684 KB Output is correct
16 Correct 2333 ms 259052 KB Output is correct
17 Correct 2228 ms 252408 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 56668 KB Output is correct
2 Correct 52 ms 56720 KB Output is correct
3 Correct 53 ms 56716 KB Output is correct
4 Correct 52 ms 56696 KB Output is correct
5 Correct 53 ms 56824 KB Output is correct
6 Correct 54 ms 56952 KB Output is correct
7 Correct 53 ms 56924 KB Output is correct
8 Correct 55 ms 57052 KB Output is correct
9 Correct 55 ms 57048 KB Output is correct
10 Correct 55 ms 56924 KB Output is correct
11 Correct 58 ms 56848 KB Output is correct
12 Correct 54 ms 56992 KB Output is correct
13 Correct 54 ms 56856 KB Output is correct
14 Correct 55 ms 56796 KB Output is correct
15 Correct 59 ms 56952 KB Output is correct
16 Correct 55 ms 57080 KB Output is correct
17 Correct 55 ms 56992 KB Output is correct
18 Correct 53 ms 56952 KB Output is correct
19 Correct 53 ms 56952 KB Output is correct
20 Correct 54 ms 56956 KB Output is correct
21 Correct 53 ms 56904 KB Output is correct
22 Correct 54 ms 56952 KB Output is correct
23 Correct 57 ms 57076 KB Output is correct
24 Correct 55 ms 56968 KB Output is correct
25 Correct 106 ms 57032 KB Output is correct
26 Correct 53 ms 56952 KB Output is correct
27 Correct 53 ms 56824 KB Output is correct
28 Correct 58 ms 56952 KB Output is correct
29 Correct 53 ms 56824 KB Output is correct
30 Correct 52 ms 56824 KB Output is correct
31 Correct 754 ms 113052 KB Output is correct
32 Correct 169 ms 62432 KB Output is correct
33 Correct 701 ms 109320 KB Output is correct
34 Correct 747 ms 109580 KB Output is correct
35 Correct 819 ms 112836 KB Output is correct
36 Correct 774 ms 112816 KB Output is correct
37 Correct 541 ms 102708 KB Output is correct
38 Correct 525 ms 102328 KB Output is correct
39 Correct 409 ms 92776 KB Output is correct
40 Correct 449 ms 95064 KB Output is correct
41 Correct 627 ms 100564 KB Output is correct
42 Correct 615 ms 101076 KB Output is correct
43 Correct 146 ms 64372 KB Output is correct
44 Correct 608 ms 99884 KB Output is correct
45 Correct 596 ms 94436 KB Output is correct
46 Correct 473 ms 85428 KB Output is correct
47 Correct 318 ms 83284 KB Output is correct
48 Correct 316 ms 81712 KB Output is correct
49 Correct 383 ms 87888 KB Output is correct
50 Correct 469 ms 97396 KB Output is correct
51 Correct 380 ms 85616 KB Output is correct
52 Correct 585 ms 108612 KB Output is correct
53 Correct 568 ms 104728 KB Output is correct
54 Correct 709 ms 113688 KB Output is correct
55 Correct 601 ms 109532 KB Output is correct
56 Correct 570 ms 111028 KB Output is correct
57 Correct 643 ms 104964 KB Output is correct
58 Correct 713 ms 106856 KB Output is correct
59 Correct 657 ms 108272 KB Output is correct
60 Correct 681 ms 104532 KB Output is correct
61 Correct 171 ms 72376 KB Output is correct
62 Correct 578 ms 111420 KB Output is correct
63 Correct 753 ms 113740 KB Output is correct
64 Correct 755 ms 115028 KB Output is correct
65 Correct 708 ms 113364 KB Output is correct
66 Correct 647 ms 106720 KB Output is correct
67 Correct 328 ms 63968 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 56668 KB Output is correct
2 Correct 52 ms 56720 KB Output is correct
3 Correct 53 ms 56716 KB Output is correct
4 Correct 52 ms 56696 KB Output is correct
5 Correct 53 ms 56824 KB Output is correct
6 Correct 54 ms 56952 KB Output is correct
7 Correct 53 ms 56924 KB Output is correct
8 Correct 55 ms 57052 KB Output is correct
9 Correct 55 ms 57048 KB Output is correct
10 Correct 55 ms 56924 KB Output is correct
11 Correct 58 ms 56848 KB Output is correct
12 Correct 54 ms 56992 KB Output is correct
13 Correct 54 ms 56856 KB Output is correct
14 Correct 55 ms 56796 KB Output is correct
15 Correct 59 ms 56952 KB Output is correct
16 Correct 55 ms 57080 KB Output is correct
17 Correct 55 ms 56992 KB Output is correct
18 Correct 53 ms 56952 KB Output is correct
19 Correct 53 ms 56952 KB Output is correct
20 Correct 54 ms 56956 KB Output is correct
21 Correct 53 ms 56904 KB Output is correct
22 Correct 54 ms 56952 KB Output is correct
23 Correct 57 ms 57076 KB Output is correct
24 Correct 55 ms 56968 KB Output is correct
25 Correct 106 ms 57032 KB Output is correct
26 Correct 53 ms 56952 KB Output is correct
27 Correct 53 ms 56824 KB Output is correct
28 Correct 58 ms 56952 KB Output is correct
29 Correct 53 ms 56824 KB Output is correct
30 Correct 52 ms 56824 KB Output is correct
31 Correct 754 ms 113052 KB Output is correct
32 Correct 169 ms 62432 KB Output is correct
33 Correct 701 ms 109320 KB Output is correct
34 Correct 747 ms 109580 KB Output is correct
35 Correct 819 ms 112836 KB Output is correct
36 Correct 774 ms 112816 KB Output is correct
37 Correct 541 ms 102708 KB Output is correct
38 Correct 525 ms 102328 KB Output is correct
39 Correct 409 ms 92776 KB Output is correct
40 Correct 449 ms 95064 KB Output is correct
41 Correct 627 ms 100564 KB Output is correct
42 Correct 615 ms 101076 KB Output is correct
43 Correct 146 ms 64372 KB Output is correct
44 Correct 608 ms 99884 KB Output is correct
45 Correct 596 ms 94436 KB Output is correct
46 Correct 473 ms 85428 KB Output is correct
47 Correct 318 ms 83284 KB Output is correct
48 Correct 316 ms 81712 KB Output is correct
49 Correct 383 ms 87888 KB Output is correct
50 Correct 469 ms 97396 KB Output is correct
51 Correct 380 ms 85616 KB Output is correct
52 Correct 2679 ms 171432 KB Output is correct
53 Correct 2541 ms 170664 KB Output is correct
54 Correct 2276 ms 191848 KB Output is correct
55 Correct 2636 ms 174276 KB Output is correct
56 Correct 2386 ms 167128 KB Output is correct
57 Correct 2562 ms 170092 KB Output is correct
58 Correct 2079 ms 191800 KB Output is correct
59 Correct 2314 ms 174724 KB Output is correct
60 Correct 2127 ms 172008 KB Output is correct
61 Correct 2160 ms 174964 KB Output is correct
62 Correct 1544 ms 172064 KB Output is correct
63 Correct 1522 ms 173552 KB Output is correct
64 Correct 4067 ms 278728 KB Output is correct
65 Correct 720 ms 93928 KB Output is correct
66 Correct 3852 ms 279448 KB Output is correct
67 Correct 2852 ms 258376 KB Output is correct
68 Correct 3997 ms 274960 KB Output is correct
69 Correct 3837 ms 271104 KB Output is correct
70 Correct 3634 ms 279492 KB Output is correct
71 Correct 4210 ms 280848 KB Output is correct
72 Correct 2787 ms 258904 KB Output is correct
73 Correct 3448 ms 268740 KB Output is correct
74 Correct 3957 ms 280160 KB Output is correct
75 Correct 3786 ms 280756 KB Output is correct
76 Correct 1809 ms 230396 KB Output is correct
77 Correct 1827 ms 228060 KB Output is correct
78 Correct 2062 ms 245684 KB Output is correct
79 Correct 2333 ms 259052 KB Output is correct
80 Correct 2228 ms 252408 KB Output is correct
81 Correct 585 ms 108612 KB Output is correct
82 Correct 568 ms 104728 KB Output is correct
83 Correct 709 ms 113688 KB Output is correct
84 Correct 601 ms 109532 KB Output is correct
85 Correct 570 ms 111028 KB Output is correct
86 Correct 643 ms 104964 KB Output is correct
87 Correct 713 ms 106856 KB Output is correct
88 Correct 657 ms 108272 KB Output is correct
89 Correct 681 ms 104532 KB Output is correct
90 Correct 171 ms 72376 KB Output is correct
91 Correct 578 ms 111420 KB Output is correct
92 Correct 753 ms 113740 KB Output is correct
93 Correct 755 ms 115028 KB Output is correct
94 Correct 708 ms 113364 KB Output is correct
95 Correct 647 ms 106720 KB Output is correct
96 Correct 328 ms 63968 KB Output is correct
97 Correct 3672 ms 343360 KB Output is correct
98 Correct 740 ms 87244 KB Output is correct
99 Execution timed out 5041 ms 348840 KB Time limit exceeded
100 Halted 0 ms 0 KB -