oj.uz

답안 #161043

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161043 2019-10-31T10:13:42 Z Minnakhmetov 새 집 (APIO18_new_home) C++14
80 / 100
 5000 ms 386016 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) {
        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 = L; j <= R; j++) {
        while (i < t[v].size() && t[v][i].first <= lt[j].first) {
            mx = max(mx, t[v][i].second.first);
            i++;
        }
        ans[lt[j].second] = max(ans[lt[j].second], mx - vx[lt[j].first]);
    }    

    i = int(t[v].size()) - 1, mx = -INF;
    for (int j = R; j >= L; j--) {
        while (i >= 0 && t[v][i].first > lt[j].first) {
            mx = max(mx, t[v][i].second.second);
            i--;
        }
        ans[lt[j].second] = max(ans[lt[j].second], mx - INF + vx[lt[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) {

            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: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:86:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (i < t[v].size() && t[v][i].first <= lt[j].first) {
                ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 56696 KB Output is correct
2 Correct 58 ms 56696 KB Output is correct
3 Correct 54 ms 56696 KB Output is correct
4 Correct 52 ms 56696 KB Output is correct
5 Correct 54 ms 56824 KB Output is correct
6 Correct 55 ms 57080 KB Output is correct
7 Correct 55 ms 57052 KB Output is correct
8 Correct 54 ms 56976 KB Output is correct
9 Correct 56 ms 57080 KB Output is correct
10 Correct 56 ms 56860 KB Output is correct
11 Correct 55 ms 56952 KB Output is correct
12 Correct 58 ms 56952 KB Output is correct
13 Correct 55 ms 56824 KB Output is correct
14 Correct 55 ms 56956 KB Output is correct
15 Correct 55 ms 56996 KB Output is correct
16 Correct 55 ms 57052 KB Output is correct
17 Correct 56 ms 57080 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 60 ms 57080 KB Output is correct
20 Correct 60 ms 56952 KB Output is correct
21 Correct 55 ms 56796 KB Output is correct
22 Correct 55 ms 57080 KB Output is correct
23 Correct 56 ms 57080 KB Output is correct
24 Correct 60 ms 57088 KB Output is correct
25 Correct 56 ms 56952 KB Output is correct
26 Correct 56 ms 56952 KB Output is correct
27 Correct 55 ms 56952 KB Output is correct
28 Correct 57 ms 56980 KB Output is correct
29 Correct 63 ms 56980 KB Output is correct
30 Correct 58 ms 56824 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 56696 KB Output is correct
2 Correct 58 ms 56696 KB Output is correct
3 Correct 54 ms 56696 KB Output is correct
4 Correct 52 ms 56696 KB Output is correct
5 Correct 54 ms 56824 KB Output is correct
6 Correct 55 ms 57080 KB Output is correct
7 Correct 55 ms 57052 KB Output is correct
8 Correct 54 ms 56976 KB Output is correct
9 Correct 56 ms 57080 KB Output is correct
10 Correct 56 ms 56860 KB Output is correct
11 Correct 55 ms 56952 KB Output is correct
12 Correct 58 ms 56952 KB Output is correct
13 Correct 55 ms 56824 KB Output is correct
14 Correct 55 ms 56956 KB Output is correct
15 Correct 55 ms 56996 KB Output is correct
16 Correct 55 ms 57052 KB Output is correct
17 Correct 56 ms 57080 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 60 ms 57080 KB Output is correct
20 Correct 60 ms 56952 KB Output is correct
21 Correct 55 ms 56796 KB Output is correct
22 Correct 55 ms 57080 KB Output is correct
23 Correct 56 ms 57080 KB Output is correct
24 Correct 60 ms 57088 KB Output is correct
25 Correct 56 ms 56952 KB Output is correct
26 Correct 56 ms 56952 KB Output is correct
27 Correct 55 ms 56952 KB Output is correct
28 Correct 57 ms 56980 KB Output is correct
29 Correct 63 ms 56980 KB Output is correct
30 Correct 58 ms 56824 KB Output is correct
31 Correct 837 ms 119724 KB Output is correct
32 Correct 173 ms 62432 KB Output is correct
33 Correct 749 ms 116820 KB Output is correct
34 Correct 780 ms 116944 KB Output is correct
35 Correct 824 ms 119764 KB Output is correct
36 Correct 880 ms 119548 KB Output is correct
37 Correct 577 ms 110820 KB Output is correct
38 Correct 564 ms 110536 KB Output is correct
39 Correct 468 ms 100884 KB Output is correct
40 Correct 466 ms 103156 KB Output is correct
41 Correct 708 ms 108940 KB Output is correct
42 Correct 699 ms 109540 KB Output is correct
43 Correct 235 ms 64420 KB Output is correct
44 Correct 666 ms 108344 KB Output is correct
45 Correct 651 ms 102780 KB Output is correct
46 Correct 579 ms 93832 KB Output is correct
47 Correct 356 ms 91068 KB Output is correct
48 Correct 340 ms 89480 KB Output is correct
49 Correct 416 ms 96064 KB Output is correct
50 Correct 521 ms 105616 KB Output is correct
51 Correct 429 ms 93816 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2901 ms 202820 KB Output is correct
2 Correct 3080 ms 201892 KB Output is correct
3 Correct 2553 ms 220028 KB Output is correct
4 Correct 2935 ms 204000 KB Output is correct
5 Correct 2578 ms 197748 KB Output is correct
6 Correct 2848 ms 201296 KB Output is correct
7 Correct 2481 ms 220112 KB Output is correct
8 Correct 2588 ms 206036 KB Output is correct
9 Correct 2558 ms 203204 KB Output is correct
10 Correct 2538 ms 206436 KB Output is correct
11 Correct 1639 ms 202920 KB Output is correct
12 Correct 1720 ms 204868 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4562 ms 310432 KB Output is correct
2 Correct 719 ms 92960 KB Output is correct
3 Correct 4239 ms 310304 KB Output is correct
4 Correct 3034 ms 284396 KB Output is correct
5 Correct 4197 ms 304788 KB Output is correct
6 Correct 4452 ms 300520 KB Output is correct
7 Correct 4102 ms 309864 KB Output is correct
8 Correct 4214 ms 310340 KB Output is correct
9 Correct 2967 ms 283792 KB Output is correct
10 Correct 4000 ms 296380 KB Output is correct
11 Correct 4500 ms 308156 KB Output is correct
12 Correct 4257 ms 309076 KB Output is correct
13 Correct 2109 ms 257116 KB Output is correct
14 Correct 1962 ms 253932 KB Output is correct
15 Correct 2476 ms 272940 KB Output is correct
16 Correct 2806 ms 287232 KB Output is correct
17 Correct 2514 ms 280396 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 56696 KB Output is correct
2 Correct 58 ms 56696 KB Output is correct
3 Correct 54 ms 56696 KB Output is correct
4 Correct 52 ms 56696 KB Output is correct
5 Correct 54 ms 56824 KB Output is correct
6 Correct 55 ms 57080 KB Output is correct
7 Correct 55 ms 57052 KB Output is correct
8 Correct 54 ms 56976 KB Output is correct
9 Correct 56 ms 57080 KB Output is correct
10 Correct 56 ms 56860 KB Output is correct
11 Correct 55 ms 56952 KB Output is correct
12 Correct 58 ms 56952 KB Output is correct
13 Correct 55 ms 56824 KB Output is correct
14 Correct 55 ms 56956 KB Output is correct
15 Correct 55 ms 56996 KB Output is correct
16 Correct 55 ms 57052 KB Output is correct
17 Correct 56 ms 57080 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 60 ms 57080 KB Output is correct
20 Correct 60 ms 56952 KB Output is correct
21 Correct 55 ms 56796 KB Output is correct
22 Correct 55 ms 57080 KB Output is correct
23 Correct 56 ms 57080 KB Output is correct
24 Correct 60 ms 57088 KB Output is correct
25 Correct 56 ms 56952 KB Output is correct
26 Correct 56 ms 56952 KB Output is correct
27 Correct 55 ms 56952 KB Output is correct
28 Correct 57 ms 56980 KB Output is correct
29 Correct 63 ms 56980 KB Output is correct
30 Correct 58 ms 56824 KB Output is correct
31 Correct 837 ms 119724 KB Output is correct
32 Correct 173 ms 62432 KB Output is correct
33 Correct 749 ms 116820 KB Output is correct
34 Correct 780 ms 116944 KB Output is correct
35 Correct 824 ms 119764 KB Output is correct
36 Correct 880 ms 119548 KB Output is correct
37 Correct 577 ms 110820 KB Output is correct
38 Correct 564 ms 110536 KB Output is correct
39 Correct 468 ms 100884 KB Output is correct
40 Correct 466 ms 103156 KB Output is correct
41 Correct 708 ms 108940 KB Output is correct
42 Correct 699 ms 109540 KB Output is correct
43 Correct 235 ms 64420 KB Output is correct
44 Correct 666 ms 108344 KB Output is correct
45 Correct 651 ms 102780 KB Output is correct
46 Correct 579 ms 93832 KB Output is correct
47 Correct 356 ms 91068 KB Output is correct
48 Correct 340 ms 89480 KB Output is correct
49 Correct 416 ms 96064 KB Output is correct
50 Correct 521 ms 105616 KB Output is correct
51 Correct 429 ms 93816 KB Output is correct
52 Correct 640 ms 112248 KB Output is correct
53 Correct 619 ms 107976 KB Output is correct
54 Correct 835 ms 117956 KB Output is correct
55 Correct 681 ms 115040 KB Output is correct
56 Correct 656 ms 116084 KB Output is correct
57 Correct 718 ms 110988 KB Output is correct
58 Correct 754 ms 111880 KB Output is correct
59 Correct 730 ms 113000 KB Output is correct
60 Correct 701 ms 110564 KB Output is correct
61 Correct 159 ms 70940 KB Output is correct
62 Correct 631 ms 115120 KB Output is correct
63 Correct 824 ms 118692 KB Output is correct
64 Correct 830 ms 119792 KB Output is correct
65 Correct 805 ms 119248 KB Output is correct
66 Correct 722 ms 112980 KB Output is correct
67 Correct 186 ms 63328 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 56696 KB Output is correct
2 Correct 58 ms 56696 KB Output is correct
3 Correct 54 ms 56696 KB Output is correct
4 Correct 52 ms 56696 KB Output is correct
5 Correct 54 ms 56824 KB Output is correct
6 Correct 55 ms 57080 KB Output is correct
7 Correct 55 ms 57052 KB Output is correct
8 Correct 54 ms 56976 KB Output is correct
9 Correct 56 ms 57080 KB Output is correct
10 Correct 56 ms 56860 KB Output is correct
11 Correct 55 ms 56952 KB Output is correct
12 Correct 58 ms 56952 KB Output is correct
13 Correct 55 ms 56824 KB Output is correct
14 Correct 55 ms 56956 KB Output is correct
15 Correct 55 ms 56996 KB Output is correct
16 Correct 55 ms 57052 KB Output is correct
17 Correct 56 ms 57080 KB Output is correct
18 Correct 56 ms 57080 KB Output is correct
19 Correct 60 ms 57080 KB Output is correct
20 Correct 60 ms 56952 KB Output is correct
21 Correct 55 ms 56796 KB Output is correct
22 Correct 55 ms 57080 KB Output is correct
23 Correct 56 ms 57080 KB Output is correct
24 Correct 60 ms 57088 KB Output is correct
25 Correct 56 ms 56952 KB Output is correct
26 Correct 56 ms 56952 KB Output is correct
27 Correct 55 ms 56952 KB Output is correct
28 Correct 57 ms 56980 KB Output is correct
29 Correct 63 ms 56980 KB Output is correct
30 Correct 58 ms 56824 KB Output is correct
31 Correct 837 ms 119724 KB Output is correct
32 Correct 173 ms 62432 KB Output is correct
33 Correct 749 ms 116820 KB Output is correct
34 Correct 780 ms 116944 KB Output is correct
35 Correct 824 ms 119764 KB Output is correct
36 Correct 880 ms 119548 KB Output is correct
37 Correct 577 ms 110820 KB Output is correct
38 Correct 564 ms 110536 KB Output is correct
39 Correct 468 ms 100884 KB Output is correct
40 Correct 466 ms 103156 KB Output is correct
41 Correct 708 ms 108940 KB Output is correct
42 Correct 699 ms 109540 KB Output is correct
43 Correct 235 ms 64420 KB Output is correct
44 Correct 666 ms 108344 KB Output is correct
45 Correct 651 ms 102780 KB Output is correct
46 Correct 579 ms 93832 KB Output is correct
47 Correct 356 ms 91068 KB Output is correct
48 Correct 340 ms 89480 KB Output is correct
49 Correct 416 ms 96064 KB Output is correct
50 Correct 521 ms 105616 KB Output is correct
51 Correct 429 ms 93816 KB Output is correct
52 Correct 2901 ms 202820 KB Output is correct
53 Correct 3080 ms 201892 KB Output is correct
54 Correct 2553 ms 220028 KB Output is correct
55 Correct 2935 ms 204000 KB Output is correct
56 Correct 2578 ms 197748 KB Output is correct
57 Correct 2848 ms 201296 KB Output is correct
58 Correct 2481 ms 220112 KB Output is correct
59 Correct 2588 ms 206036 KB Output is correct
60 Correct 2558 ms 203204 KB Output is correct
61 Correct 2538 ms 206436 KB Output is correct
62 Correct 1639 ms 202920 KB Output is correct
63 Correct 1720 ms 204868 KB Output is correct
64 Correct 4562 ms 310432 KB Output is correct
65 Correct 719 ms 92960 KB Output is correct
66 Correct 4239 ms 310304 KB Output is correct
67 Correct 3034 ms 284396 KB Output is correct
68 Correct 4197 ms 304788 KB Output is correct
69 Correct 4452 ms 300520 KB Output is correct
70 Correct 4102 ms 309864 KB Output is correct
71 Correct 4214 ms 310340 KB Output is correct
72 Correct 2967 ms 283792 KB Output is correct
73 Correct 4000 ms 296380 KB Output is correct
74 Correct 4500 ms 308156 KB Output is correct
75 Correct 4257 ms 309076 KB Output is correct
76 Correct 2109 ms 257116 KB Output is correct
77 Correct 1962 ms 253932 KB Output is correct
78 Correct 2476 ms 272940 KB Output is correct
79 Correct 2806 ms 287232 KB Output is correct
80 Correct 2514 ms 280396 KB Output is correct
81 Correct 640 ms 112248 KB Output is correct
82 Correct 619 ms 107976 KB Output is correct
83 Correct 835 ms 117956 KB Output is correct
84 Correct 681 ms 115040 KB Output is correct
85 Correct 656 ms 116084 KB Output is correct
86 Correct 718 ms 110988 KB Output is correct
87 Correct 754 ms 111880 KB Output is correct
88 Correct 730 ms 113000 KB Output is correct
89 Correct 701 ms 110564 KB Output is correct
90 Correct 159 ms 70940 KB Output is correct
91 Correct 631 ms 115120 KB Output is correct
92 Correct 824 ms 118692 KB Output is correct
93 Correct 830 ms 119792 KB Output is correct
94 Correct 805 ms 119248 KB Output is correct
95 Correct 722 ms 112980 KB Output is correct
96 Correct 186 ms 63328 KB Output is correct
97 Correct 4240 ms 367048 KB Output is correct
98 Correct 753 ms 87384 KB Output is correct
99 Execution timed out 5099 ms 386016 KB Time limit exceeded
100 Halted 0 ms 0 KB -