oj.uz

답안 #77326

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
77326 2018-09-25T18:57:37 Z 298iq 새 집 (APIO18_new_home) C++14
47 / 100
 5000 ms 167124 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

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, 1ll);
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14456 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 14588 KB Output is correct
5 Correct 16 ms 14704 KB Output is correct
6 Correct 17 ms 14860 KB Output is correct
7 Correct 16 ms 14868 KB Output is correct
8 Correct 15 ms 14904 KB Output is correct
9 Correct 15 ms 14940 KB Output is correct
10 Correct 16 ms 14960 KB Output is correct
11 Correct 16 ms 14960 KB Output is correct
12 Correct 16 ms 14960 KB Output is correct
13 Correct 15 ms 15020 KB Output is correct
14 Correct 15 ms 15020 KB Output is correct
15 Correct 18 ms 15108 KB Output is correct
16 Correct 16 ms 15268 KB Output is correct
17 Correct 16 ms 15268 KB Output is correct
18 Correct 16 ms 15336 KB Output is correct
19 Correct 17 ms 15336 KB Output is correct
20 Correct 15 ms 15336 KB Output is correct
21 Correct 16 ms 15336 KB Output is correct
22 Correct 17 ms 15336 KB Output is correct
23 Correct 15 ms 15376 KB Output is correct
24 Correct 16 ms 15376 KB Output is correct
25 Correct 16 ms 15376 KB Output is correct
26 Correct 16 ms 15376 KB Output is correct
27 Correct 15 ms 15376 KB Output is correct
28 Correct 17 ms 15376 KB Output is correct
29 Correct 15 ms 15376 KB Output is correct
30 Correct 15 ms 15376 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14456 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 14588 KB Output is correct
5 Correct 16 ms 14704 KB Output is correct
6 Correct 17 ms 14860 KB Output is correct
7 Correct 16 ms 14868 KB Output is correct
8 Correct 15 ms 14904 KB Output is correct
9 Correct 15 ms 14940 KB Output is correct
10 Correct 16 ms 14960 KB Output is correct
11 Correct 16 ms 14960 KB Output is correct
12 Correct 16 ms 14960 KB Output is correct
13 Correct 15 ms 15020 KB Output is correct
14 Correct 15 ms 15020 KB Output is correct
15 Correct 18 ms 15108 KB Output is correct
16 Correct 16 ms 15268 KB Output is correct
17 Correct 16 ms 15268 KB Output is correct
18 Correct 16 ms 15336 KB Output is correct
19 Correct 17 ms 15336 KB Output is correct
20 Correct 15 ms 15336 KB Output is correct
21 Correct 16 ms 15336 KB Output is correct
22 Correct 17 ms 15336 KB Output is correct
23 Correct 15 ms 15376 KB Output is correct
24 Correct 16 ms 15376 KB Output is correct
25 Correct 16 ms 15376 KB Output is correct
26 Correct 16 ms 15376 KB Output is correct
27 Correct 15 ms 15376 KB Output is correct
28 Correct 17 ms 15376 KB Output is correct
29 Correct 15 ms 15376 KB Output is correct
30 Correct 15 ms 15376 KB Output is correct
31 Correct 1105 ms 38776 KB Output is correct
32 Correct 619 ms 38776 KB Output is correct
33 Correct 982 ms 40796 KB Output is correct
34 Correct 935 ms 43948 KB Output is correct
35 Correct 1133 ms 48624 KB Output is correct
36 Correct 1202 ms 51352 KB Output is correct
37 Correct 674 ms 51752 KB Output is correct
38 Correct 698 ms 54604 KB Output is correct
39 Correct 452 ms 57084 KB Output is correct
40 Correct 486 ms 59832 KB Output is correct
41 Correct 516 ms 62824 KB Output is correct
42 Correct 417 ms 66004 KB Output is correct
43 Correct 386 ms 67348 KB Output is correct
44 Correct 514 ms 71272 KB Output is correct
45 Correct 433 ms 73992 KB Output is correct
46 Correct 299 ms 76776 KB Output is correct
47 Correct 259 ms 78996 KB Output is correct
48 Correct 244 ms 81504 KB Output is correct
49 Correct 303 ms 84904 KB Output is correct
50 Correct 359 ms 88000 KB Output is correct
51 Correct 288 ms 90272 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14456 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 14588 KB Output is correct
5 Correct 16 ms 14704 KB Output is correct
6 Correct 17 ms 14860 KB Output is correct
7 Correct 16 ms 14868 KB Output is correct
8 Correct 15 ms 14904 KB Output is correct
9 Correct 15 ms 14940 KB Output is correct
10 Correct 16 ms 14960 KB Output is correct
11 Correct 16 ms 14960 KB Output is correct
12 Correct 16 ms 14960 KB Output is correct
13 Correct 15 ms 15020 KB Output is correct
14 Correct 15 ms 15020 KB Output is correct
15 Correct 18 ms 15108 KB Output is correct
16 Correct 16 ms 15268 KB Output is correct
17 Correct 16 ms 15268 KB Output is correct
18 Correct 16 ms 15336 KB Output is correct
19 Correct 17 ms 15336 KB Output is correct
20 Correct 15 ms 15336 KB Output is correct
21 Correct 16 ms 15336 KB Output is correct
22 Correct 17 ms 15336 KB Output is correct
23 Correct 15 ms 15376 KB Output is correct
24 Correct 16 ms 15376 KB Output is correct
25 Correct 16 ms 15376 KB Output is correct
26 Correct 16 ms 15376 KB Output is correct
27 Correct 15 ms 15376 KB Output is correct
28 Correct 17 ms 15376 KB Output is correct
29 Correct 15 ms 15376 KB Output is correct
30 Correct 15 ms 15376 KB Output is correct
31 Correct 1105 ms 38776 KB Output is correct
32 Correct 619 ms 38776 KB Output is correct
33 Correct 982 ms 40796 KB Output is correct
34 Correct 935 ms 43948 KB Output is correct
35 Correct 1133 ms 48624 KB Output is correct
36 Correct 1202 ms 51352 KB Output is correct
37 Correct 674 ms 51752 KB Output is correct
38 Correct 698 ms 54604 KB Output is correct
39 Correct 452 ms 57084 KB Output is correct
40 Correct 486 ms 59832 KB Output is correct
41 Correct 516 ms 62824 KB Output is correct
42 Correct 417 ms 66004 KB Output is correct
43 Correct 386 ms 67348 KB Output is correct
44 Correct 514 ms 71272 KB Output is correct
45 Correct 433 ms 73992 KB Output is correct
46 Correct 299 ms 76776 KB Output is correct
47 Correct 259 ms 78996 KB Output is correct
48 Correct 244 ms 81504 KB Output is correct
49 Correct 303 ms 84904 KB Output is correct
50 Correct 359 ms 88000 KB Output is correct
51 Correct 288 ms 90272 KB Output is correct
52 Correct 602 ms 167124 KB Output is correct
53 Correct 606 ms 167124 KB Output is correct
54 Correct 546 ms 167124 KB Output is correct
55 Correct 766 ms 167124 KB Output is correct
56 Correct 838 ms 167124 KB Output is correct
57 Correct 646 ms 167124 KB Output is correct
58 Correct 695 ms 167124 KB Output is correct
59 Correct 698 ms 167124 KB Output is correct
60 Correct 652 ms 167124 KB Output is correct
61 Correct 632 ms 167124 KB Output is correct
62 Correct 782 ms 167124 KB Output is correct
63 Correct 828 ms 167124 KB Output is correct
64 Correct 825 ms 167124 KB Output is correct
65 Correct 756 ms 167124 KB Output is correct
66 Correct 578 ms 167124 KB Output is correct
67 Correct 644 ms 167124 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14456 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 14588 KB Output is correct
5 Correct 16 ms 14704 KB Output is correct
6 Correct 17 ms 14860 KB Output is correct
7 Correct 16 ms 14868 KB Output is correct
8 Correct 15 ms 14904 KB Output is correct
9 Correct 15 ms 14940 KB Output is correct
10 Correct 16 ms 14960 KB Output is correct
11 Correct 16 ms 14960 KB Output is correct
12 Correct 16 ms 14960 KB Output is correct
13 Correct 15 ms 15020 KB Output is correct
14 Correct 15 ms 15020 KB Output is correct
15 Correct 18 ms 15108 KB Output is correct
16 Correct 16 ms 15268 KB Output is correct
17 Correct 16 ms 15268 KB Output is correct
18 Correct 16 ms 15336 KB Output is correct
19 Correct 17 ms 15336 KB Output is correct
20 Correct 15 ms 15336 KB Output is correct
21 Correct 16 ms 15336 KB Output is correct
22 Correct 17 ms 15336 KB Output is correct
23 Correct 15 ms 15376 KB Output is correct
24 Correct 16 ms 15376 KB Output is correct
25 Correct 16 ms 15376 KB Output is correct
26 Correct 16 ms 15376 KB Output is correct
27 Correct 15 ms 15376 KB Output is correct
28 Correct 17 ms 15376 KB Output is correct
29 Correct 15 ms 15376 KB Output is correct
30 Correct 15 ms 15376 KB Output is correct
31 Correct 1105 ms 38776 KB Output is correct
32 Correct 619 ms 38776 KB Output is correct
33 Correct 982 ms 40796 KB Output is correct
34 Correct 935 ms 43948 KB Output is correct
35 Correct 1133 ms 48624 KB Output is correct
36 Correct 1202 ms 51352 KB Output is correct
37 Correct 674 ms 51752 KB Output is correct
38 Correct 698 ms 54604 KB Output is correct
39 Correct 452 ms 57084 KB Output is correct
40 Correct 486 ms 59832 KB Output is correct
41 Correct 516 ms 62824 KB Output is correct
42 Correct 417 ms 66004 KB Output is correct
43 Correct 386 ms 67348 KB Output is correct
44 Correct 514 ms 71272 KB Output is correct
45 Correct 433 ms 73992 KB Output is correct
46 Correct 299 ms 76776 KB Output is correct
47 Correct 259 ms 78996 KB Output is correct
48 Correct 244 ms 81504 KB Output is correct
49 Correct 303 ms 84904 KB Output is correct
50 Correct 359 ms 88000 KB Output is correct
51 Correct 288 ms 90272 KB Output is correct
52 Correct 4714 ms 167124 KB Output is correct
53 Execution timed out 5013 ms 167124 KB Time limit exceeded
54 Halted 0 ms 0 KB -