oj.uz

Submission #160956

# Submission time Handle Problem Language Result Execution time Memory
160956 2019-10-30T19:33:50 Z Minnakhmetov New Home (APIO18_new_home) C++14
47 / 100
 5000 ms 364552 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], loc[N], num[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) {
        t2[v] = {{loc[L], num[L]}};
    }
    else {
        int m = (L + R) >> 1;
        calcAns(v * 2, L, m);
        calcAns(v * 2 + 1, m + 1, R);
        merge(all(t2[v * 2]), all(t2[v * 2 + 1]), back_inserter(t2[v]),
            [](const pair<int, int> &a, const pair<int, int> &b) {
                return a.first < b.first;
            });
    }
 
    int i = 0, mx = -INF;
    for (auto &p : t2[v]) {
        while (i < t[v].size() && t[v][i].first <= p.first) {
            mx = max(mx, t[v][i].second);
            i++;
        }
        ans[p.second] = max(ans[p.second], mx - vx[p.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 {
            loc[cq] = lower_bound(all(vx), e.x) - vx.begin();
            num[cq] = 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:88:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (i < t[v].size() && t[v][i].first <= p.first) {
                ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 87288 KB Output is correct
2 Correct 110 ms 87288 KB Output is correct
3 Correct 108 ms 87328 KB Output is correct
4 Correct 108 ms 87320 KB Output is correct
5 Correct 109 ms 87416 KB Output is correct
6 Correct 112 ms 87672 KB Output is correct
7 Correct 146 ms 87588 KB Output is correct
8 Correct 109 ms 87688 KB Output is correct
9 Correct 110 ms 87772 KB Output is correct
10 Correct 112 ms 87620 KB Output is correct
11 Correct 111 ms 87524 KB Output is correct
12 Correct 112 ms 87668 KB Output is correct
13 Correct 112 ms 87488 KB Output is correct
14 Correct 109 ms 87416 KB Output is correct
15 Correct 111 ms 87672 KB Output is correct
16 Correct 112 ms 87544 KB Output is correct
17 Correct 110 ms 87476 KB Output is correct
18 Correct 112 ms 87684 KB Output is correct
19 Correct 111 ms 87644 KB Output is correct
20 Correct 112 ms 87544 KB Output is correct
21 Correct 110 ms 87528 KB Output is correct
22 Correct 113 ms 87720 KB Output is correct
23 Correct 122 ms 87692 KB Output is correct
24 Correct 110 ms 87652 KB Output is correct
25 Correct 112 ms 87672 KB Output is correct
26 Correct 123 ms 87576 KB Output is correct
27 Correct 124 ms 87596 KB Output is correct
28 Correct 110 ms 87416 KB Output is correct
29 Correct 119 ms 87604 KB Output is correct
30 Correct 119 ms 87484 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 87288 KB Output is correct
2 Correct 110 ms 87288 KB Output is correct
3 Correct 108 ms 87328 KB Output is correct
4 Correct 108 ms 87320 KB Output is correct
5 Correct 109 ms 87416 KB Output is correct
6 Correct 112 ms 87672 KB Output is correct
7 Correct 146 ms 87588 KB Output is correct
8 Correct 109 ms 87688 KB Output is correct
9 Correct 110 ms 87772 KB Output is correct
10 Correct 112 ms 87620 KB Output is correct
11 Correct 111 ms 87524 KB Output is correct
12 Correct 112 ms 87668 KB Output is correct
13 Correct 112 ms 87488 KB Output is correct
14 Correct 109 ms 87416 KB Output is correct
15 Correct 111 ms 87672 KB Output is correct
16 Correct 112 ms 87544 KB Output is correct
17 Correct 110 ms 87476 KB Output is correct
18 Correct 112 ms 87684 KB Output is correct
19 Correct 111 ms 87644 KB Output is correct
20 Correct 112 ms 87544 KB Output is correct
21 Correct 110 ms 87528 KB Output is correct
22 Correct 113 ms 87720 KB Output is correct
23 Correct 122 ms 87692 KB Output is correct
24 Correct 110 ms 87652 KB Output is correct
25 Correct 112 ms 87672 KB Output is correct
26 Correct 123 ms 87576 KB Output is correct
27 Correct 124 ms 87596 KB Output is correct
28 Correct 110 ms 87416 KB Output is correct
29 Correct 119 ms 87604 KB Output is correct
30 Correct 119 ms 87484 KB Output is correct
31 Correct 1481 ms 149068 KB Output is correct
32 Correct 405 ms 108000 KB Output is correct
33 Correct 1378 ms 147120 KB Output is correct
34 Correct 1364 ms 147556 KB Output is correct
35 Correct 1417 ms 149144 KB Output is correct
36 Correct 1458 ms 148404 KB Output is correct
37 Correct 1016 ms 143532 KB Output is correct
38 Correct 943 ms 141632 KB Output is correct
39 Correct 839 ms 135656 KB Output is correct
40 Correct 801 ms 136556 KB Output is correct
41 Correct 929 ms 134332 KB Output is correct
42 Correct 899 ms 134648 KB Output is correct
43 Correct 272 ms 109580 KB Output is correct
44 Correct 899 ms 133728 KB Output is correct
45 Correct 819 ms 131420 KB Output is correct
46 Correct 760 ms 126748 KB Output is correct
47 Correct 562 ms 124496 KB Output is correct
48 Correct 555 ms 123512 KB Output is correct
49 Correct 661 ms 127464 KB Output is correct
50 Correct 730 ms 132512 KB Output is correct
51 Correct 635 ms 126380 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4812 ms 287920 KB Output is correct
2 Execution timed out 5119 ms 291320 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5027 ms 364552 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 87288 KB Output is correct
2 Correct 110 ms 87288 KB Output is correct
3 Correct 108 ms 87328 KB Output is correct
4 Correct 108 ms 87320 KB Output is correct
5 Correct 109 ms 87416 KB Output is correct
6 Correct 112 ms 87672 KB Output is correct
7 Correct 146 ms 87588 KB Output is correct
8 Correct 109 ms 87688 KB Output is correct
9 Correct 110 ms 87772 KB Output is correct
10 Correct 112 ms 87620 KB Output is correct
11 Correct 111 ms 87524 KB Output is correct
12 Correct 112 ms 87668 KB Output is correct
13 Correct 112 ms 87488 KB Output is correct
14 Correct 109 ms 87416 KB Output is correct
15 Correct 111 ms 87672 KB Output is correct
16 Correct 112 ms 87544 KB Output is correct
17 Correct 110 ms 87476 KB Output is correct
18 Correct 112 ms 87684 KB Output is correct
19 Correct 111 ms 87644 KB Output is correct
20 Correct 112 ms 87544 KB Output is correct
21 Correct 110 ms 87528 KB Output is correct
22 Correct 113 ms 87720 KB Output is correct
23 Correct 122 ms 87692 KB Output is correct
24 Correct 110 ms 87652 KB Output is correct
25 Correct 112 ms 87672 KB Output is correct
26 Correct 123 ms 87576 KB Output is correct
27 Correct 124 ms 87596 KB Output is correct
28 Correct 110 ms 87416 KB Output is correct
29 Correct 119 ms 87604 KB Output is correct
30 Correct 119 ms 87484 KB Output is correct
31 Correct 1481 ms 149068 KB Output is correct
32 Correct 405 ms 108000 KB Output is correct
33 Correct 1378 ms 147120 KB Output is correct
34 Correct 1364 ms 147556 KB Output is correct
35 Correct 1417 ms 149144 KB Output is correct
36 Correct 1458 ms 148404 KB Output is correct
37 Correct 1016 ms 143532 KB Output is correct
38 Correct 943 ms 141632 KB Output is correct
39 Correct 839 ms 135656 KB Output is correct
40 Correct 801 ms 136556 KB Output is correct
41 Correct 929 ms 134332 KB Output is correct
42 Correct 899 ms 134648 KB Output is correct
43 Correct 272 ms 109580 KB Output is correct
44 Correct 899 ms 133728 KB Output is correct
45 Correct 819 ms 131420 KB Output is correct
46 Correct 760 ms 126748 KB Output is correct
47 Correct 562 ms 124496 KB Output is correct
48 Correct 555 ms 123512 KB Output is correct
49 Correct 661 ms 127464 KB Output is correct
50 Correct 730 ms 132512 KB Output is correct
51 Correct 635 ms 126380 KB Output is correct
52 Correct 857 ms 153012 KB Output is correct
53 Correct 719 ms 138888 KB Output is correct
54 Correct 1144 ms 146056 KB Output is correct
55 Correct 876 ms 142908 KB Output is correct
56 Correct 891 ms 145652 KB Output is correct
57 Correct 950 ms 136696 KB Output is correct
58 Correct 868 ms 140864 KB Output is correct
59 Correct 888 ms 144456 KB Output is correct
60 Correct 940 ms 136384 KB Output is correct
61 Correct 367 ms 118864 KB Output is correct
62 Correct 843 ms 154264 KB Output is correct
63 Correct 959 ms 146988 KB Output is correct
64 Correct 965 ms 145276 KB Output is correct
65 Correct 998 ms 141940 KB Output is correct
66 Correct 928 ms 136296 KB Output is correct
67 Correct 445 ms 117444 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 87288 KB Output is correct
2 Correct 110 ms 87288 KB Output is correct
3 Correct 108 ms 87328 KB Output is correct
4 Correct 108 ms 87320 KB Output is correct
5 Correct 109 ms 87416 KB Output is correct
6 Correct 112 ms 87672 KB Output is correct
7 Correct 146 ms 87588 KB Output is correct
8 Correct 109 ms 87688 KB Output is correct
9 Correct 110 ms 87772 KB Output is correct
10 Correct 112 ms 87620 KB Output is correct
11 Correct 111 ms 87524 KB Output is correct
12 Correct 112 ms 87668 KB Output is correct
13 Correct 112 ms 87488 KB Output is correct
14 Correct 109 ms 87416 KB Output is correct
15 Correct 111 ms 87672 KB Output is correct
16 Correct 112 ms 87544 KB Output is correct
17 Correct 110 ms 87476 KB Output is correct
18 Correct 112 ms 87684 KB Output is correct
19 Correct 111 ms 87644 KB Output is correct
20 Correct 112 ms 87544 KB Output is correct
21 Correct 110 ms 87528 KB Output is correct
22 Correct 113 ms 87720 KB Output is correct
23 Correct 122 ms 87692 KB Output is correct
24 Correct 110 ms 87652 KB Output is correct
25 Correct 112 ms 87672 KB Output is correct
26 Correct 123 ms 87576 KB Output is correct
27 Correct 124 ms 87596 KB Output is correct
28 Correct 110 ms 87416 KB Output is correct
29 Correct 119 ms 87604 KB Output is correct
30 Correct 119 ms 87484 KB Output is correct
31 Correct 1481 ms 149068 KB Output is correct
32 Correct 405 ms 108000 KB Output is correct
33 Correct 1378 ms 147120 KB Output is correct
34 Correct 1364 ms 147556 KB Output is correct
35 Correct 1417 ms 149144 KB Output is correct
36 Correct 1458 ms 148404 KB Output is correct
37 Correct 1016 ms 143532 KB Output is correct
38 Correct 943 ms 141632 KB Output is correct
39 Correct 839 ms 135656 KB Output is correct
40 Correct 801 ms 136556 KB Output is correct
41 Correct 929 ms 134332 KB Output is correct
42 Correct 899 ms 134648 KB Output is correct
43 Correct 272 ms 109580 KB Output is correct
44 Correct 899 ms 133728 KB Output is correct
45 Correct 819 ms 131420 KB Output is correct
46 Correct 760 ms 126748 KB Output is correct
47 Correct 562 ms 124496 KB Output is correct
48 Correct 555 ms 123512 KB Output is correct
49 Correct 661 ms 127464 KB Output is correct
50 Correct 730 ms 132512 KB Output is correct
51 Correct 635 ms 126380 KB Output is correct
52 Correct 4812 ms 287920 KB Output is correct
53 Execution timed out 5119 ms 291320 KB Time limit exceeded
54 Halted 0 ms 0 KB -