oj.uz

Submission #77340

# Submission time Handle Problem Language Result Execution time Memory
77340 2018-09-25T20:14:12 Z 298iq New Home (APIO18_new_home) C++14
47 / 100
 5000 ms 83448 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
 
#include <bits/stdc++.h>
 
using namespace std;
 
const int MEM = 8e8;
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 = 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 14 ms 14460 KB Output is correct
3 Correct 14 ms 14520 KB Output is correct
4 Correct 16 ms 14584 KB Output is correct
5 Correct 15 ms 14712 KB Output is correct
6 Correct 17 ms 14712 KB Output is correct
7 Correct 16 ms 14712 KB Output is correct
8 Correct 16 ms 14740 KB Output is correct
9 Correct 16 ms 14756 KB Output is correct
10 Correct 17 ms 14756 KB Output is correct
11 Correct 15 ms 14896 KB Output is correct
12 Correct 16 ms 14896 KB Output is correct
13 Correct 16 ms 14896 KB Output is correct
14 Correct 16 ms 14896 KB Output is correct
15 Correct 16 ms 14896 KB Output is correct
16 Correct 17 ms 14896 KB Output is correct
17 Correct 16 ms 14896 KB Output is correct
18 Correct 18 ms 14896 KB Output is correct
19 Correct 16 ms 14896 KB Output is correct
20 Correct 16 ms 14896 KB Output is correct
21 Correct 16 ms 14928 KB Output is correct
22 Correct 16 ms 14928 KB Output is correct
23 Correct 16 ms 14928 KB Output is correct
24 Correct 16 ms 14928 KB Output is correct
25 Correct 16 ms 14928 KB Output is correct
26 Correct 15 ms 14928 KB Output is correct
27 Correct 17 ms 14928 KB Output is correct
28 Correct 16 ms 14928 KB Output is correct
29 Correct 15 ms 14928 KB Output is correct
30 Correct 17 ms 14928 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 14 ms 14460 KB Output is correct
3 Correct 14 ms 14520 KB Output is correct
4 Correct 16 ms 14584 KB Output is correct
5 Correct 15 ms 14712 KB Output is correct
6 Correct 17 ms 14712 KB Output is correct
7 Correct 16 ms 14712 KB Output is correct
8 Correct 16 ms 14740 KB Output is correct
9 Correct 16 ms 14756 KB Output is correct
10 Correct 17 ms 14756 KB Output is correct
11 Correct 15 ms 14896 KB Output is correct
12 Correct 16 ms 14896 KB Output is correct
13 Correct 16 ms 14896 KB Output is correct
14 Correct 16 ms 14896 KB Output is correct
15 Correct 16 ms 14896 KB Output is correct
16 Correct 17 ms 14896 KB Output is correct
17 Correct 16 ms 14896 KB Output is correct
18 Correct 18 ms 14896 KB Output is correct
19 Correct 16 ms 14896 KB Output is correct
20 Correct 16 ms 14896 KB Output is correct
21 Correct 16 ms 14928 KB Output is correct
22 Correct 16 ms 14928 KB Output is correct
23 Correct 16 ms 14928 KB Output is correct
24 Correct 16 ms 14928 KB Output is correct
25 Correct 16 ms 14928 KB Output is correct
26 Correct 15 ms 14928 KB Output is correct
27 Correct 17 ms 14928 KB Output is correct
28 Correct 16 ms 14928 KB Output is correct
29 Correct 15 ms 14928 KB Output is correct
30 Correct 17 ms 14928 KB Output is correct
31 Correct 998 ms 28260 KB Output is correct
32 Correct 557 ms 28260 KB Output is correct
33 Correct 891 ms 28260 KB Output is correct
34 Correct 865 ms 28260 KB Output is correct
35 Correct 1042 ms 28260 KB Output is correct
36 Correct 1128 ms 28260 KB Output is correct
37 Correct 642 ms 28260 KB Output is correct
38 Correct 624 ms 28260 KB Output is correct
39 Correct 416 ms 28260 KB Output is correct
40 Correct 487 ms 28260 KB Output is correct
41 Correct 471 ms 28260 KB Output is correct
42 Correct 500 ms 28260 KB Output is correct
43 Correct 318 ms 28260 KB Output is correct
44 Correct 493 ms 28336 KB Output is correct
45 Correct 390 ms 28336 KB Output is correct
46 Correct 297 ms 28336 KB Output is correct
47 Correct 232 ms 28336 KB Output is correct
48 Correct 227 ms 28336 KB Output is correct
49 Correct 283 ms 28336 KB Output is correct
50 Correct 331 ms 28336 KB Output is correct
51 Correct 276 ms 28336 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3830 ms 83448 KB Output is correct
2 Execution timed out 5101 ms 83448 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 5100 ms 83448 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 14 ms 14460 KB Output is correct
3 Correct 14 ms 14520 KB Output is correct
4 Correct 16 ms 14584 KB Output is correct
5 Correct 15 ms 14712 KB Output is correct
6 Correct 17 ms 14712 KB Output is correct
7 Correct 16 ms 14712 KB Output is correct
8 Correct 16 ms 14740 KB Output is correct
9 Correct 16 ms 14756 KB Output is correct
10 Correct 17 ms 14756 KB Output is correct
11 Correct 15 ms 14896 KB Output is correct
12 Correct 16 ms 14896 KB Output is correct
13 Correct 16 ms 14896 KB Output is correct
14 Correct 16 ms 14896 KB Output is correct
15 Correct 16 ms 14896 KB Output is correct
16 Correct 17 ms 14896 KB Output is correct
17 Correct 16 ms 14896 KB Output is correct
18 Correct 18 ms 14896 KB Output is correct
19 Correct 16 ms 14896 KB Output is correct
20 Correct 16 ms 14896 KB Output is correct
21 Correct 16 ms 14928 KB Output is correct
22 Correct 16 ms 14928 KB Output is correct
23 Correct 16 ms 14928 KB Output is correct
24 Correct 16 ms 14928 KB Output is correct
25 Correct 16 ms 14928 KB Output is correct
26 Correct 15 ms 14928 KB Output is correct
27 Correct 17 ms 14928 KB Output is correct
28 Correct 16 ms 14928 KB Output is correct
29 Correct 15 ms 14928 KB Output is correct
30 Correct 17 ms 14928 KB Output is correct
31 Correct 998 ms 28260 KB Output is correct
32 Correct 557 ms 28260 KB Output is correct
33 Correct 891 ms 28260 KB Output is correct
34 Correct 865 ms 28260 KB Output is correct
35 Correct 1042 ms 28260 KB Output is correct
36 Correct 1128 ms 28260 KB Output is correct
37 Correct 642 ms 28260 KB Output is correct
38 Correct 624 ms 28260 KB Output is correct
39 Correct 416 ms 28260 KB Output is correct
40 Correct 487 ms 28260 KB Output is correct
41 Correct 471 ms 28260 KB Output is correct
42 Correct 500 ms 28260 KB Output is correct
43 Correct 318 ms 28260 KB Output is correct
44 Correct 493 ms 28336 KB Output is correct
45 Correct 390 ms 28336 KB Output is correct
46 Correct 297 ms 28336 KB Output is correct
47 Correct 232 ms 28336 KB Output is correct
48 Correct 227 ms 28336 KB Output is correct
49 Correct 283 ms 28336 KB Output is correct
50 Correct 331 ms 28336 KB Output is correct
51 Correct 276 ms 28336 KB Output is correct
52 Correct 662 ms 83448 KB Output is correct
53 Correct 494 ms 83448 KB Output is correct
54 Correct 469 ms 83448 KB Output is correct
55 Correct 728 ms 83448 KB Output is correct
56 Correct 719 ms 83448 KB Output is correct
57 Correct 536 ms 83448 KB Output is correct
58 Correct 649 ms 83448 KB Output is correct
59 Correct 584 ms 83448 KB Output is correct
60 Correct 519 ms 83448 KB Output is correct
61 Correct 481 ms 83448 KB Output is correct
62 Correct 689 ms 83448 KB Output is correct
63 Correct 714 ms 83448 KB Output is correct
64 Correct 669 ms 83448 KB Output is correct
65 Correct 658 ms 83448 KB Output is correct
66 Correct 506 ms 83448 KB Output is correct
67 Correct 561 ms 83448 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 14 ms 14460 KB Output is correct
3 Correct 14 ms 14520 KB Output is correct
4 Correct 16 ms 14584 KB Output is correct
5 Correct 15 ms 14712 KB Output is correct
6 Correct 17 ms 14712 KB Output is correct
7 Correct 16 ms 14712 KB Output is correct
8 Correct 16 ms 14740 KB Output is correct
9 Correct 16 ms 14756 KB Output is correct
10 Correct 17 ms 14756 KB Output is correct
11 Correct 15 ms 14896 KB Output is correct
12 Correct 16 ms 14896 KB Output is correct
13 Correct 16 ms 14896 KB Output is correct
14 Correct 16 ms 14896 KB Output is correct
15 Correct 16 ms 14896 KB Output is correct
16 Correct 17 ms 14896 KB Output is correct
17 Correct 16 ms 14896 KB Output is correct
18 Correct 18 ms 14896 KB Output is correct
19 Correct 16 ms 14896 KB Output is correct
20 Correct 16 ms 14896 KB Output is correct
21 Correct 16 ms 14928 KB Output is correct
22 Correct 16 ms 14928 KB Output is correct
23 Correct 16 ms 14928 KB Output is correct
24 Correct 16 ms 14928 KB Output is correct
25 Correct 16 ms 14928 KB Output is correct
26 Correct 15 ms 14928 KB Output is correct
27 Correct 17 ms 14928 KB Output is correct
28 Correct 16 ms 14928 KB Output is correct
29 Correct 15 ms 14928 KB Output is correct
30 Correct 17 ms 14928 KB Output is correct
31 Correct 998 ms 28260 KB Output is correct
32 Correct 557 ms 28260 KB Output is correct
33 Correct 891 ms 28260 KB Output is correct
34 Correct 865 ms 28260 KB Output is correct
35 Correct 1042 ms 28260 KB Output is correct
36 Correct 1128 ms 28260 KB Output is correct
37 Correct 642 ms 28260 KB Output is correct
38 Correct 624 ms 28260 KB Output is correct
39 Correct 416 ms 28260 KB Output is correct
40 Correct 487 ms 28260 KB Output is correct
41 Correct 471 ms 28260 KB Output is correct
42 Correct 500 ms 28260 KB Output is correct
43 Correct 318 ms 28260 KB Output is correct
44 Correct 493 ms 28336 KB Output is correct
45 Correct 390 ms 28336 KB Output is correct
46 Correct 297 ms 28336 KB Output is correct
47 Correct 232 ms 28336 KB Output is correct
48 Correct 227 ms 28336 KB Output is correct
49 Correct 283 ms 28336 KB Output is correct
50 Correct 331 ms 28336 KB Output is correct
51 Correct 276 ms 28336 KB Output is correct
52 Correct 3830 ms 83448 KB Output is correct
53 Execution timed out 5101 ms 83448 KB Time limit exceeded
54 Halted 0 ms 0 KB -