oj.uz

답안 #160957

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
160957 2019-10-30T19:47:39 Z Minnakhmetov 새 집 (APIO18_new_home) C++14
47 / 100
 5000 ms 288116 KB 
#include <bits/stdc++.h>
    
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
 
#pragma GCC optimize("Ofast")
  
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, cc, cq;
int ans[N];
pair<int, int> lt[N];
unordered_map<int, vector<int>> mp[N];
 
vector<int> vx;
multiset<int> occ[N];
vector<pair<int, int>> t[N * 4], t2[N * 4];
vector<U> updates;
 
void upd(int l, int r, 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, int y) {
    mp[x][y].push_back(cq);
}
 
void endSeg(int x, int y) {
    updates.push_back({mp[x][y].back(), cq - 1, {x, y}});
    mp[x][y].pop_back();
}
 
void updBeg(int x, bool add) {
    if (add)
        startSeg(0, x);
    else
        endSeg(0, x);
}
 
void updBetween(int x, int y, bool add) {
    if (x == y)
        return;
    int m = (x + y) / 2;
    if ((x + y) % 2)
        m++;
 
    int m1 = lower_bound(all(vx), m) - vx.begin();
    if (add)
        startSeg(m1, y);
    else
        endSeg(m1, y);  
}
 
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);
        sort(lt + L, lt + R + 1);
    }
 
    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);
            i++;
        }
        ans[lt[j].second] = max(ans[lt[j].second], mx - vx[lt[j].first]);
    }
}
 
void solve(vector<E> evs) {
    vx.clear();
    updates.clear();
 
 
    for (int i = 0; i < N; i++) {
        occ[i].clear();
        mp[i].clear();
    }
 
    for (int i = 0; i < N * 4; i++) {
        t[i].clear();
        t2[i].clear();
    }
 
    for (E e : evs) {
        if (e.t == 2)
            vx.push_back(e.x);
    }
 
    sort(all(vx));
    vx.erase(unique(all(vx)), vx.end());
 
    cq = 0;
 
    for (E e : evs) {
        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);
                }
            }
 
            it = occ[e.y].insert(e.x);
 
            if (it == occ[e.y].begin()) 
                updBeg(*it, true);
            else
                updBetween(*prev(it), *it, true);
 
            if (next(it) != occ[e.y].end())
                updBetween(*it, *next(it), 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);
 
            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);
 
            occ[e.y].erase(it);
        }
        else {
            lt[cq] = {lower_bound(all(vx), e.x) - vx.begin(), e.y};
            cq++;
        }
    }
 
    sort(all(updates), [](const U &a, const U &b) {
        return a.p.first < b.p.first;
    });
 
    for (U u : updates) {
        upd(u.l, u.r, u.p, 1, 0, q - 1);
    }
 
    calcAns(1, 0, q - 1);
}
 
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});
        vx.push_back(x);
    }
 
    for (int i = 0; i < k; i++) {
        evs.push_back({1, 0, INF, i});
        evs.push_back({MAX, 1, INF, i});
    }
 
    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;
    });
 
    solve(evs);
    for (E &e : evs)
        e.x = INF - e.x;
    solve(evs);
 
    for (int i = 0; i < q; i++) {
        if (ans[i] < INF / 2) {
            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:83: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 107 ms 87416 KB Output is correct
2 Correct 111 ms 87392 KB Output is correct
3 Correct 113 ms 87160 KB Output is correct
4 Correct 108 ms 87288 KB Output is correct
5 Correct 110 ms 87416 KB Output is correct
6 Correct 114 ms 87500 KB Output is correct
7 Correct 111 ms 87672 KB Output is correct
8 Correct 112 ms 87516 KB Output is correct
9 Correct 110 ms 87544 KB Output is correct
10 Correct 112 ms 87544 KB Output is correct
11 Correct 110 ms 87544 KB Output is correct
12 Correct 109 ms 87568 KB Output is correct
13 Correct 108 ms 87388 KB Output is correct
14 Correct 116 ms 87416 KB Output is correct
15 Correct 111 ms 87544 KB Output is correct
16 Correct 110 ms 87544 KB Output is correct
17 Correct 114 ms 87416 KB Output is correct
18 Correct 111 ms 87520 KB Output is correct
19 Correct 112 ms 87636 KB Output is correct
20 Correct 108 ms 87416 KB Output is correct
21 Correct 113 ms 87416 KB Output is correct
22 Correct 109 ms 87672 KB Output is correct
23 Correct 112 ms 87544 KB Output is correct
24 Correct 110 ms 87552 KB Output is correct
25 Correct 113 ms 87544 KB Output is correct
26 Correct 109 ms 87416 KB Output is correct
27 Correct 110 ms 87352 KB Output is correct
28 Correct 114 ms 87416 KB Output is correct
29 Correct 109 ms 87416 KB Output is correct
30 Correct 114 ms 87388 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 87416 KB Output is correct
2 Correct 111 ms 87392 KB Output is correct
3 Correct 113 ms 87160 KB Output is correct
4 Correct 108 ms 87288 KB Output is correct
5 Correct 110 ms 87416 KB Output is correct
6 Correct 114 ms 87500 KB Output is correct
7 Correct 111 ms 87672 KB Output is correct
8 Correct 112 ms 87516 KB Output is correct
9 Correct 110 ms 87544 KB Output is correct
10 Correct 112 ms 87544 KB Output is correct
11 Correct 110 ms 87544 KB Output is correct
12 Correct 109 ms 87568 KB Output is correct
13 Correct 108 ms 87388 KB Output is correct
14 Correct 116 ms 87416 KB Output is correct
15 Correct 111 ms 87544 KB Output is correct
16 Correct 110 ms 87544 KB Output is correct
17 Correct 114 ms 87416 KB Output is correct
18 Correct 111 ms 87520 KB Output is correct
19 Correct 112 ms 87636 KB Output is correct
20 Correct 108 ms 87416 KB Output is correct
21 Correct 113 ms 87416 KB Output is correct
22 Correct 109 ms 87672 KB Output is correct
23 Correct 112 ms 87544 KB Output is correct
24 Correct 110 ms 87552 KB Output is correct
25 Correct 113 ms 87544 KB Output is correct
26 Correct 109 ms 87416 KB Output is correct
27 Correct 110 ms 87352 KB Output is correct
28 Correct 114 ms 87416 KB Output is correct
29 Correct 109 ms 87416 KB Output is correct
30 Correct 114 ms 87388 KB Output is correct
31 Correct 1458 ms 138144 KB Output is correct
32 Correct 411 ms 98600 KB Output is correct
33 Correct 1425 ms 136456 KB Output is correct
34 Correct 1395 ms 136520 KB Output is correct
35 Correct 1464 ms 138388 KB Output is correct
36 Correct 1464 ms 137636 KB Output is correct
37 Correct 1051 ms 132544 KB Output is correct
38 Correct 1308 ms 130940 KB Output is correct
39 Correct 785 ms 124860 KB Output is correct
40 Correct 831 ms 125776 KB Output is correct
41 Correct 950 ms 123660 KB Output is correct
42 Correct 933 ms 123792 KB Output is correct
43 Correct 298 ms 99684 KB Output is correct
44 Correct 928 ms 122996 KB Output is correct
45 Correct 882 ms 120404 KB Output is correct
46 Correct 780 ms 116028 KB Output is correct
47 Correct 542 ms 113740 KB Output is correct
48 Correct 527 ms 112768 KB Output is correct
49 Correct 681 ms 116784 KB Output is correct
50 Correct 730 ms 121728 KB Output is correct
51 Correct 636 ms 115652 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4594 ms 213696 KB Output is correct
2 Execution timed out 5033 ms 218160 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 87416 KB Output is correct
2 Correct 111 ms 87392 KB Output is correct
3 Correct 113 ms 87160 KB Output is correct
4 Correct 108 ms 87288 KB Output is correct
5 Correct 110 ms 87416 KB Output is correct
6 Correct 114 ms 87500 KB Output is correct
7 Correct 111 ms 87672 KB Output is correct
8 Correct 112 ms 87516 KB Output is correct
9 Correct 110 ms 87544 KB Output is correct
10 Correct 112 ms 87544 KB Output is correct
11 Correct 110 ms 87544 KB Output is correct
12 Correct 109 ms 87568 KB Output is correct
13 Correct 108 ms 87388 KB Output is correct
14 Correct 116 ms 87416 KB Output is correct
15 Correct 111 ms 87544 KB Output is correct
16 Correct 110 ms 87544 KB Output is correct
17 Correct 114 ms 87416 KB Output is correct
18 Correct 111 ms 87520 KB Output is correct
19 Correct 112 ms 87636 KB Output is correct
20 Correct 108 ms 87416 KB Output is correct
21 Correct 113 ms 87416 KB Output is correct
22 Correct 109 ms 87672 KB Output is correct
23 Correct 112 ms 87544 KB Output is correct
24 Correct 110 ms 87552 KB Output is correct
25 Correct 113 ms 87544 KB Output is correct
26 Correct 109 ms 87416 KB Output is correct
27 Correct 110 ms 87352 KB Output is correct
28 Correct 114 ms 87416 KB Output is correct
29 Correct 109 ms 87416 KB Output is correct
30 Correct 114 ms 87388 KB Output is correct
31 Correct 1458 ms 138144 KB Output is correct
32 Correct 411 ms 98600 KB Output is correct
33 Correct 1425 ms 136456 KB Output is correct
34 Correct 1395 ms 136520 KB Output is correct
35 Correct 1464 ms 138388 KB Output is correct
36 Correct 1464 ms 137636 KB Output is correct
37 Correct 1051 ms 132544 KB Output is correct
38 Correct 1308 ms 130940 KB Output is correct
39 Correct 785 ms 124860 KB Output is correct
40 Correct 831 ms 125776 KB Output is correct
41 Correct 950 ms 123660 KB Output is correct
42 Correct 933 ms 123792 KB Output is correct
43 Correct 298 ms 99684 KB Output is correct
44 Correct 928 ms 122996 KB Output is correct
45 Correct 882 ms 120404 KB Output is correct
46 Correct 780 ms 116028 KB Output is correct
47 Correct 542 ms 113740 KB Output is correct
48 Correct 527 ms 112768 KB Output is correct
49 Correct 681 ms 116784 KB Output is correct
50 Correct 730 ms 121728 KB Output is correct
51 Correct 636 ms 115652 KB Output is correct
52 Correct 890 ms 141632 KB Output is correct
53 Correct 727 ms 127780 KB Output is correct
54 Correct 1084 ms 134980 KB Output is correct
55 Correct 872 ms 132100 KB Output is correct
56 Correct 890 ms 134764 KB Output is correct
57 Correct 888 ms 125932 KB Output is correct
58 Correct 901 ms 130168 KB Output is correct
59 Correct 846 ms 133424 KB Output is correct
60 Correct 916 ms 125516 KB Output is correct
61 Correct 352 ms 110868 KB Output is correct
62 Correct 802 ms 142876 KB Output is correct
63 Correct 982 ms 135956 KB Output is correct
64 Correct 987 ms 134100 KB Output is correct
65 Correct 963 ms 131016 KB Output is correct
66 Correct 958 ms 125480 KB Output is correct
67 Correct 449 ms 106752 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 87416 KB Output is correct
2 Correct 111 ms 87392 KB Output is correct
3 Correct 113 ms 87160 KB Output is correct
4 Correct 108 ms 87288 KB Output is correct
5 Correct 110 ms 87416 KB Output is correct
6 Correct 114 ms 87500 KB Output is correct
7 Correct 111 ms 87672 KB Output is correct
8 Correct 112 ms 87516 KB Output is correct
9 Correct 110 ms 87544 KB Output is correct
10 Correct 112 ms 87544 KB Output is correct
11 Correct 110 ms 87544 KB Output is correct
12 Correct 109 ms 87568 KB Output is correct
13 Correct 108 ms 87388 KB Output is correct
14 Correct 116 ms 87416 KB Output is correct
15 Correct 111 ms 87544 KB Output is correct
16 Correct 110 ms 87544 KB Output is correct
17 Correct 114 ms 87416 KB Output is correct
18 Correct 111 ms 87520 KB Output is correct
19 Correct 112 ms 87636 KB Output is correct
20 Correct 108 ms 87416 KB Output is correct
21 Correct 113 ms 87416 KB Output is correct
22 Correct 109 ms 87672 KB Output is correct
23 Correct 112 ms 87544 KB Output is correct
24 Correct 110 ms 87552 KB Output is correct
25 Correct 113 ms 87544 KB Output is correct
26 Correct 109 ms 87416 KB Output is correct
27 Correct 110 ms 87352 KB Output is correct
28 Correct 114 ms 87416 KB Output is correct
29 Correct 109 ms 87416 KB Output is correct
30 Correct 114 ms 87388 KB Output is correct
31 Correct 1458 ms 138144 KB Output is correct
32 Correct 411 ms 98600 KB Output is correct
33 Correct 1425 ms 136456 KB Output is correct
34 Correct 1395 ms 136520 KB Output is correct
35 Correct 1464 ms 138388 KB Output is correct
36 Correct 1464 ms 137636 KB Output is correct
37 Correct 1051 ms 132544 KB Output is correct
38 Correct 1308 ms 130940 KB Output is correct
39 Correct 785 ms 124860 KB Output is correct
40 Correct 831 ms 125776 KB Output is correct
41 Correct 950 ms 123660 KB Output is correct
42 Correct 933 ms 123792 KB Output is correct
43 Correct 298 ms 99684 KB Output is correct
44 Correct 928 ms 122996 KB Output is correct
45 Correct 882 ms 120404 KB Output is correct
46 Correct 780 ms 116028 KB Output is correct
47 Correct 542 ms 113740 KB Output is correct
48 Correct 527 ms 112768 KB Output is correct
49 Correct 681 ms 116784 KB Output is correct
50 Correct 730 ms 121728 KB Output is correct
51 Correct 636 ms 115652 KB Output is correct
52 Correct 4594 ms 213696 KB Output is correct
53 Execution timed out 5033 ms 218160 KB Time limit exceeded
54 Halted 0 ms 0 KB -