oj.uz

Submission #952291

# Submission time Handle Problem Language Result Execution time Memory
952291 2024-03-23T13:45:22 Z Itamar New Home (APIO18_new_home) C++17
47 / 100
 5000 ms 635648 KB 
#include <iostream>
using namespace std;
#include <vector>
#define vi vector<int>
#define ll long long
#include <algorithm>
#include <set>
#include <string>
#include <bitset>
#include <cmath>
#include <math.h>
#define pll pair<ll,ll>
#define vll vector<ll>
#define pi pair<int,int>
#include <map>
#include <queue>
#define pd pair<double,double>

const int siz = 3e5 + 2;
multiset<int> col[siz];
int K;
struct node {
    int l, r, mid, maxi;
    bool p=0;
    multiset<int> s;
    node* sl = NULL;
    node *sr = NULL;
    node(int li, int ri) {
        l = li, r = ri, mid = (l + r) / 2, maxi = 0;
        if (l == 0) {
            maxi = 3e8 + 1;

            if (r == 0) {
                for (int i = 0; i < K; i++)s.insert(3e8 + 1);
            }
            else open();
        }
    }
    void open() {
        
        if (sl == NULL && (l < r)) {
            p = 1;
            sl = new node(l, mid);
            sr = new node(mid + 1, r);
        }
    }
    int query(int a, int b) {
        if (a > r || b < l || maxi==0)return 0;
        if (a <= l && b >= r)return maxi;
        if (p)return max(sl->query(a, b), sr->query(a, b));
        return 0;
    }
    void update(int v, int x, bool f) {
        if (l == r) {
            if (f)s.insert(v);
            else s.erase(s.find(v));
            if (s.size())maxi = *(--s.end());
            else maxi = 0;
        }
        else {
            if (sl == NULL)open();
            if (x <= mid) {
                sl->update(v, x, f);
            }
            else {
                sr->update(v, x, f);
            }
            maxi = max(sl->maxi, sr->maxi);
        }
    }
};
map<pi, int> sum;
int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int n, k, q;
    cin >> n >> k >> q;
    vector<vi> ev;
    K = k;
    for (int i = 0; i < n; i++) {
        int x, t, a, b;
        cin >> x >> t >> a >> b;
        x++;
        ev.push_back({ a,1,x,t });
        ev.push_back({b+1,0,x,t });
    }
    for (int i = 0; i < siz; i++) {
        col[i].insert(0);
        col[i].insert(3e8 + 1);
    }
    for (int i = 0; i < q; i++) {
        int l, y;
        cin >> l >> y;
        l++;
        ev.push_back({ y,l,i });
    }
    sort(ev.begin(), ev.end());
    node* seg = new node(0, 3e8 + 3);
    vi ans(q);
    for (vi v : ev) {
        if (v.size() == 3) {
            int l = v[1];
            int a = 0, b = 1e8 + 3;
            while (a < b) {
                int mid = (a + b) / 2;
                int ans = seg->query(0, max(l - mid - 1, 0));
                if (ans <= mid + l) {
                    b = mid;
                }
                else {
                    a = mid+1;
                }
            }
            if (b == 1e8 + 3)ans[v[2]] = -1;
            else ans[v[2]] = b;
        }
        else {
            int x = v[2], t = v[3];
            if (v[1])sum[{x, t}]++;
            else sum[{x,t}]--;
            if (v[1] == sum[{x,t}]) {
                auto it = col[t].lower_bound(x);
                auto it1 = it, it2 = it;
                it1--; if (v[1] == 0)it2++;
                if (v[1] == 0)col[t].erase(x);
                else col[t].insert(x);

                seg->update(*it2, x, v[1]);
                seg->update(*it2, *it1, !v[1]);
                seg->update(x, *it1, v[1]);
            }
        }
    }
    for (int i = 0; i < q; i++)cout << ans[i] << "\n";
}
/*
4 2 4
3 1 1 10
9 2 2 4
7 2 5 7
4 1 8 10
5 3
5 6
5 9
1 10
*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 42588 KB Output is correct
2 Correct 32 ms 42576 KB Output is correct
3 Correct 34 ms 42584 KB Output is correct
4 Correct 36 ms 42732 KB Output is correct
5 Correct 35 ms 42588 KB Output is correct
6 Correct 37 ms 44112 KB Output is correct
7 Correct 37 ms 44116 KB Output is correct
8 Correct 36 ms 44180 KB Output is correct
9 Correct 35 ms 44120 KB Output is correct
10 Correct 36 ms 44112 KB Output is correct
11 Correct 35 ms 44124 KB Output is correct
12 Correct 36 ms 44068 KB Output is correct
13 Correct 35 ms 43956 KB Output is correct
14 Correct 36 ms 44120 KB Output is correct
15 Correct 44 ms 43992 KB Output is correct
16 Correct 38 ms 44112 KB Output is correct
17 Correct 37 ms 44216 KB Output is correct
18 Correct 37 ms 44204 KB Output is correct
19 Correct 42 ms 44124 KB Output is correct
20 Correct 37 ms 44052 KB Output is correct
21 Correct 35 ms 42880 KB Output is correct
22 Correct 36 ms 44120 KB Output is correct
23 Correct 40 ms 44516 KB Output is correct
24 Correct 35 ms 44116 KB Output is correct
25 Correct 37 ms 44124 KB Output is correct
26 Correct 36 ms 44112 KB Output is correct
27 Correct 36 ms 42844 KB Output is correct
28 Correct 37 ms 44116 KB Output is correct
29 Correct 35 ms 44124 KB Output is correct
30 Correct 38 ms 43860 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 42588 KB Output is correct
2 Correct 32 ms 42576 KB Output is correct
3 Correct 34 ms 42584 KB Output is correct
4 Correct 36 ms 42732 KB Output is correct
5 Correct 35 ms 42588 KB Output is correct
6 Correct 37 ms 44112 KB Output is correct
7 Correct 37 ms 44116 KB Output is correct
8 Correct 36 ms 44180 KB Output is correct
9 Correct 35 ms 44120 KB Output is correct
10 Correct 36 ms 44112 KB Output is correct
11 Correct 35 ms 44124 KB Output is correct
12 Correct 36 ms 44068 KB Output is correct
13 Correct 35 ms 43956 KB Output is correct
14 Correct 36 ms 44120 KB Output is correct
15 Correct 44 ms 43992 KB Output is correct
16 Correct 38 ms 44112 KB Output is correct
17 Correct 37 ms 44216 KB Output is correct
18 Correct 37 ms 44204 KB Output is correct
19 Correct 42 ms 44124 KB Output is correct
20 Correct 37 ms 44052 KB Output is correct
21 Correct 35 ms 42880 KB Output is correct
22 Correct 36 ms 44120 KB Output is correct
23 Correct 40 ms 44516 KB Output is correct
24 Correct 35 ms 44116 KB Output is correct
25 Correct 37 ms 44124 KB Output is correct
26 Correct 36 ms 44112 KB Output is correct
27 Correct 36 ms 42844 KB Output is correct
28 Correct 37 ms 44116 KB Output is correct
29 Correct 35 ms 44124 KB Output is correct
30 Correct 38 ms 43860 KB Output is correct
31 Correct 1059 ms 188348 KB Output is correct
32 Correct 268 ms 54772 KB Output is correct
33 Correct 990 ms 184408 KB Output is correct
34 Correct 985 ms 183780 KB Output is correct
35 Correct 1068 ms 188612 KB Output is correct
36 Correct 1088 ms 188076 KB Output is correct
37 Correct 685 ms 183128 KB Output is correct
38 Correct 665 ms 181780 KB Output is correct
39 Correct 477 ms 181736 KB Output is correct
40 Correct 498 ms 182848 KB Output is correct
41 Correct 589 ms 181840 KB Output is correct
42 Correct 578 ms 182884 KB Output is correct
43 Correct 281 ms 55900 KB Output is correct
44 Correct 576 ms 181308 KB Output is correct
45 Correct 556 ms 181872 KB Output is correct
46 Correct 503 ms 182880 KB Output is correct
47 Correct 402 ms 176380 KB Output is correct
48 Correct 386 ms 176112 KB Output is correct
49 Correct 435 ms 178148 KB Output is correct
50 Correct 456 ms 181492 KB Output is correct
51 Correct 397 ms 177976 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3585 ms 635648 KB Output is correct
2 Execution timed out 5065 ms 630456 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 5056 ms 622304 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 42588 KB Output is correct
2 Correct 32 ms 42576 KB Output is correct
3 Correct 34 ms 42584 KB Output is correct
4 Correct 36 ms 42732 KB Output is correct
5 Correct 35 ms 42588 KB Output is correct
6 Correct 37 ms 44112 KB Output is correct
7 Correct 37 ms 44116 KB Output is correct
8 Correct 36 ms 44180 KB Output is correct
9 Correct 35 ms 44120 KB Output is correct
10 Correct 36 ms 44112 KB Output is correct
11 Correct 35 ms 44124 KB Output is correct
12 Correct 36 ms 44068 KB Output is correct
13 Correct 35 ms 43956 KB Output is correct
14 Correct 36 ms 44120 KB Output is correct
15 Correct 44 ms 43992 KB Output is correct
16 Correct 38 ms 44112 KB Output is correct
17 Correct 37 ms 44216 KB Output is correct
18 Correct 37 ms 44204 KB Output is correct
19 Correct 42 ms 44124 KB Output is correct
20 Correct 37 ms 44052 KB Output is correct
21 Correct 35 ms 42880 KB Output is correct
22 Correct 36 ms 44120 KB Output is correct
23 Correct 40 ms 44516 KB Output is correct
24 Correct 35 ms 44116 KB Output is correct
25 Correct 37 ms 44124 KB Output is correct
26 Correct 36 ms 44112 KB Output is correct
27 Correct 36 ms 42844 KB Output is correct
28 Correct 37 ms 44116 KB Output is correct
29 Correct 35 ms 44124 KB Output is correct
30 Correct 38 ms 43860 KB Output is correct
31 Correct 1059 ms 188348 KB Output is correct
32 Correct 268 ms 54772 KB Output is correct
33 Correct 990 ms 184408 KB Output is correct
34 Correct 985 ms 183780 KB Output is correct
35 Correct 1068 ms 188612 KB Output is correct
36 Correct 1088 ms 188076 KB Output is correct
37 Correct 685 ms 183128 KB Output is correct
38 Correct 665 ms 181780 KB Output is correct
39 Correct 477 ms 181736 KB Output is correct
40 Correct 498 ms 182848 KB Output is correct
41 Correct 589 ms 181840 KB Output is correct
42 Correct 578 ms 182884 KB Output is correct
43 Correct 281 ms 55900 KB Output is correct
44 Correct 576 ms 181308 KB Output is correct
45 Correct 556 ms 181872 KB Output is correct
46 Correct 503 ms 182880 KB Output is correct
47 Correct 402 ms 176380 KB Output is correct
48 Correct 386 ms 176112 KB Output is correct
49 Correct 435 ms 178148 KB Output is correct
50 Correct 456 ms 181492 KB Output is correct
51 Correct 397 ms 177976 KB Output is correct
52 Correct 780 ms 187488 KB Output is correct
53 Correct 808 ms 184364 KB Output is correct
54 Correct 775 ms 187636 KB Output is correct
55 Correct 635 ms 181980 KB Output is correct
56 Correct 647 ms 181652 KB Output is correct
57 Correct 621 ms 181128 KB Output is correct
58 Correct 646 ms 182096 KB Output is correct
59 Correct 651 ms 179964 KB Output is correct
60 Correct 619 ms 180872 KB Output is correct
61 Correct 420 ms 65700 KB Output is correct
62 Correct 818 ms 187676 KB Output is correct
63 Correct 819 ms 185532 KB Output is correct
64 Correct 796 ms 184400 KB Output is correct
65 Correct 801 ms 182300 KB Output is correct
66 Correct 631 ms 179700 KB Output is correct
67 Correct 426 ms 59372 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 42588 KB Output is correct
2 Correct 32 ms 42576 KB Output is correct
3 Correct 34 ms 42584 KB Output is correct
4 Correct 36 ms 42732 KB Output is correct
5 Correct 35 ms 42588 KB Output is correct
6 Correct 37 ms 44112 KB Output is correct
7 Correct 37 ms 44116 KB Output is correct
8 Correct 36 ms 44180 KB Output is correct
9 Correct 35 ms 44120 KB Output is correct
10 Correct 36 ms 44112 KB Output is correct
11 Correct 35 ms 44124 KB Output is correct
12 Correct 36 ms 44068 KB Output is correct
13 Correct 35 ms 43956 KB Output is correct
14 Correct 36 ms 44120 KB Output is correct
15 Correct 44 ms 43992 KB Output is correct
16 Correct 38 ms 44112 KB Output is correct
17 Correct 37 ms 44216 KB Output is correct
18 Correct 37 ms 44204 KB Output is correct
19 Correct 42 ms 44124 KB Output is correct
20 Correct 37 ms 44052 KB Output is correct
21 Correct 35 ms 42880 KB Output is correct
22 Correct 36 ms 44120 KB Output is correct
23 Correct 40 ms 44516 KB Output is correct
24 Correct 35 ms 44116 KB Output is correct
25 Correct 37 ms 44124 KB Output is correct
26 Correct 36 ms 44112 KB Output is correct
27 Correct 36 ms 42844 KB Output is correct
28 Correct 37 ms 44116 KB Output is correct
29 Correct 35 ms 44124 KB Output is correct
30 Correct 38 ms 43860 KB Output is correct
31 Correct 1059 ms 188348 KB Output is correct
32 Correct 268 ms 54772 KB Output is correct
33 Correct 990 ms 184408 KB Output is correct
34 Correct 985 ms 183780 KB Output is correct
35 Correct 1068 ms 188612 KB Output is correct
36 Correct 1088 ms 188076 KB Output is correct
37 Correct 685 ms 183128 KB Output is correct
38 Correct 665 ms 181780 KB Output is correct
39 Correct 477 ms 181736 KB Output is correct
40 Correct 498 ms 182848 KB Output is correct
41 Correct 589 ms 181840 KB Output is correct
42 Correct 578 ms 182884 KB Output is correct
43 Correct 281 ms 55900 KB Output is correct
44 Correct 576 ms 181308 KB Output is correct
45 Correct 556 ms 181872 KB Output is correct
46 Correct 503 ms 182880 KB Output is correct
47 Correct 402 ms 176380 KB Output is correct
48 Correct 386 ms 176112 KB Output is correct
49 Correct 435 ms 178148 KB Output is correct
50 Correct 456 ms 181492 KB Output is correct
51 Correct 397 ms 177976 KB Output is correct
52 Correct 3585 ms 635648 KB Output is correct
53 Execution timed out 5065 ms 630456 KB Time limit exceeded
54 Halted 0 ms 0 KB -