oj.uz

Submission #77335

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

using namespace std;

const int MEM = 10e8;
char mem[MEM];
int ptr = 0;
void* operator new(size_t n) {
    ptr += n;
    return mem + (ptr - n);
}

void operator delete(void *) {}

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

namespace DD {

struct Node {
    multiset <int> ms;
    Node *l, *r;
    Node() {
        ms = {};
        l = r = NULL;
    }
};

void push(Node *t) {
    if (!t->l) t->l = new Node();
    if (!t->r) t->r = new Node();
}

void add(Node *t, int tl, int tr, int p, int x) {
    t->ms.insert(x);
    if (tl == tr) return;
    int tm = tl + (tr - tl) / 2;
    push(t);
    if (p <= tm) add(t->l, tl, tm, p, x);
    else add(t->r, tm + 1, tr, p, x);
}

void del(Node *t, int tl, int tr, int p, int x) {
    t->ms.erase(t->ms.find(x));
    if (tl == tr) return;
    int tm = tl + (tr - tl) / 2;
    if (p <= tm) del(t->l, tl, tm, p, x);
    else del(t->r, tm + 1, tr, p, x);
}

bool get(Node *t, int tl, int tr, int l, int r, int x) {
    if (tr < l || r < tl) return 0;
    if (l <= tl && tr <= r) return (t->ms.size() && *t->ms.rbegin() >= x);
    int tm = tl + (tr - tl) / 2;
    push(t);
    if (get(t->l, tl, tm, l, r, x)) return 1;
    if (get(t->r, tm + 1, tr, l, r, x)) return 1;
    return 0;
}

};

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 = new Node;
multiset <int> ps[MAXN];

void add(int c, int p, int num) {
    auto r = ps[c].lower_bound(p);
    auto l = r; --l;
    del(dd, -INF, INF, *l, *r);
    add(dd, -INF, INF, *l, p);
    add(dd, -INF, INF, 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;
    del(dd, -INF, INF, *l, p);
    del(dd, -INF, INF, p, *r);
    add(dd, -INF, INF, *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;
    return !get(dd, -INF, INF, -INF, l, 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);
        add(dd, -INF, INF, -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 14 ms 14584 KB Output is correct
2 Correct 14 ms 14588 KB Output is correct
3 Correct 13 ms 14588 KB Output is correct
4 Correct 14 ms 14880 KB Output is correct
5 Correct 19 ms 15948 KB Output is correct
6 Correct 26 ms 21504 KB Output is correct
7 Correct 21 ms 21504 KB Output is correct
8 Correct 23 ms 21504 KB Output is correct
9 Correct 24 ms 21504 KB Output is correct
10 Correct 29 ms 21888 KB Output is correct
11 Correct 18 ms 21888 KB Output is correct
12 Correct 26 ms 22836 KB Output is correct
13 Correct 18 ms 22836 KB Output is correct
14 Correct 20 ms 22836 KB Output is correct
15 Correct 24 ms 22836 KB Output is correct
16 Correct 25 ms 22836 KB Output is correct
17 Correct 23 ms 22836 KB Output is correct
18 Correct 23 ms 22836 KB Output is correct
19 Correct 23 ms 22836 KB Output is correct
20 Correct 22 ms 22836 KB Output is correct
21 Correct 19 ms 22836 KB Output is correct
22 Correct 24 ms 22836 KB Output is correct
23 Correct 22 ms 22836 KB Output is correct
24 Correct 22 ms 22836 KB Output is correct
25 Correct 22 ms 22836 KB Output is correct
26 Correct 23 ms 22836 KB Output is correct
27 Correct 18 ms 22836 KB Output is correct
28 Correct 22 ms 22836 KB Output is correct
29 Correct 22 ms 22836 KB Output is correct
30 Correct 23 ms 22836 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14584 KB Output is correct
2 Correct 14 ms 14588 KB Output is correct
3 Correct 13 ms 14588 KB Output is correct
4 Correct 14 ms 14880 KB Output is correct
5 Correct 19 ms 15948 KB Output is correct
6 Correct 26 ms 21504 KB Output is correct
7 Correct 21 ms 21504 KB Output is correct
8 Correct 23 ms 21504 KB Output is correct
9 Correct 24 ms 21504 KB Output is correct
10 Correct 29 ms 21888 KB Output is correct
11 Correct 18 ms 21888 KB Output is correct
12 Correct 26 ms 22836 KB Output is correct
13 Correct 18 ms 22836 KB Output is correct
14 Correct 20 ms 22836 KB Output is correct
15 Correct 24 ms 22836 KB Output is correct
16 Correct 25 ms 22836 KB Output is correct
17 Correct 23 ms 22836 KB Output is correct
18 Correct 23 ms 22836 KB Output is correct
19 Correct 23 ms 22836 KB Output is correct
20 Correct 22 ms 22836 KB Output is correct
21 Correct 19 ms 22836 KB Output is correct
22 Correct 24 ms 22836 KB Output is correct
23 Correct 22 ms 22836 KB Output is correct
24 Correct 22 ms 22836 KB Output is correct
25 Correct 22 ms 22836 KB Output is correct
26 Correct 23 ms 22836 KB Output is correct
27 Correct 18 ms 22836 KB Output is correct
28 Correct 22 ms 22836 KB Output is correct
29 Correct 22 ms 22836 KB Output is correct
30 Correct 23 ms 22836 KB Output is correct
31 Correct 4648 ms 740116 KB Output is correct
32 Correct 2537 ms 740116 KB Output is correct
33 Correct 3951 ms 918136 KB Output is correct
34 Correct 4085 ms 918136 KB Output is correct
35 Correct 4479 ms 918136 KB Output is correct
36 Correct 4603 ms 931472 KB Output is correct
37 Correct 3303 ms 931472 KB Output is correct
38 Correct 3414 ms 971528 KB Output is correct
39 Correct 2401 ms 971528 KB Output is correct
40 Correct 2692 ms 971528 KB Output is correct
41 Correct 1645 ms 971528 KB Output is correct
42 Correct 1502 ms 971528 KB Output is correct
43 Correct 941 ms 971528 KB Output is correct
44 Correct 1628 ms 971528 KB Output is correct
45 Correct 1464 ms 971528 KB Output is correct
46 Correct 1473 ms 971528 KB Output is correct
47 Correct 1362 ms 971528 KB Output is correct
48 Correct 1637 ms 971528 KB Output is correct
49 Correct 1686 ms 971528 KB Output is correct
50 Correct 1633 ms 971528 KB Output is correct
51 Correct 1649 ms 971528 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5054 ms 971528 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 5037 ms 971528 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14584 KB Output is correct
2 Correct 14 ms 14588 KB Output is correct
3 Correct 13 ms 14588 KB Output is correct
4 Correct 14 ms 14880 KB Output is correct
5 Correct 19 ms 15948 KB Output is correct
6 Correct 26 ms 21504 KB Output is correct
7 Correct 21 ms 21504 KB Output is correct
8 Correct 23 ms 21504 KB Output is correct
9 Correct 24 ms 21504 KB Output is correct
10 Correct 29 ms 21888 KB Output is correct
11 Correct 18 ms 21888 KB Output is correct
12 Correct 26 ms 22836 KB Output is correct
13 Correct 18 ms 22836 KB Output is correct
14 Correct 20 ms 22836 KB Output is correct
15 Correct 24 ms 22836 KB Output is correct
16 Correct 25 ms 22836 KB Output is correct
17 Correct 23 ms 22836 KB Output is correct
18 Correct 23 ms 22836 KB Output is correct
19 Correct 23 ms 22836 KB Output is correct
20 Correct 22 ms 22836 KB Output is correct
21 Correct 19 ms 22836 KB Output is correct
22 Correct 24 ms 22836 KB Output is correct
23 Correct 22 ms 22836 KB Output is correct
24 Correct 22 ms 22836 KB Output is correct
25 Correct 22 ms 22836 KB Output is correct
26 Correct 23 ms 22836 KB Output is correct
27 Correct 18 ms 22836 KB Output is correct
28 Correct 22 ms 22836 KB Output is correct
29 Correct 22 ms 22836 KB Output is correct
30 Correct 23 ms 22836 KB Output is correct
31 Correct 4648 ms 740116 KB Output is correct
32 Correct 2537 ms 740116 KB Output is correct
33 Correct 3951 ms 918136 KB Output is correct
34 Correct 4085 ms 918136 KB Output is correct
35 Correct 4479 ms 918136 KB Output is correct
36 Correct 4603 ms 931472 KB Output is correct
37 Correct 3303 ms 931472 KB Output is correct
38 Correct 3414 ms 971528 KB Output is correct
39 Correct 2401 ms 971528 KB Output is correct
40 Correct 2692 ms 971528 KB Output is correct
41 Correct 1645 ms 971528 KB Output is correct
42 Correct 1502 ms 971528 KB Output is correct
43 Correct 941 ms 971528 KB Output is correct
44 Correct 1628 ms 971528 KB Output is correct
45 Correct 1464 ms 971528 KB Output is correct
46 Correct 1473 ms 971528 KB Output is correct
47 Correct 1362 ms 971528 KB Output is correct
48 Correct 1637 ms 971528 KB Output is correct
49 Correct 1686 ms 971528 KB Output is correct
50 Correct 1633 ms 971528 KB Output is correct
51 Correct 1649 ms 971528 KB Output is correct
52 Correct 3470 ms 971528 KB Output is correct
53 Correct 3456 ms 971528 KB Output is correct
54 Correct 3796 ms 971528 KB Output is correct
55 Correct 2839 ms 971528 KB Output is correct
56 Correct 3095 ms 971528 KB Output is correct
57 Correct 2279 ms 971528 KB Output is correct
58 Correct 2667 ms 971528 KB Output is correct
59 Correct 2870 ms 971528 KB Output is correct
60 Correct 2201 ms 971528 KB Output is correct
61 Correct 1876 ms 971528 KB Output is correct
62 Correct 3672 ms 971528 KB Output is correct
63 Correct 3872 ms 971528 KB Output is correct
64 Correct 3882 ms 971528 KB Output is correct
65 Correct 3186 ms 971528 KB Output is correct
66 Correct 1902 ms 971528 KB Output is correct
67 Correct 3636 ms 971528 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14584 KB Output is correct
2 Correct 14 ms 14588 KB Output is correct
3 Correct 13 ms 14588 KB Output is correct
4 Correct 14 ms 14880 KB Output is correct
5 Correct 19 ms 15948 KB Output is correct
6 Correct 26 ms 21504 KB Output is correct
7 Correct 21 ms 21504 KB Output is correct
8 Correct 23 ms 21504 KB Output is correct
9 Correct 24 ms 21504 KB Output is correct
10 Correct 29 ms 21888 KB Output is correct
11 Correct 18 ms 21888 KB Output is correct
12 Correct 26 ms 22836 KB Output is correct
13 Correct 18 ms 22836 KB Output is correct
14 Correct 20 ms 22836 KB Output is correct
15 Correct 24 ms 22836 KB Output is correct
16 Correct 25 ms 22836 KB Output is correct
17 Correct 23 ms 22836 KB Output is correct
18 Correct 23 ms 22836 KB Output is correct
19 Correct 23 ms 22836 KB Output is correct
20 Correct 22 ms 22836 KB Output is correct
21 Correct 19 ms 22836 KB Output is correct
22 Correct 24 ms 22836 KB Output is correct
23 Correct 22 ms 22836 KB Output is correct
24 Correct 22 ms 22836 KB Output is correct
25 Correct 22 ms 22836 KB Output is correct
26 Correct 23 ms 22836 KB Output is correct
27 Correct 18 ms 22836 KB Output is correct
28 Correct 22 ms 22836 KB Output is correct
29 Correct 22 ms 22836 KB Output is correct
30 Correct 23 ms 22836 KB Output is correct
31 Correct 4648 ms 740116 KB Output is correct
32 Correct 2537 ms 740116 KB Output is correct
33 Correct 3951 ms 918136 KB Output is correct
34 Correct 4085 ms 918136 KB Output is correct
35 Correct 4479 ms 918136 KB Output is correct
36 Correct 4603 ms 931472 KB Output is correct
37 Correct 3303 ms 931472 KB Output is correct
38 Correct 3414 ms 971528 KB Output is correct
39 Correct 2401 ms 971528 KB Output is correct
40 Correct 2692 ms 971528 KB Output is correct
41 Correct 1645 ms 971528 KB Output is correct
42 Correct 1502 ms 971528 KB Output is correct
43 Correct 941 ms 971528 KB Output is correct
44 Correct 1628 ms 971528 KB Output is correct
45 Correct 1464 ms 971528 KB Output is correct
46 Correct 1473 ms 971528 KB Output is correct
47 Correct 1362 ms 971528 KB Output is correct
48 Correct 1637 ms 971528 KB Output is correct
49 Correct 1686 ms 971528 KB Output is correct
50 Correct 1633 ms 971528 KB Output is correct
51 Correct 1649 ms 971528 KB Output is correct
52 Execution timed out 5054 ms 971528 KB Time limit exceeded
53 Halted 0 ms 0 KB -