oj.uz

Submission #160950

# Submission time Handle Problem Language Result Execution time Memory
160950 2019-10-30T17:30:11 Z Minnakhmetov New Home (APIO18_new_home) C++14
47 / 100
 5000 ms 273016 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;
};

const int N = 3e5 + 5, INF = 1e9, MAX = 1e8;
int n, q, k, cc, cq;
int ans[N], loc[N], num[N];

vector<int> vx;
multiset<int> occ[N];
map<pair<int, int>, vector<int>> mp;
vector<pair<int, int>> t[N * 4];
pair<int, int> his[N * 20];
int len = 0;

struct ST {
    int t[N];

    ST() {
        fill(t, t + N, -INF);
    }

    void upd(int x, int y) {
        for (; x < N; x |= x + 1) {
            his[len++] = {x, t[x]};
            t[x] = max(t[x], y);
        }
    }

    int que(int x) {
        int ans = -INF;
        for (; x >= 0; x = (x & (x + 1)) - 1)
            ans = max(ans, t[x]);
        return ans;
    }
} fent;

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) {
    // cout << "!" << x << " " << y << "\n";
    auto p = make_pair(x, y);
    upd(mp[{x, y}].back(), cq - 1, p, 1, 0, q - 1);
    // cout << "SEG_END " << mp[{x, y}].back() << " " << cq - 1 << " " << x << " " << y << "\n";
    mp[{x, y}].pop_back();
}

void updBeg(int x, bool add) {
    // cout << "BEG " << x << " " << add << "\n";
    if (add)
        startSeg(0, x);
    else
        endSeg(0, x);
}

void updBetween(int x, int y, bool add) {
    // cout << "BET " << x << " " << y << " " << add << "\n";
    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) {
    int tmp = len;

    for (auto &p : t[v]) {
        fent.upd(p.first, p.second);
    }

    if (L == R) {
        ans[num[L]] = max(ans[num[L]], fent.que(loc[L]) - vx[loc[L]]);
    }
    else {
        int m = (L + R) >> 1;
        calcAns(v * 2, L, m);
        calcAns(v * 2 + 1, m + 1, R);
    }

    while (len > tmp) {
        len--;
        fent.t[his[len].first] = his[len].second;
    }
}

void solve(vector<E> evs) {
    vx.clear();
    mp.clear();
    for (int i = 0; i < N; i++) {
        occ[i].clear();
    }

    for (int i = 0; i < N * 4; i++) {
        t[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());

    cc = vx.size();
    cq = 0;

    for (E e : evs) {
        // cout << e.p << " " << e.t << " " << e.x << " " << e.y << "\n";
        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++;
        }
    }

    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;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 43768 KB Output is correct
2 Correct 56 ms 43768 KB Output is correct
3 Correct 54 ms 43768 KB Output is correct
4 Correct 55 ms 43768 KB Output is correct
5 Correct 56 ms 43896 KB Output is correct
6 Correct 57 ms 44152 KB Output is correct
7 Correct 105 ms 44148 KB Output is correct
8 Correct 58 ms 44124 KB Output is correct
9 Correct 58 ms 44152 KB Output is correct
10 Correct 65 ms 44152 KB Output is correct
11 Correct 64 ms 44032 KB Output is correct
12 Correct 62 ms 44024 KB Output is correct
13 Correct 61 ms 43900 KB Output is correct
14 Correct 63 ms 43896 KB Output is correct
15 Correct 63 ms 44092 KB Output is correct
16 Correct 59 ms 44152 KB Output is correct
17 Correct 56 ms 44024 KB Output is correct
18 Correct 57 ms 44152 KB Output is correct
19 Correct 60 ms 44152 KB Output is correct
20 Correct 56 ms 44024 KB Output is correct
21 Correct 56 ms 44024 KB Output is correct
22 Correct 58 ms 44252 KB Output is correct
23 Correct 57 ms 44172 KB Output is correct
24 Correct 57 ms 44152 KB Output is correct
25 Correct 57 ms 44040 KB Output is correct
26 Correct 57 ms 44024 KB Output is correct
27 Correct 58 ms 44024 KB Output is correct
28 Correct 57 ms 44152 KB Output is correct
29 Correct 58 ms 43932 KB Output is correct
30 Correct 59 ms 43896 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 43768 KB Output is correct
2 Correct 56 ms 43768 KB Output is correct
3 Correct 54 ms 43768 KB Output is correct
4 Correct 55 ms 43768 KB Output is correct
5 Correct 56 ms 43896 KB Output is correct
6 Correct 57 ms 44152 KB Output is correct
7 Correct 105 ms 44148 KB Output is correct
8 Correct 58 ms 44124 KB Output is correct
9 Correct 58 ms 44152 KB Output is correct
10 Correct 65 ms 44152 KB Output is correct
11 Correct 64 ms 44032 KB Output is correct
12 Correct 62 ms 44024 KB Output is correct
13 Correct 61 ms 43900 KB Output is correct
14 Correct 63 ms 43896 KB Output is correct
15 Correct 63 ms 44092 KB Output is correct
16 Correct 59 ms 44152 KB Output is correct
17 Correct 56 ms 44024 KB Output is correct
18 Correct 57 ms 44152 KB Output is correct
19 Correct 60 ms 44152 KB Output is correct
20 Correct 56 ms 44024 KB Output is correct
21 Correct 56 ms 44024 KB Output is correct
22 Correct 58 ms 44252 KB Output is correct
23 Correct 57 ms 44172 KB Output is correct
24 Correct 57 ms 44152 KB Output is correct
25 Correct 57 ms 44040 KB Output is correct
26 Correct 57 ms 44024 KB Output is correct
27 Correct 58 ms 44024 KB Output is correct
28 Correct 57 ms 44152 KB Output is correct
29 Correct 58 ms 43932 KB Output is correct
30 Correct 59 ms 43896 KB Output is correct
31 Correct 2361 ms 100632 KB Output is correct
32 Correct 227 ms 51960 KB Output is correct
33 Correct 1906 ms 93572 KB Output is correct
34 Correct 2060 ms 94456 KB Output is correct
35 Correct 2242 ms 100900 KB Output is correct
36 Correct 2154 ms 99672 KB Output is correct
37 Correct 1384 ms 88496 KB Output is correct
38 Correct 1344 ms 86360 KB Output is correct
39 Correct 995 ms 79964 KB Output is correct
40 Correct 1024 ms 81144 KB Output is correct
41 Correct 1269 ms 78768 KB Output is correct
42 Correct 1272 ms 79216 KB Output is correct
43 Correct 156 ms 53860 KB Output is correct
44 Correct 1230 ms 78180 KB Output is correct
45 Correct 1112 ms 75508 KB Output is correct
46 Correct 914 ms 70892 KB Output is correct
47 Correct 591 ms 68556 KB Output is correct
48 Correct 508 ms 67728 KB Output is correct
49 Correct 694 ms 71860 KB Output is correct
50 Correct 883 ms 76932 KB Output is correct
51 Correct 707 ms 70592 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 43768 KB Output is correct
2 Correct 56 ms 43768 KB Output is correct
3 Correct 54 ms 43768 KB Output is correct
4 Correct 55 ms 43768 KB Output is correct
5 Correct 56 ms 43896 KB Output is correct
6 Correct 57 ms 44152 KB Output is correct
7 Correct 105 ms 44148 KB Output is correct
8 Correct 58 ms 44124 KB Output is correct
9 Correct 58 ms 44152 KB Output is correct
10 Correct 65 ms 44152 KB Output is correct
11 Correct 64 ms 44032 KB Output is correct
12 Correct 62 ms 44024 KB Output is correct
13 Correct 61 ms 43900 KB Output is correct
14 Correct 63 ms 43896 KB Output is correct
15 Correct 63 ms 44092 KB Output is correct
16 Correct 59 ms 44152 KB Output is correct
17 Correct 56 ms 44024 KB Output is correct
18 Correct 57 ms 44152 KB Output is correct
19 Correct 60 ms 44152 KB Output is correct
20 Correct 56 ms 44024 KB Output is correct
21 Correct 56 ms 44024 KB Output is correct
22 Correct 58 ms 44252 KB Output is correct
23 Correct 57 ms 44172 KB Output is correct
24 Correct 57 ms 44152 KB Output is correct
25 Correct 57 ms 44040 KB Output is correct
26 Correct 57 ms 44024 KB Output is correct
27 Correct 58 ms 44024 KB Output is correct
28 Correct 57 ms 44152 KB Output is correct
29 Correct 58 ms 43932 KB Output is correct
30 Correct 59 ms 43896 KB Output is correct
31 Correct 2361 ms 100632 KB Output is correct
32 Correct 227 ms 51960 KB Output is correct
33 Correct 1906 ms 93572 KB Output is correct
34 Correct 2060 ms 94456 KB Output is correct
35 Correct 2242 ms 100900 KB Output is correct
36 Correct 2154 ms 99672 KB Output is correct
37 Correct 1384 ms 88496 KB Output is correct
38 Correct 1344 ms 86360 KB Output is correct
39 Correct 995 ms 79964 KB Output is correct
40 Correct 1024 ms 81144 KB Output is correct
41 Correct 1269 ms 78768 KB Output is correct
42 Correct 1272 ms 79216 KB Output is correct
43 Correct 156 ms 53860 KB Output is correct
44 Correct 1230 ms 78180 KB Output is correct
45 Correct 1112 ms 75508 KB Output is correct
46 Correct 914 ms 70892 KB Output is correct
47 Correct 591 ms 68556 KB Output is correct
48 Correct 508 ms 67728 KB Output is correct
49 Correct 694 ms 71860 KB Output is correct
50 Correct 883 ms 76932 KB Output is correct
51 Correct 707 ms 70592 KB Output is correct
52 Correct 1352 ms 113612 KB Output is correct
53 Correct 1182 ms 94744 KB Output is correct
54 Correct 1643 ms 99692 KB Output is correct
55 Correct 1309 ms 92820 KB Output is correct
56 Correct 1286 ms 97920 KB Output is correct
57 Correct 1281 ms 82756 KB Output is correct
58 Correct 1358 ms 91464 KB Output is correct
59 Correct 1361 ms 97132 KB Output is correct
60 Correct 1287 ms 82740 KB Output is correct
61 Correct 212 ms 70364 KB Output is correct
62 Correct 1433 ms 114756 KB Output is correct
63 Correct 1670 ms 101608 KB Output is correct
64 Correct 1599 ms 96952 KB Output is correct
65 Correct 1604 ms 89164 KB Output is correct
66 Correct 1365 ms 80936 KB Output is correct
67 Correct 510 ms 63108 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 43768 KB Output is correct
2 Correct 56 ms 43768 KB Output is correct
3 Correct 54 ms 43768 KB Output is correct
4 Correct 55 ms 43768 KB Output is correct
5 Correct 56 ms 43896 KB Output is correct
6 Correct 57 ms 44152 KB Output is correct
7 Correct 105 ms 44148 KB Output is correct
8 Correct 58 ms 44124 KB Output is correct
9 Correct 58 ms 44152 KB Output is correct
10 Correct 65 ms 44152 KB Output is correct
11 Correct 64 ms 44032 KB Output is correct
12 Correct 62 ms 44024 KB Output is correct
13 Correct 61 ms 43900 KB Output is correct
14 Correct 63 ms 43896 KB Output is correct
15 Correct 63 ms 44092 KB Output is correct
16 Correct 59 ms 44152 KB Output is correct
17 Correct 56 ms 44024 KB Output is correct
18 Correct 57 ms 44152 KB Output is correct
19 Correct 60 ms 44152 KB Output is correct
20 Correct 56 ms 44024 KB Output is correct
21 Correct 56 ms 44024 KB Output is correct
22 Correct 58 ms 44252 KB Output is correct
23 Correct 57 ms 44172 KB Output is correct
24 Correct 57 ms 44152 KB Output is correct
25 Correct 57 ms 44040 KB Output is correct
26 Correct 57 ms 44024 KB Output is correct
27 Correct 58 ms 44024 KB Output is correct
28 Correct 57 ms 44152 KB Output is correct
29 Correct 58 ms 43932 KB Output is correct
30 Correct 59 ms 43896 KB Output is correct
31 Correct 2361 ms 100632 KB Output is correct
32 Correct 227 ms 51960 KB Output is correct
33 Correct 1906 ms 93572 KB Output is correct
34 Correct 2060 ms 94456 KB Output is correct
35 Correct 2242 ms 100900 KB Output is correct
36 Correct 2154 ms 99672 KB Output is correct
37 Correct 1384 ms 88496 KB Output is correct
38 Correct 1344 ms 86360 KB Output is correct
39 Correct 995 ms 79964 KB Output is correct
40 Correct 1024 ms 81144 KB Output is correct
41 Correct 1269 ms 78768 KB Output is correct
42 Correct 1272 ms 79216 KB Output is correct
43 Correct 156 ms 53860 KB Output is correct
44 Correct 1230 ms 78180 KB Output is correct
45 Correct 1112 ms 75508 KB Output is correct
46 Correct 914 ms 70892 KB Output is correct
47 Correct 591 ms 68556 KB Output is correct
48 Correct 508 ms 67728 KB Output is correct
49 Correct 694 ms 71860 KB Output is correct
50 Correct 883 ms 76932 KB Output is correct
51 Correct 707 ms 70592 KB Output is correct
52 Execution timed out 5021 ms 187448 KB Time limit exceeded
53 Halted 0 ms 0 KB -