oj.uz

Submission #219004

# Submission time Handle Problem Language Result Execution time Memory
219004 2020-04-03T11:17:40 Z VEGAnn New Home (APIO18_new_home) C++14
80 / 100
 2043 ms 122520 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 = 1;

    while (siz < sz(vc)) siz <<= 1;

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

    sort(nm, nm + q, cmp);

    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;

    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];

    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 10 ms 7424 KB Output is correct
3 Correct 11 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 13 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 11 ms 7528 KB Output is correct
12 Correct 10 ms 7552 KB Output is correct
13 Correct 15 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 13 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 12 ms 7552 KB Output is correct
20 Correct 12 ms 7528 KB Output is correct
21 Correct 10 ms 7552 KB Output is correct
22 Correct 12 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 9 ms 7552 KB Output is correct
27 Correct 11 ms 7552 KB Output is correct
28 Correct 10 ms 7552 KB Output is correct
29 Correct 9 ms 7552 KB Output is correct
30 Correct 9 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 10 ms 7424 KB Output is correct
3 Correct 11 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 13 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 11 ms 7528 KB Output is correct
12 Correct 10 ms 7552 KB Output is correct
13 Correct 15 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 13 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 12 ms 7552 KB Output is correct
20 Correct 12 ms 7528 KB Output is correct
21 Correct 10 ms 7552 KB Output is correct
22 Correct 12 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 9 ms 7552 KB Output is correct
27 Correct 11 ms 7552 KB Output is correct
28 Correct 10 ms 7552 KB Output is correct
29 Correct 9 ms 7552 KB Output is correct
30 Correct 9 ms 7552 KB Output is correct
31 Correct 261 ms 19240 KB Output is correct
32 Correct 185 ms 16616 KB Output is correct
33 Correct 270 ms 19044 KB Output is correct
34 Correct 243 ms 19180 KB Output is correct
35 Correct 264 ms 18548 KB Output is correct
36 Correct 277 ms 19044 KB Output is correct
37 Correct 230 ms 18916 KB Output is correct
38 Correct 245 ms 18916 KB Output is correct
39 Correct 201 ms 18912 KB Output is correct
40 Correct 208 ms 18936 KB Output is correct
41 Correct 196 ms 18596 KB Output is correct
42 Correct 189 ms 18792 KB Output is correct
43 Correct 131 ms 18028 KB Output is correct
44 Correct 193 ms 18912 KB Output is correct
45 Correct 179 ms 18676 KB Output is correct
46 Correct 173 ms 18596 KB Output is correct
47 Correct 160 ms 18400 KB Output is correct
48 Correct 150 ms 18532 KB Output is correct
49 Correct 162 ms 18660 KB Output is correct
50 Correct 174 ms 18928 KB Output is correct
51 Correct 159 ms 18664 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 760 ms 46920 KB Output is correct
2 Correct 972 ms 46788 KB Output is correct
3 Correct 887 ms 62524 KB Output is correct
4 Correct 803 ms 47676 KB Output is correct
5 Correct 1518 ms 60228 KB Output is correct
6 Correct 1065 ms 47612 KB Output is correct
7 Correct 752 ms 62524 KB Output is correct
8 Correct 702 ms 46664 KB Output is correct
9 Correct 725 ms 45504 KB Output is correct
10 Correct 834 ms 43788 KB Output is correct
11 Correct 740 ms 46148 KB Output is correct
12 Correct 749 ms 44156 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1110 ms 48832 KB Output is correct
2 Correct 931 ms 46580 KB Output is correct
3 Correct 1435 ms 62504 KB Output is correct
4 Correct 1184 ms 75140 KB Output is correct
5 Correct 1087 ms 61896 KB Output is correct
6 Correct 1090 ms 62268 KB Output is correct
7 Correct 2043 ms 75584 KB Output is correct
8 Correct 1517 ms 63044 KB Output is correct
9 Correct 1000 ms 75068 KB Output is correct
10 Correct 990 ms 62780 KB Output is correct
11 Correct 1036 ms 61240 KB Output is correct
12 Correct 1155 ms 63044 KB Output is correct
13 Correct 849 ms 61236 KB Output is correct
14 Correct 854 ms 61692 KB Output is correct
15 Correct 933 ms 61764 KB Output is correct
16 Correct 952 ms 59776 KB Output is correct
17 Correct 1016 ms 61900 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 10 ms 7424 KB Output is correct
3 Correct 11 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 13 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 11 ms 7528 KB Output is correct
12 Correct 10 ms 7552 KB Output is correct
13 Correct 15 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 13 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 12 ms 7552 KB Output is correct
20 Correct 12 ms 7528 KB Output is correct
21 Correct 10 ms 7552 KB Output is correct
22 Correct 12 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 9 ms 7552 KB Output is correct
27 Correct 11 ms 7552 KB Output is correct
28 Correct 10 ms 7552 KB Output is correct
29 Correct 9 ms 7552 KB Output is correct
30 Correct 9 ms 7552 KB Output is correct
31 Correct 261 ms 19240 KB Output is correct
32 Correct 185 ms 16616 KB Output is correct
33 Correct 270 ms 19044 KB Output is correct
34 Correct 243 ms 19180 KB Output is correct
35 Correct 264 ms 18548 KB Output is correct
36 Correct 277 ms 19044 KB Output is correct
37 Correct 230 ms 18916 KB Output is correct
38 Correct 245 ms 18916 KB Output is correct
39 Correct 201 ms 18912 KB Output is correct
40 Correct 208 ms 18936 KB Output is correct
41 Correct 196 ms 18596 KB Output is correct
42 Correct 189 ms 18792 KB Output is correct
43 Correct 131 ms 18028 KB Output is correct
44 Correct 193 ms 18912 KB Output is correct
45 Correct 179 ms 18676 KB Output is correct
46 Correct 173 ms 18596 KB Output is correct
47 Correct 160 ms 18400 KB Output is correct
48 Correct 150 ms 18532 KB Output is correct
49 Correct 162 ms 18660 KB Output is correct
50 Correct 174 ms 18928 KB Output is correct
51 Correct 159 ms 18664 KB Output is correct
52 Correct 235 ms 20064 KB Output is correct
53 Correct 234 ms 20068 KB Output is correct
54 Correct 232 ms 19308 KB Output is correct
55 Correct 204 ms 19300 KB Output is correct
56 Correct 209 ms 19684 KB Output is correct
57 Correct 194 ms 18764 KB Output is correct
58 Correct 206 ms 19300 KB Output is correct
59 Correct 212 ms 19560 KB Output is correct
60 Correct 197 ms 19044 KB Output is correct
61 Correct 138 ms 18788 KB Output is correct
62 Correct 231 ms 20188 KB Output is correct
63 Correct 219 ms 19428 KB Output is correct
64 Correct 218 ms 19048 KB Output is correct
65 Correct 215 ms 19136 KB Output is correct
66 Correct 195 ms 18916 KB Output is correct
67 Correct 150 ms 16624 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7424 KB Output is correct
2 Correct 10 ms 7424 KB Output is correct
3 Correct 11 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 13 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 11 ms 7528 KB Output is correct
12 Correct 10 ms 7552 KB Output is correct
13 Correct 15 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 13 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 12 ms 7552 KB Output is correct
20 Correct 12 ms 7528 KB Output is correct
21 Correct 10 ms 7552 KB Output is correct
22 Correct 12 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 9 ms 7552 KB Output is correct
27 Correct 11 ms 7552 KB Output is correct
28 Correct 10 ms 7552 KB Output is correct
29 Correct 9 ms 7552 KB Output is correct
30 Correct 9 ms 7552 KB Output is correct
31 Correct 261 ms 19240 KB Output is correct
32 Correct 185 ms 16616 KB Output is correct
33 Correct 270 ms 19044 KB Output is correct
34 Correct 243 ms 19180 KB Output is correct
35 Correct 264 ms 18548 KB Output is correct
36 Correct 277 ms 19044 KB Output is correct
37 Correct 230 ms 18916 KB Output is correct
38 Correct 245 ms 18916 KB Output is correct
39 Correct 201 ms 18912 KB Output is correct
40 Correct 208 ms 18936 KB Output is correct
41 Correct 196 ms 18596 KB Output is correct
42 Correct 189 ms 18792 KB Output is correct
43 Correct 131 ms 18028 KB Output is correct
44 Correct 193 ms 18912 KB Output is correct
45 Correct 179 ms 18676 KB Output is correct
46 Correct 173 ms 18596 KB Output is correct
47 Correct 160 ms 18400 KB Output is correct
48 Correct 150 ms 18532 KB Output is correct
49 Correct 162 ms 18660 KB Output is correct
50 Correct 174 ms 18928 KB Output is correct
51 Correct 159 ms 18664 KB Output is correct
52 Correct 760 ms 46920 KB Output is correct
53 Correct 972 ms 46788 KB Output is correct
54 Correct 887 ms 62524 KB Output is correct
55 Correct 803 ms 47676 KB Output is correct
56 Correct 1518 ms 60228 KB Output is correct
57 Correct 1065 ms 47612 KB Output is correct
58 Correct 752 ms 62524 KB Output is correct
59 Correct 702 ms 46664 KB Output is correct
60 Correct 725 ms 45504 KB Output is correct
61 Correct 834 ms 43788 KB Output is correct
62 Correct 740 ms 46148 KB Output is correct
63 Correct 749 ms 44156 KB Output is correct
64 Correct 1110 ms 48832 KB Output is correct
65 Correct 931 ms 46580 KB Output is correct
66 Correct 1435 ms 62504 KB Output is correct
67 Correct 1184 ms 75140 KB Output is correct
68 Correct 1087 ms 61896 KB Output is correct
69 Correct 1090 ms 62268 KB Output is correct
70 Correct 2043 ms 75584 KB Output is correct
71 Correct 1517 ms 63044 KB Output is correct
72 Correct 1000 ms 75068 KB Output is correct
73 Correct 990 ms 62780 KB Output is correct
74 Correct 1036 ms 61240 KB Output is correct
75 Correct 1155 ms 63044 KB Output is correct
76 Correct 849 ms 61236 KB Output is correct
77 Correct 854 ms 61692 KB Output is correct
78 Correct 933 ms 61764 KB Output is correct
79 Correct 952 ms 59776 KB Output is correct
80 Correct 1016 ms 61900 KB Output is correct
81 Correct 235 ms 20064 KB Output is correct
82 Correct 234 ms 20068 KB Output is correct
83 Correct 232 ms 19308 KB Output is correct
84 Correct 204 ms 19300 KB Output is correct
85 Correct 209 ms 19684 KB Output is correct
86 Correct 194 ms 18764 KB Output is correct
87 Correct 206 ms 19300 KB Output is correct
88 Correct 212 ms 19560 KB Output is correct
89 Correct 197 ms 19044 KB Output is correct
90 Correct 138 ms 18788 KB Output is correct
91 Correct 231 ms 20188 KB Output is correct
92 Correct 219 ms 19428 KB Output is correct
93 Correct 218 ms 19048 KB Output is correct
94 Correct 215 ms 19136 KB Output is correct
95 Correct 195 ms 18916 KB Output is correct
96 Correct 150 ms 16624 KB Output is correct
97 Runtime error 986 ms 122520 KB Execution killed with signal 11 (could be triggered by violating memory limits)
98 Halted 0 ms 0 KB -