oj.uz

Submission #219019

# Submission time Handle Problem Language Result Execution time Memory
219019 2020-04-03T11:26:56 Z VEGAnn New Home (APIO18_new_home) C++14
100 / 100
 2379 ms 68748 KB 
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define MP make_pair
#define PB push_back
#define pii pair<int,int>
#define ft first
#define sd second
#define sz(x) ((int)x.size())
using namespace std;
const int N = 300100;
const int oo = int(2e9) + 7;
const int big = int(1e8);
vector<array<int, 4> > qr;
vector<pii> events[N];
vector<int> vc;
int a[N], b[N], x[N], t[N], n, k, q, ans[N], l[N], y[N];
int mrk[N], st[4 * N], nm[N];
map<pii, int> mp;
map<pii, int>::iterator ite, pre, net;

bool cmp(int x, int y){
    return l[x] < l[y];
}

void calc(){
    fill(mrk, mrk + n, 0);
    mp.clear();
    qr.clear();
    mp[MP(x[n], n)] = 0;

    for (int i = 0; i < k; i++){
        mp[MP(x[n + 1], n + 1)] = sz(qr);
        qr.PB({0, 0, sz(vc) - 1, 2 * big});

        for (pii ev : events[i]) {
            int nm = ev.sd, tim = ev.ft;

            if (mrk[nm] == 1){
                ite = mp.find(MP(x[nm], nm));
                net = next(ite);

                qr[ite -> sd][2] = qr[net -> sd][2] = tim;

                mp.erase(ite);
                pre = prev(net);

                net -> sd = sz(qr);

                int i2 = net -> ft.sd;
                int i1 = pre -> ft.sd;
                int len = (x[i2] - x[i1]) / 2;

                qr.PB({x[i2] - len, tim, sz(vc) - 1, len});
            } else {
                mp[MP(x[nm], nm)] = 0;

                ite = mp.find(MP(x[nm], nm));
                pre = prev(ite);
                net = next(ite);

                qr[net -> sd][2] = tim;

                int i1 = pre -> ft.sd;
                int i2 = ite -> ft.sd;
                int i3 = net -> ft.sd;

                net -> sd = sz(qr);
                int len = (x[i3] - x[i2]) / 2;
                qr.PB({x[i3] - len, tim, sz(vc) - 1, len});

                ite -> sd = sz(qr);
                len = (x[i2] - x[i1]) / 2;
                qr.PB({x[i2] - len, tim, sz(vc) - 1, len});
            }

            mrk[nm]++;
        }
    }

    sort(all(qr));

    int siz = sz(vc);

    fill(st, st + 2 * siz, 0);

    int i1 = 0, i2 = 0;

    for (; i1 < q; i1++){
        int i = nm[i1];

        while (i2 < sz(qr) && qr[i2][0] <= l[i]){
            int lf = qr[i2][1] + siz, rt = qr[i2][2] + siz - 1;
            int vl = qr[i2][0] + qr[i2][3];

            while (lf <= rt){
                if (lf & 1)
                    st[lf] = max(st[lf], vl);

                if (!(rt & 1))
                    st[rt] = max(st[rt], vl);

                lf = (lf + 1) >> 1;
                rt = (rt - 1) >> 1;
            }

            i2++;
        }

        int loc = siz + y[i];

        for (; loc > 0; loc >>= 1)
            ans[i] = max(ans[i], st[loc] - l[i]);
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

//    freopen("in.txt","r",stdin);

    cin >> n >> k >> q;

    for (int i = 0; i < n; i++){
        cin >> x[i] >> t[i] >> a[i] >> b[i];
        t[i]--; b[i]++;
        vc.PB(a[i]);
        vc.PB(b[i]);
    }

    vc.PB(0);
    vc.PB(big + 1);
    sort(all(vc));
    vc.resize(unique(all(vc)) - vc.begin());

    for (int i = 0; i < n; i++){
        a[i] = lower_bound(all(vc), a[i]) - vc.begin();
        b[i] = lower_bound(all(vc), b[i]) - vc.begin();

        events[t[i]].PB(MP(a[i], i));
        events[t[i]].PB(MP(b[i], i));
    }

    for (int i = 0; i < k; i++){
        if (!sz(events[i])) {
            for (; q; q--) cout << "-1\n";
            return 0;
        }

        sort(all(events[i]));
    }

    for (int i = 0; i < q; i++){
        cin >> l[i] >> y[i];
        y[i] = upper_bound(all(vc), y[i]) - vc.begin() - 1;
        nm[i] = i;
    }

    x[n] = -2 * big;
    x[n + 1] = +2 * big;

    sort(nm, nm + q, cmp);

    calc();

    for (int i = 0; i < q; i++)
        l[i] = big - l[i];

    for (int i = 0; i < n; i++)
        x[i] = big - x[i];

    reverse(nm, nm + q);

    calc();

    for (int i = 0; i < q; i++)
        cout << (ans[i] >= big ? -1 : ans[i]) << '\n';

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7424 KB Output is correct
2 Correct 9 ms 7424 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 10 ms 7552 KB Output is correct
6 Correct 10 ms 7552 KB Output is correct
7 Correct 10 ms 7552 KB Output is correct
8 Correct 10 ms 7552 KB Output is correct
9 Correct 10 ms 7552 KB Output is correct
10 Correct 10 ms 7552 KB Output is correct
11 Correct 10 ms 7552 KB Output is correct
12 Correct 9 ms 7552 KB Output is correct
13 Correct 9 ms 7552 KB Output is correct
14 Correct 9 ms 7552 KB Output is correct
15 Correct 9 ms 7552 KB Output is correct
16 Correct 10 ms 7552 KB Output is correct
17 Correct 9 ms 7552 KB Output is correct
18 Correct 10 ms 7552 KB Output is correct
19 Correct 9 ms 7552 KB Output is correct
20 Correct 9 ms 7552 KB Output is correct
21 Correct 9 ms 7552 KB Output is correct
22 Correct 11 ms 7552 KB Output is correct
23 Correct 10 ms 7552 KB Output is correct
24 Correct 10 ms 7552 KB Output is correct
25 Correct 10 ms 7552 KB Output is correct
26 Correct 10 ms 7552 KB Output is correct
27 Correct 9 ms 7552 KB Output is correct
28 Correct 10 ms 7552 KB Output is correct
29 Correct 10 ms 7552 KB Output is correct
30 Correct 10 ms 7552 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7424 KB Output is correct
2 Correct 9 ms 7424 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 10 ms 7552 KB Output is correct
6 Correct 10 ms 7552 KB Output is correct
7 Correct 10 ms 7552 KB Output is correct
8 Correct 10 ms 7552 KB Output is correct
9 Correct 10 ms 7552 KB Output is correct
10 Correct 10 ms 7552 KB Output is correct
11 Correct 10 ms 7552 KB Output is correct
12 Correct 9 ms 7552 KB Output is correct
13 Correct 9 ms 7552 KB Output is correct
14 Correct 9 ms 7552 KB Output is correct
15 Correct 9 ms 7552 KB Output is correct
16 Correct 10 ms 7552 KB Output is correct
17 Correct 9 ms 7552 KB Output is correct
18 Correct 10 ms 7552 KB Output is correct
19 Correct 9 ms 7552 KB Output is correct
20 Correct 9 ms 7552 KB Output is correct
21 Correct 9 ms 7552 KB Output is correct
22 Correct 11 ms 7552 KB Output is correct
23 Correct 10 ms 7552 KB Output is correct
24 Correct 10 ms 7552 KB Output is correct
25 Correct 10 ms 7552 KB Output is correct
26 Correct 10 ms 7552 KB Output is correct
27 Correct 9 ms 7552 KB Output is correct
28 Correct 10 ms 7552 KB Output is correct
29 Correct 10 ms 7552 KB Output is correct
30 Correct 10 ms 7552 KB Output is correct
31 Correct 252 ms 18632 KB Output is correct
32 Correct 193 ms 16624 KB Output is correct
33 Correct 275 ms 18404 KB Output is correct
34 Correct 250 ms 18636 KB Output is correct
35 Correct 257 ms 18168 KB Output is correct
36 Correct 274 ms 18404 KB Output is correct
37 Correct 228 ms 18404 KB Output is correct
38 Correct 244 ms 18400 KB Output is correct
39 Correct 203 ms 18532 KB Output is correct
40 Correct 226 ms 18408 KB Output is correct
41 Correct 194 ms 17892 KB Output is correct
42 Correct 196 ms 18156 KB Output is correct
43 Correct 133 ms 18032 KB Output is correct
44 Correct 190 ms 18280 KB Output is correct
45 Correct 186 ms 18292 KB Output is correct
46 Correct 169 ms 18084 KB Output is correct
47 Correct 150 ms 17940 KB Output is correct
48 Correct 145 ms 18028 KB Output is correct
49 Correct 157 ms 18148 KB Output is correct
50 Correct 175 ms 18280 KB Output is correct
51 Correct 156 ms 18148 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 775 ms 50748 KB Output is correct
2 Correct 1008 ms 50500 KB Output is correct
3 Correct 922 ms 67132 KB Output is correct
4 Correct 813 ms 52784 KB Output is correct
5 Correct 1530 ms 65512 KB Output is correct
6 Correct 1122 ms 52816 KB Output is correct
7 Correct 737 ms 67900 KB Output is correct
8 Correct 708 ms 51912 KB Output is correct
9 Correct 720 ms 50680 KB Output is correct
10 Correct 834 ms 49036 KB Output is correct
11 Correct 755 ms 51368 KB Output is correct
12 Correct 758 ms 49408 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1140 ms 52596 KB Output is correct
2 Correct 927 ms 48704 KB Output is correct
3 Correct 1413 ms 54852 KB Output is correct
4 Correct 1216 ms 68072 KB Output is correct
5 Correct 1166 ms 52928 KB Output is correct
6 Correct 1189 ms 53728 KB Output is correct
7 Correct 2379 ms 68608 KB Output is correct
8 Correct 1766 ms 56240 KB Output is correct
9 Correct 1052 ms 68748 KB Output is correct
10 Correct 1075 ms 55108 KB Output is correct
11 Correct 1083 ms 53692 KB Output is correct
12 Correct 1179 ms 56192 KB Output is correct
13 Correct 829 ms 54688 KB Output is correct
14 Correct 861 ms 55236 KB Output is correct
15 Correct 933 ms 55124 KB Output is correct
16 Correct 957 ms 52732 KB Output is correct
17 Correct 981 ms 54884 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7424 KB Output is correct
2 Correct 9 ms 7424 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 10 ms 7552 KB Output is correct
6 Correct 10 ms 7552 KB Output is correct
7 Correct 10 ms 7552 KB Output is correct
8 Correct 10 ms 7552 KB Output is correct
9 Correct 10 ms 7552 KB Output is correct
10 Correct 10 ms 7552 KB Output is correct
11 Correct 10 ms 7552 KB Output is correct
12 Correct 9 ms 7552 KB Output is correct
13 Correct 9 ms 7552 KB Output is correct
14 Correct 9 ms 7552 KB Output is correct
15 Correct 9 ms 7552 KB Output is correct
16 Correct 10 ms 7552 KB Output is correct
17 Correct 9 ms 7552 KB Output is correct
18 Correct 10 ms 7552 KB Output is correct
19 Correct 9 ms 7552 KB Output is correct
20 Correct 9 ms 7552 KB Output is correct
21 Correct 9 ms 7552 KB Output is correct
22 Correct 11 ms 7552 KB Output is correct
23 Correct 10 ms 7552 KB Output is correct
24 Correct 10 ms 7552 KB Output is correct
25 Correct 10 ms 7552 KB Output is correct
26 Correct 10 ms 7552 KB Output is correct
27 Correct 9 ms 7552 KB Output is correct
28 Correct 10 ms 7552 KB Output is correct
29 Correct 10 ms 7552 KB Output is correct
30 Correct 10 ms 7552 KB Output is correct
31 Correct 252 ms 18632 KB Output is correct
32 Correct 193 ms 16624 KB Output is correct
33 Correct 275 ms 18404 KB Output is correct
34 Correct 250 ms 18636 KB Output is correct
35 Correct 257 ms 18168 KB Output is correct
36 Correct 274 ms 18404 KB Output is correct
37 Correct 228 ms 18404 KB Output is correct
38 Correct 244 ms 18400 KB Output is correct
39 Correct 203 ms 18532 KB Output is correct
40 Correct 226 ms 18408 KB Output is correct
41 Correct 194 ms 17892 KB Output is correct
42 Correct 196 ms 18156 KB Output is correct
43 Correct 133 ms 18032 KB Output is correct
44 Correct 190 ms 18280 KB Output is correct
45 Correct 186 ms 18292 KB Output is correct
46 Correct 169 ms 18084 KB Output is correct
47 Correct 150 ms 17940 KB Output is correct
48 Correct 145 ms 18028 KB Output is correct
49 Correct 157 ms 18148 KB Output is correct
50 Correct 175 ms 18280 KB Output is correct
51 Correct 156 ms 18148 KB Output is correct
52 Correct 233 ms 19932 KB Output is correct
53 Correct 252 ms 20192 KB Output is correct
54 Correct 232 ms 18660 KB Output is correct
55 Correct 200 ms 18780 KB Output is correct
56 Correct 213 ms 19372 KB Output is correct
57 Correct 199 ms 18188 KB Output is correct
58 Correct 206 ms 18796 KB Output is correct
59 Correct 211 ms 19040 KB Output is correct
60 Correct 198 ms 18412 KB Output is correct
61 Correct 138 ms 18792 KB Output is correct
62 Correct 228 ms 19616 KB Output is correct
63 Correct 225 ms 18788 KB Output is correct
64 Correct 219 ms 18536 KB Output is correct
65 Correct 211 ms 18408 KB Output is correct
66 Correct 202 ms 18400 KB Output is correct
67 Correct 151 ms 16620 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7424 KB Output is correct
2 Correct 9 ms 7424 KB Output is correct
3 Correct 9 ms 7424 KB Output is correct
4 Correct 9 ms 7424 KB Output is correct
5 Correct 10 ms 7552 KB Output is correct
6 Correct 10 ms 7552 KB Output is correct
7 Correct 10 ms 7552 KB Output is correct
8 Correct 10 ms 7552 KB Output is correct
9 Correct 10 ms 7552 KB Output is correct
10 Correct 10 ms 7552 KB Output is correct
11 Correct 10 ms 7552 KB Output is correct
12 Correct 9 ms 7552 KB Output is correct
13 Correct 9 ms 7552 KB Output is correct
14 Correct 9 ms 7552 KB Output is correct
15 Correct 9 ms 7552 KB Output is correct
16 Correct 10 ms 7552 KB Output is correct
17 Correct 9 ms 7552 KB Output is correct
18 Correct 10 ms 7552 KB Output is correct
19 Correct 9 ms 7552 KB Output is correct
20 Correct 9 ms 7552 KB Output is correct
21 Correct 9 ms 7552 KB Output is correct
22 Correct 11 ms 7552 KB Output is correct
23 Correct 10 ms 7552 KB Output is correct
24 Correct 10 ms 7552 KB Output is correct
25 Correct 10 ms 7552 KB Output is correct
26 Correct 10 ms 7552 KB Output is correct
27 Correct 9 ms 7552 KB Output is correct
28 Correct 10 ms 7552 KB Output is correct
29 Correct 10 ms 7552 KB Output is correct
30 Correct 10 ms 7552 KB Output is correct
31 Correct 252 ms 18632 KB Output is correct
32 Correct 193 ms 16624 KB Output is correct
33 Correct 275 ms 18404 KB Output is correct
34 Correct 250 ms 18636 KB Output is correct
35 Correct 257 ms 18168 KB Output is correct
36 Correct 274 ms 18404 KB Output is correct
37 Correct 228 ms 18404 KB Output is correct
38 Correct 244 ms 18400 KB Output is correct
39 Correct 203 ms 18532 KB Output is correct
40 Correct 226 ms 18408 KB Output is correct
41 Correct 194 ms 17892 KB Output is correct
42 Correct 196 ms 18156 KB Output is correct
43 Correct 133 ms 18032 KB Output is correct
44 Correct 190 ms 18280 KB Output is correct
45 Correct 186 ms 18292 KB Output is correct
46 Correct 169 ms 18084 KB Output is correct
47 Correct 150 ms 17940 KB Output is correct
48 Correct 145 ms 18028 KB Output is correct
49 Correct 157 ms 18148 KB Output is correct
50 Correct 175 ms 18280 KB Output is correct
51 Correct 156 ms 18148 KB Output is correct
52 Correct 775 ms 50748 KB Output is correct
53 Correct 1008 ms 50500 KB Output is correct
54 Correct 922 ms 67132 KB Output is correct
55 Correct 813 ms 52784 KB Output is correct
56 Correct 1530 ms 65512 KB Output is correct
57 Correct 1122 ms 52816 KB Output is correct
58 Correct 737 ms 67900 KB Output is correct
59 Correct 708 ms 51912 KB Output is correct
60 Correct 720 ms 50680 KB Output is correct
61 Correct 834 ms 49036 KB Output is correct
62 Correct 755 ms 51368 KB Output is correct
63 Correct 758 ms 49408 KB Output is correct
64 Correct 1140 ms 52596 KB Output is correct
65 Correct 927 ms 48704 KB Output is correct
66 Correct 1413 ms 54852 KB Output is correct
67 Correct 1216 ms 68072 KB Output is correct
68 Correct 1166 ms 52928 KB Output is correct
69 Correct 1189 ms 53728 KB Output is correct
70 Correct 2379 ms 68608 KB Output is correct
71 Correct 1766 ms 56240 KB Output is correct
72 Correct 1052 ms 68748 KB Output is correct
73 Correct 1075 ms 55108 KB Output is correct
74 Correct 1083 ms 53692 KB Output is correct
75 Correct 1179 ms 56192 KB Output is correct
76 Correct 829 ms 54688 KB Output is correct
77 Correct 861 ms 55236 KB Output is correct
78 Correct 933 ms 55124 KB Output is correct
79 Correct 957 ms 52732 KB Output is correct
80 Correct 981 ms 54884 KB Output is correct
81 Correct 233 ms 19932 KB Output is correct
82 Correct 252 ms 20192 KB Output is correct
83 Correct 232 ms 18660 KB Output is correct
84 Correct 200 ms 18780 KB Output is correct
85 Correct 213 ms 19372 KB Output is correct
86 Correct 199 ms 18188 KB Output is correct
87 Correct 206 ms 18796 KB Output is correct
88 Correct 211 ms 19040 KB Output is correct
89 Correct 198 ms 18412 KB Output is correct
90 Correct 138 ms 18792 KB Output is correct
91 Correct 228 ms 19616 KB Output is correct
92 Correct 225 ms 18788 KB Output is correct
93 Correct 219 ms 18536 KB Output is correct
94 Correct 211 ms 18408 KB Output is correct
95 Correct 202 ms 18400 KB Output is correct
96 Correct 151 ms 16620 KB Output is correct
97 Correct 1479 ms 66672 KB Output is correct
98 Correct 948 ms 48216 KB Output is correct
99 Correct 1602 ms 55744 KB Output is correct
100 Correct 1459 ms 66716 KB Output is correct
101 Correct 1369 ms 54896 KB Output is correct
102 Correct 1686 ms 56316 KB Output is correct
103 Correct 1277 ms 55748 KB Output is correct
104 Correct 1396 ms 56560 KB Output is correct
105 Correct 1138 ms 55860 KB Output is correct
106 Correct 1182 ms 56528 KB Output is correct
107 Correct 1118 ms 55712 KB Output is correct
108 Correct 1139 ms 65532 KB Output is correct
109 Correct 1080 ms 55516 KB Output is correct
110 Correct 1131 ms 56004 KB Output is correct
111 Correct 1170 ms 65728 KB Output is correct
112 Correct 1093 ms 54340 KB Output is correct
113 Correct 690 ms 67288 KB Output is correct
114 Correct 1324 ms 66988 KB Output is correct
115 Correct 1324 ms 65724 KB Output is correct
116 Correct 1304 ms 55820 KB Output is correct
117 Correct 1248 ms 55340 KB Output is correct
118 Correct 1133 ms 55428 KB Output is correct
119 Correct 749 ms 45120 KB Output is correct
120 Correct 691 ms 54528 KB Output is correct
121 Correct 753 ms 55108 KB Output is correct
122 Correct 727 ms 54980 KB Output is correct
123 Correct 807 ms 55364 KB Output is correct
124 Correct 900 ms 53100 KB Output is correct
125 Correct 810 ms 56260 KB Output is correct
126 Correct 956 ms 55092 KB Output is correct