oj.uz

Submission #77327

# Submission time Handle Problem Language Result Execution time Memory
77327 2018-09-25T19:00:51 Z 298iq New Home (APIO18_new_home) C++14
47 / 100
 5000 ms 84056 KB 
#include <bits/stdc++.h>

using namespace std;

const int INF = 1e9 + 7;
const int MAXV = 1e8 + 7;

namespace DD {

mt19937 rnd(228);
    
struct Node {
    pair <int, int> p;
    int y, mx;
    Node *l, *r;
    Node(pair <int, int> p_) {
        p = p_; y = rnd(); mx = p.second;
        l = r = NULL;
    }
    Node(){}
};

int mx(Node *t) {
    if (!t) return -1;
    else return t->mx;
}
   
void relax(Node *t) {
    t->mx = max(max(mx(t->l), mx(t->r)), t->p.second);
}

Node *merge(Node *l, Node *r) {
    if (!l) return r;
    if (!r) return l;
    if (l->y < r->y) {
        l->r = merge(l->r, r);
        relax(l);
        return l;   
    }
    else {
        r->l = merge(l, r->l);
        relax(r);
        return r;
    }
}

pair <Node*, Node*> split(Node *t, pair <int, int> key) {
    if (!t) return {NULL, NULL};
    if (t->p <= key) {
        auto tmp = split(t->r, key);
        t->r = tmp.first;
        relax(t);
        return {t, tmp.second};
    }
    else {
        auto tmp = split(t->l, key);
        t->l = tmp.second;
        relax(t);
        return {tmp.first, t};
    }
}

Node *insert(Node *t, pair <int, int> p) {
    auto tmp = split(t, p);
    return merge(merge(tmp.first, new Node(p)), tmp.second);
}

Node *erase(Node *t, pair <int, int> p) {
    auto tmp1 = split(t, p);
    auto tmp2 = split(tmp1.first, {p.first, p.second - 1});
    tmp2.second = merge(tmp2.second->l, tmp2.second->r);
    return merge(merge(tmp2.first, tmp2.second), tmp1.second);
}
};

const int MAXN = 3e5 + 7;

int n, k, q;
int p[MAXN], c[MAXN], l[MAXN], r[MAXN];
int p2[MAXN], t2[MAXN];
void read() {
    cin >> n >> k >> q;
    for (int i = 0; i < n; ++i) {
        cin >> p[i] >> c[i] >> l[i] >> r[i];
        --c[i];
    }
    for (int i = 0; i < q; ++i) {
        cin >> p2[i] >> t2[i];
    }
}

struct Event {
    bool type;
    int t, i;
    Event(bool type_, int t_, int i_) {
        type = type_; t = t_; i = i_;
    }
    Event(){}
};

bool comp(Event a, Event b) {
    return a.t < b.t;
}

int ans[MAXN];
int qper[MAXN];

bool comp1(int i, int j) {
    return t2[i] < t2[j];
}

using namespace DD;

Node *dd = NULL;
multiset <int> ps[MAXN];

void add(int c, int p, int num) {
    auto r = ps[c].lower_bound(p);
    auto l = r; --l;
    dd = erase(dd, {*l, *r});
    dd = insert(dd, {*l, p});
    dd = insert(dd, {p, *r});
    ps[c].insert(p);
}

void del(int c, int p, int num) {
    auto it = ps[c].lower_bound(p);
    auto l = it; --l;
    auto r = it; ++r;
    dd = erase(dd, {*l, p});
    dd = erase(dd, {p, *r});
    dd = insert(dd, {*l, *r});
    ps[c].erase(it);
}

void upd(Event e) {
    if (e.type) {
        add(c[e.i], p[e.i], e.i);
    }
    else {
        del(c[e.i], p[e.i], e.i);
    }
}

bool check(int l, int r) {
    l = max(l, 1);
    r = min(r, MAXV);
    --l; ++r;
    auto tmp = split(dd, {l, INF});
    int res = mx(tmp.first);
    dd = merge(tmp.first, tmp.second);
    return (res < r);
}

int get(int p) {
    if (!check(1, MAXV)) return -1;
    int l = -1;
    int r = MAXV;
    while (l < r - 1) {
        int m = (l + r) / 2;
        if (!check(p - m, p + m)) l = m;
        else r = m;
    }
    return r;
}

void solve() {
    vector <Event> v;
    for (int i = 0; i < n; ++i) {
        v.push_back(Event(1, l[i], i));
        v.push_back(Event(0, r[i] + 1, i));
    }
    sort(v.begin(), v.end(), comp);

    for (int i = 0; i < q; ++i) qper[i] = i;
    sort(qper, qper + q, comp1);

    for (int i = 0; i < k; ++i) {
        ps[i].insert(-INF);
        ps[i].insert(INF);
        dd = insert(dd, {-INF, INF});
    }

    int u = 0;
    for (int i = 0; i < q; ++i) {
        while (u < (int)v.size() && v[u].t <= t2[qper[i]]) {
            upd(v[u]);
            ++u;
        }   
        ans[qper[i]] = get(p2[qper[i]]);
    }
}

void print() {
    for (int i = 0; i < q; ++i) {
        cout << ans[i] << '\n';
    }
}

signed main() {
    //freopen("input.txt", "r", stdin);

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    read();
    solve();
    print();

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14760 KB Output is correct
3 Correct 14 ms 14760 KB Output is correct
4 Correct 14 ms 14760 KB Output is correct
5 Correct 17 ms 14760 KB Output is correct
6 Correct 16 ms 14832 KB Output is correct
7 Correct 16 ms 14832 KB Output is correct
8 Correct 16 ms 14832 KB Output is correct
9 Correct 16 ms 14832 KB Output is correct
10 Correct 16 ms 14832 KB Output is correct
11 Correct 16 ms 14832 KB Output is correct
12 Correct 16 ms 14904 KB Output is correct
13 Correct 16 ms 14924 KB Output is correct
14 Correct 15 ms 14992 KB Output is correct
15 Correct 17 ms 15176 KB Output is correct
16 Correct 19 ms 15176 KB Output is correct
17 Correct 18 ms 15176 KB Output is correct
18 Correct 17 ms 15176 KB Output is correct
19 Correct 18 ms 15176 KB Output is correct
20 Correct 16 ms 15176 KB Output is correct
21 Correct 17 ms 15212 KB Output is correct
22 Correct 18 ms 15276 KB Output is correct
23 Correct 17 ms 15276 KB Output is correct
24 Correct 17 ms 15276 KB Output is correct
25 Correct 16 ms 15276 KB Output is correct
26 Correct 16 ms 15276 KB Output is correct
27 Correct 16 ms 15276 KB Output is correct
28 Correct 16 ms 15288 KB Output is correct
29 Correct 15 ms 15308 KB Output is correct
30 Correct 16 ms 15324 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14760 KB Output is correct
3 Correct 14 ms 14760 KB Output is correct
4 Correct 14 ms 14760 KB Output is correct
5 Correct 17 ms 14760 KB Output is correct
6 Correct 16 ms 14832 KB Output is correct
7 Correct 16 ms 14832 KB Output is correct
8 Correct 16 ms 14832 KB Output is correct
9 Correct 16 ms 14832 KB Output is correct
10 Correct 16 ms 14832 KB Output is correct
11 Correct 16 ms 14832 KB Output is correct
12 Correct 16 ms 14904 KB Output is correct
13 Correct 16 ms 14924 KB Output is correct
14 Correct 15 ms 14992 KB Output is correct
15 Correct 17 ms 15176 KB Output is correct
16 Correct 19 ms 15176 KB Output is correct
17 Correct 18 ms 15176 KB Output is correct
18 Correct 17 ms 15176 KB Output is correct
19 Correct 18 ms 15176 KB Output is correct
20 Correct 16 ms 15176 KB Output is correct
21 Correct 17 ms 15212 KB Output is correct
22 Correct 18 ms 15276 KB Output is correct
23 Correct 17 ms 15276 KB Output is correct
24 Correct 17 ms 15276 KB Output is correct
25 Correct 16 ms 15276 KB Output is correct
26 Correct 16 ms 15276 KB Output is correct
27 Correct 16 ms 15276 KB Output is correct
28 Correct 16 ms 15288 KB Output is correct
29 Correct 15 ms 15308 KB Output is correct
30 Correct 16 ms 15324 KB Output is correct
31 Correct 1132 ms 28320 KB Output is correct
32 Correct 636 ms 28416 KB Output is correct
33 Correct 947 ms 28416 KB Output is correct
34 Correct 939 ms 28416 KB Output is correct
35 Correct 1216 ms 28416 KB Output is correct
36 Correct 1221 ms 28416 KB Output is correct
37 Correct 711 ms 28416 KB Output is correct
38 Correct 683 ms 28416 KB Output is correct
39 Correct 465 ms 28416 KB Output is correct
40 Correct 478 ms 28416 KB Output is correct
41 Correct 518 ms 28416 KB Output is correct
42 Correct 390 ms 28544 KB Output is correct
43 Correct 387 ms 28544 KB Output is correct
44 Correct 480 ms 28544 KB Output is correct
45 Correct 409 ms 28544 KB Output is correct
46 Correct 315 ms 28544 KB Output is correct
47 Correct 243 ms 28544 KB Output is correct
48 Correct 238 ms 28544 KB Output is correct
49 Correct 311 ms 28544 KB Output is correct
50 Correct 350 ms 28544 KB Output is correct
51 Correct 285 ms 28544 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4116 ms 84056 KB Output is correct
2 Execution timed out 5015 ms 84056 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 5030 ms 84056 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14760 KB Output is correct
3 Correct 14 ms 14760 KB Output is correct
4 Correct 14 ms 14760 KB Output is correct
5 Correct 17 ms 14760 KB Output is correct
6 Correct 16 ms 14832 KB Output is correct
7 Correct 16 ms 14832 KB Output is correct
8 Correct 16 ms 14832 KB Output is correct
9 Correct 16 ms 14832 KB Output is correct
10 Correct 16 ms 14832 KB Output is correct
11 Correct 16 ms 14832 KB Output is correct
12 Correct 16 ms 14904 KB Output is correct
13 Correct 16 ms 14924 KB Output is correct
14 Correct 15 ms 14992 KB Output is correct
15 Correct 17 ms 15176 KB Output is correct
16 Correct 19 ms 15176 KB Output is correct
17 Correct 18 ms 15176 KB Output is correct
18 Correct 17 ms 15176 KB Output is correct
19 Correct 18 ms 15176 KB Output is correct
20 Correct 16 ms 15176 KB Output is correct
21 Correct 17 ms 15212 KB Output is correct
22 Correct 18 ms 15276 KB Output is correct
23 Correct 17 ms 15276 KB Output is correct
24 Correct 17 ms 15276 KB Output is correct
25 Correct 16 ms 15276 KB Output is correct
26 Correct 16 ms 15276 KB Output is correct
27 Correct 16 ms 15276 KB Output is correct
28 Correct 16 ms 15288 KB Output is correct
29 Correct 15 ms 15308 KB Output is correct
30 Correct 16 ms 15324 KB Output is correct
31 Correct 1132 ms 28320 KB Output is correct
32 Correct 636 ms 28416 KB Output is correct
33 Correct 947 ms 28416 KB Output is correct
34 Correct 939 ms 28416 KB Output is correct
35 Correct 1216 ms 28416 KB Output is correct
36 Correct 1221 ms 28416 KB Output is correct
37 Correct 711 ms 28416 KB Output is correct
38 Correct 683 ms 28416 KB Output is correct
39 Correct 465 ms 28416 KB Output is correct
40 Correct 478 ms 28416 KB Output is correct
41 Correct 518 ms 28416 KB Output is correct
42 Correct 390 ms 28544 KB Output is correct
43 Correct 387 ms 28544 KB Output is correct
44 Correct 480 ms 28544 KB Output is correct
45 Correct 409 ms 28544 KB Output is correct
46 Correct 315 ms 28544 KB Output is correct
47 Correct 243 ms 28544 KB Output is correct
48 Correct 238 ms 28544 KB Output is correct
49 Correct 311 ms 28544 KB Output is correct
50 Correct 350 ms 28544 KB Output is correct
51 Correct 285 ms 28544 KB Output is correct
52 Correct 607 ms 84056 KB Output is correct
53 Correct 584 ms 84056 KB Output is correct
54 Correct 595 ms 84056 KB Output is correct
55 Correct 820 ms 84056 KB Output is correct
56 Correct 817 ms 84056 KB Output is correct
57 Correct 615 ms 84056 KB Output is correct
58 Correct 668 ms 84056 KB Output is correct
59 Correct 598 ms 84056 KB Output is correct
60 Correct 552 ms 84056 KB Output is correct
61 Correct 590 ms 84056 KB Output is correct
62 Correct 722 ms 84056 KB Output is correct
63 Correct 729 ms 84056 KB Output is correct
64 Correct 744 ms 84056 KB Output is correct
65 Correct 717 ms 84056 KB Output is correct
66 Correct 563 ms 84056 KB Output is correct
67 Correct 625 ms 84056 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14456 KB Output is correct
2 Correct 15 ms 14760 KB Output is correct
3 Correct 14 ms 14760 KB Output is correct
4 Correct 14 ms 14760 KB Output is correct
5 Correct 17 ms 14760 KB Output is correct
6 Correct 16 ms 14832 KB Output is correct
7 Correct 16 ms 14832 KB Output is correct
8 Correct 16 ms 14832 KB Output is correct
9 Correct 16 ms 14832 KB Output is correct
10 Correct 16 ms 14832 KB Output is correct
11 Correct 16 ms 14832 KB Output is correct
12 Correct 16 ms 14904 KB Output is correct
13 Correct 16 ms 14924 KB Output is correct
14 Correct 15 ms 14992 KB Output is correct
15 Correct 17 ms 15176 KB Output is correct
16 Correct 19 ms 15176 KB Output is correct
17 Correct 18 ms 15176 KB Output is correct
18 Correct 17 ms 15176 KB Output is correct
19 Correct 18 ms 15176 KB Output is correct
20 Correct 16 ms 15176 KB Output is correct
21 Correct 17 ms 15212 KB Output is correct
22 Correct 18 ms 15276 KB Output is correct
23 Correct 17 ms 15276 KB Output is correct
24 Correct 17 ms 15276 KB Output is correct
25 Correct 16 ms 15276 KB Output is correct
26 Correct 16 ms 15276 KB Output is correct
27 Correct 16 ms 15276 KB Output is correct
28 Correct 16 ms 15288 KB Output is correct
29 Correct 15 ms 15308 KB Output is correct
30 Correct 16 ms 15324 KB Output is correct
31 Correct 1132 ms 28320 KB Output is correct
32 Correct 636 ms 28416 KB Output is correct
33 Correct 947 ms 28416 KB Output is correct
34 Correct 939 ms 28416 KB Output is correct
35 Correct 1216 ms 28416 KB Output is correct
36 Correct 1221 ms 28416 KB Output is correct
37 Correct 711 ms 28416 KB Output is correct
38 Correct 683 ms 28416 KB Output is correct
39 Correct 465 ms 28416 KB Output is correct
40 Correct 478 ms 28416 KB Output is correct
41 Correct 518 ms 28416 KB Output is correct
42 Correct 390 ms 28544 KB Output is correct
43 Correct 387 ms 28544 KB Output is correct
44 Correct 480 ms 28544 KB Output is correct
45 Correct 409 ms 28544 KB Output is correct
46 Correct 315 ms 28544 KB Output is correct
47 Correct 243 ms 28544 KB Output is correct
48 Correct 238 ms 28544 KB Output is correct
49 Correct 311 ms 28544 KB Output is correct
50 Correct 350 ms 28544 KB Output is correct
51 Correct 285 ms 28544 KB Output is correct
52 Correct 4116 ms 84056 KB Output is correct
53 Execution timed out 5015 ms 84056 KB Time limit exceeded
54 Halted 0 ms 0 KB -