답안 #49706 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
49706	2018-06-02T09:14:57 Z	gs13105	새 집 (APIO18_new_home)	C++17	57 / 100	5000 ms	368244 KB

new_home

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <iterator>

using namespace std;

const int INF = 100000000;

static char buf[33554432]; // size : any number geq than 1024 
static int fio_idx = 0;
static int bytes = 0;
static inline int _read() {
    if(!bytes || fio_idx == bytes) {
        bytes = (int)fread(buf, sizeof(buf[0]), sizeof(buf), stdin);
        fio_idx = 0;
    }
    return buf[fio_idx++];
}
static inline int _readInt() {
    int x = 0;
    int c = _read();
    while(c <= 32) c = _read();
    while(c > 32) x = 10 * x + (c - '0'), c = _read();
    return x;
}

int n, k, q, bp;

vector<int> com;
inline int idx(int x)
{
    return lower_bound(com.begin(), com.end(), x) - com.begin();
}

struct eve
{
    int t, x, d;
    bool operator <(const eve &e) const
    {
        return t != e.t ? t < e.t : d > e.d;
    }
};

struct pos
{
    int c, l, lt, r, rt;
};

eve arr[1048576];
map<int, pos> loc[524288];

struct seg
{
    int t1, t2, x, y;
    bool operator <(const seg &e) const
    {
        return x < e.x;
    }
};

vector<seg> sor[2];
inline void add_seg(int t1, int t2, int x, int y)
{
    if(t1 > t2 || x == y)
        return;

    int nt1 = bp + idx(t1);
    int nt2 = bp + idx(t2 + 1) - 1;
    if(nt1 > nt2)
        return;

    if(y < x)
        sor[0].push_back({ nt1, nt2, y, x });
    else
        sor[1].push_back({ nt1, nt2, -y, -x });
}

struct ent
{
    // v0 : dec, v1 : inc, q : query
    // v : { x, y }
    // q : { x, i }
    vector<pair<int, int>> v[2];
    vector<pair<int, int>> q;
};

ent mem[1048576];

struct que
{
    int l, y, i;
    bool operator <(const que &x) const
    {
        return l < x.l;
    }
};

que inp[524288];
bool chk[524288];
int ans[524288];

int main()
{
    n = _readInt();
    k = _readInt();
    q = _readInt();
    for(int i = 0; i < n; i++)
    {
        int x, t, a, b;
        x = _readInt();
        t = _readInt();
        a = _readInt();
        b = _readInt();
        arr[2 * i] = { a, x, t };
        arr[2 * i + 1] = { b, x, -t };
    }
    com.reserve(q);
    for(int i = 0; i < q; i++)
    {
        int l, y;
        l = _readInt();
        y = _readInt();
        inp[i] = {l, y, i };
        com.push_back(y);
    }

    sort(com.begin(), com.end());
    com.erase(unique(com.begin(), com.end()), com.end());

    int sz = com.size();
    for(bp = 1; bp < sz; bp *= 2);

    sort(arr, arr + 2 * n);
    int cur, cnt = 0;
    for(int u = 0; u < 2 * n; u++)
    {
        eve &e = arr[u];
        if(e.d > 0)
        {
            if(loc[e.d].size() == 0)
            {
                cnt++;
                if(cnt == k)
                    cur = e.t;
            }

            auto it = loc[e.d].find(e.x);
            if(it != loc[e.d].end())
            {
                it->second.c++;
                continue;
            }

            it = loc[e.d].insert({ e.x,{ 1, 1, e.t, INF, e.t } }).first;
            pos &p = it->second;

            if(it != loc[e.d].begin())
            {
                int x = prev(it)->first;
                pos &q = prev(it)->second;

                add_seg(q.rt, e.t - 1, x, q.r);
                q.rt = e.t;
                q.r = (x + e.x) / 2;

                p.l = (x + e.x + 1) / 2;
            }

            if(next(it) != loc[e.d].end())
            {
                int x = next(it)->first;
                pos &q = next(it)->second;

                add_seg(q.lt, e.t - 1, x, q.l);
                q.lt = e.t;
                q.l = (x + e.x + 1) / 2;

                p.r = (x + e.x) / 2;
            }
        }
        else
        {
            e.d = -e.d;

            auto it = loc[e.d].find(e.x);
            pos &p = it->second;

            if(p.c > 1)
            {
                p.c--;
                continue;
            }

            add_seg(p.lt, e.t, e.x, p.l);
            add_seg(p.rt, e.t, e.x, p.r);

            if(it != loc[e.d].begin())
            {
                int x = prev(it)->first;
                pos &q = prev(it)->second;

                add_seg(q.rt, e.t, x, q.r);
                q.rt = e.t + 1;
                if(next(it) != loc[e.d].end())
                {
                    int y = next(it)->first;
                    q.r = (x + y) / 2;
                }
                else
                    q.r = INF;
            }

            if(next(it) != loc[e.d].end())
            {
                int x = next(it)->first;
                pos &q = next(it)->second;

                add_seg(q.lt, e.t, x, q.l);
                q.lt = e.t + 1;
                if(it != loc[e.d].begin())
                {
                    int y = prev(it)->first;
                    q.l = (y + x + 1) / 2;
                }
                else
                    q.l = 1;
            }

            loc[e.d].erase(it);

            if(loc[e.d].size() == 0)
            {
                if(cnt == k)
                {
                    int t1 = idx(cur);
                    int t2 = idx(e.t + 1) - 1;
                    for(int i = t1; i <= t2; i++)
                        chk[i] = 1;
                }
                cnt--;
            }
        }
    }

    sort(inp, inp + q);
    for(int u = 0; u < q; u++)
    {
        que &e = inp[u];
        e.y = idx(e.y);
        if(chk[e.y])
        {
            e.y += bp;
            while(e.y)
            {
                mem[e.y].q.push_back({ e.l, e.i });
                e.y /= 2;
            }
        }
        else
            ans[e.i] = -1;
    }

    for(int i = 0; i < 2; i++)
    {
        sort(sor[i].begin(), sor[i].end());
        for(seg &e : sor[i])
        {
            while(e.t1 < e.t2)
            {
                if(e.t1 % 2 == 1)
                {
                    mem[e.t1].v[i].push_back({ e.x, e.y });
                    e.t1++;
                }
                if(e.t2 % 2 == 0)
                {
                    mem[e.t2].v[i].push_back({ e.x, e.y });
                    e.t2--;
                }
                e.t1 /= 2;
                e.t2 /= 2;
            }
            if(e.t1 == e.t2)
                mem[e.t1].v[i].push_back({ e.x, e.y });
        }
    }

    for(int x = 1; x <= bp + sz - 1; x++)
    {
        int mx, p1, p2;
        {
            mx = p1 = p2 = 0;
            while(p2 < mem[x].q.size())
            {
                if(p1 != mem[x].v[0].size() && mem[x].v[0][p1].first <= mem[x].q[p2].first)
                {
                    mx = max(mx, mem[x].v[0][p1].second);
                    p1++;
                }
                else
                {
                    ans[mem[x].q[p2].second] = max(ans[mem[x].q[p2].second], mx - mem[x].q[p2].first);
                    p2++;
                }
            }
        }
        {
            mx = -INF;
            p1 = 0;
            p2 = mem[x].q.size() - 1;
            while(p2 >= 0)
            {
                if(p1 != mem[x].v[1].size() && mem[x].v[1][p1].first <= -mem[x].q[p2].first)
                {
                    mx = max(mx, mem[x].v[1][p1].second);
                    p1++;
                }
                else
                {
                    ans[mem[x].q[p2].second] = max(ans[mem[x].q[p2].second], mx + mem[x].q[p2].first);
                    p2--;
                }
            }
        }
    }

    for(int i = 0; i < q; i++)
        printf("%d\n", ans[i]);
    return 0;
}

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:306:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(p2 < mem[x].q.size())
                   ~~~^~~~~~~~~~~~~~~~~
new_home.cpp:308:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(p1 != mem[x].v[0].size() && mem[x].v[0][p1].first <= mem[x].q[p2].first)
                    ~~~^~~~~~~~~~~~~~~~~~~~~
new_home.cpp:326:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(p1 != mem[x].v[1].size() && mem[x].v[1][p1].first <= -mem[x].q[p2].first)
                    ~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	80 ms	98808 KB	Output is correct
2	Correct	93 ms	98916 KB	Output is correct
3	Correct	102 ms	98916 KB	Output is correct
4	Correct	101 ms	98916 KB	Output is correct
5	Correct	89 ms	99048 KB	Output is correct
6	Correct	84 ms	99276 KB	Output is correct
7	Correct	84 ms	99276 KB	Output is correct
8	Correct	98 ms	99276 KB	Output is correct
9	Correct	98 ms	99296 KB	Output is correct
10	Correct	88 ms	99348 KB	Output is correct
11	Correct	98 ms	99348 KB	Output is correct
12	Correct	84 ms	99348 KB	Output is correct
13	Correct	93 ms	99348 KB	Output is correct
14	Correct	92 ms	99348 KB	Output is correct
15	Correct	99 ms	99348 KB	Output is correct
16	Correct	83 ms	99348 KB	Output is correct
17	Correct	99 ms	99348 KB	Output is correct
18	Correct	84 ms	99348 KB	Output is correct
19	Correct	92 ms	99348 KB	Output is correct
20	Correct	89 ms	99348 KB	Output is correct
21	Correct	88 ms	99348 KB	Output is correct
22	Correct	88 ms	99348 KB	Output is correct
23	Correct	90 ms	99348 KB	Output is correct
24	Correct	95 ms	99348 KB	Output is correct
25	Correct	84 ms	99348 KB	Output is correct
26	Correct	82 ms	99348 KB	Output is correct
27	Correct	87 ms	99348 KB	Output is correct
28	Correct	82 ms	99348 KB	Output is correct
29	Correct	84 ms	99348 KB	Output is correct
30	Correct	82 ms	99348 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	80 ms	98808 KB	Output is correct
2	Correct	93 ms	98916 KB	Output is correct
3	Correct	102 ms	98916 KB	Output is correct
4	Correct	101 ms	98916 KB	Output is correct
5	Correct	89 ms	99048 KB	Output is correct
6	Correct	84 ms	99276 KB	Output is correct
7	Correct	84 ms	99276 KB	Output is correct
8	Correct	98 ms	99276 KB	Output is correct
9	Correct	98 ms	99296 KB	Output is correct
10	Correct	88 ms	99348 KB	Output is correct
11	Correct	98 ms	99348 KB	Output is correct
12	Correct	84 ms	99348 KB	Output is correct
13	Correct	93 ms	99348 KB	Output is correct
14	Correct	92 ms	99348 KB	Output is correct
15	Correct	99 ms	99348 KB	Output is correct
16	Correct	83 ms	99348 KB	Output is correct
17	Correct	99 ms	99348 KB	Output is correct
18	Correct	84 ms	99348 KB	Output is correct
19	Correct	92 ms	99348 KB	Output is correct
20	Correct	89 ms	99348 KB	Output is correct
21	Correct	88 ms	99348 KB	Output is correct
22	Correct	88 ms	99348 KB	Output is correct
23	Correct	90 ms	99348 KB	Output is correct
24	Correct	95 ms	99348 KB	Output is correct
25	Correct	84 ms	99348 KB	Output is correct
26	Correct	82 ms	99348 KB	Output is correct
27	Correct	87 ms	99348 KB	Output is correct
28	Correct	82 ms	99348 KB	Output is correct
29	Correct	84 ms	99348 KB	Output is correct
30	Correct	82 ms	99348 KB	Output is correct
31	Correct	1002 ms	168884 KB	Output is correct
32	Correct	129 ms	168884 KB	Output is correct
33	Correct	972 ms	168884 KB	Output is correct
34	Correct	959 ms	168884 KB	Output is correct
35	Correct	866 ms	169712 KB	Output is correct
36	Correct	936 ms	169968 KB	Output is correct
37	Correct	661 ms	169968 KB	Output is correct
38	Correct	603 ms	169968 KB	Output is correct
39	Correct	481 ms	169968 KB	Output is correct
40	Correct	526 ms	169968 KB	Output is correct
41	Correct	664 ms	169968 KB	Output is correct
42	Correct	552 ms	169968 KB	Output is correct
43	Correct	114 ms	169968 KB	Output is correct
44	Correct	699 ms	169968 KB	Output is correct
45	Correct	617 ms	169968 KB	Output is correct
46	Correct	509 ms	169968 KB	Output is correct
47	Correct	339 ms	169968 KB	Output is correct
48	Correct	323 ms	169968 KB	Output is correct
49	Correct	373 ms	169968 KB	Output is correct
50	Correct	404 ms	169968 KB	Output is correct
51	Correct	419 ms	169968 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2013 ms	264992 KB	Output is correct
2	Correct	1852 ms	264992 KB	Output is correct
3	Correct	1791 ms	264992 KB	Output is correct
4	Correct	1719 ms	265560 KB	Output is correct
5	Correct	2189 ms	277612 KB	Output is correct
6	Correct	2049 ms	277612 KB	Output is correct
7	Correct	1543 ms	277612 KB	Output is correct
8	Correct	1699 ms	277612 KB	Output is correct
9	Correct	1742 ms	284500 KB	Output is correct
10	Correct	1948 ms	284500 KB	Output is correct
11	Correct	1074 ms	284500 KB	Output is correct
12	Correct	1326 ms	284500 KB	Output is correct

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4263 ms	346952 KB	Output is correct
2	Correct	280 ms	346952 KB	Output is correct
3	Correct	4578 ms	368244 KB	Output is correct
4	Correct	981 ms	368244 KB	Output is correct
5	Correct	2429 ms	368244 KB	Output is correct
6	Correct	2072 ms	368244 KB	Output is correct
7	Execution timed out	5049 ms	368244 KB	Time limit exceeded
8	Halted	0 ms	0 KB	-

Subtask #5
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	80 ms	98808 KB	Output is correct
2	Correct	93 ms	98916 KB	Output is correct
3	Correct	102 ms	98916 KB	Output is correct
4	Correct	101 ms	98916 KB	Output is correct
5	Correct	89 ms	99048 KB	Output is correct
6	Correct	84 ms	99276 KB	Output is correct
7	Correct	84 ms	99276 KB	Output is correct
8	Correct	98 ms	99276 KB	Output is correct
9	Correct	98 ms	99296 KB	Output is correct
10	Correct	88 ms	99348 KB	Output is correct
11	Correct	98 ms	99348 KB	Output is correct
12	Correct	84 ms	99348 KB	Output is correct
13	Correct	93 ms	99348 KB	Output is correct
14	Correct	92 ms	99348 KB	Output is correct
15	Correct	99 ms	99348 KB	Output is correct
16	Correct	83 ms	99348 KB	Output is correct
17	Correct	99 ms	99348 KB	Output is correct
18	Correct	84 ms	99348 KB	Output is correct
19	Correct	92 ms	99348 KB	Output is correct
20	Correct	89 ms	99348 KB	Output is correct
21	Correct	88 ms	99348 KB	Output is correct
22	Correct	88 ms	99348 KB	Output is correct
23	Correct	90 ms	99348 KB	Output is correct
24	Correct	95 ms	99348 KB	Output is correct
25	Correct	84 ms	99348 KB	Output is correct
26	Correct	82 ms	99348 KB	Output is correct
27	Correct	87 ms	99348 KB	Output is correct
28	Correct	82 ms	99348 KB	Output is correct
29	Correct	84 ms	99348 KB	Output is correct
30	Correct	82 ms	99348 KB	Output is correct
31	Correct	1002 ms	168884 KB	Output is correct
32	Correct	129 ms	168884 KB	Output is correct
33	Correct	972 ms	168884 KB	Output is correct
34	Correct	959 ms	168884 KB	Output is correct
35	Correct	866 ms	169712 KB	Output is correct
36	Correct	936 ms	169968 KB	Output is correct
37	Correct	661 ms	169968 KB	Output is correct
38	Correct	603 ms	169968 KB	Output is correct
39	Correct	481 ms	169968 KB	Output is correct
40	Correct	526 ms	169968 KB	Output is correct
41	Correct	664 ms	169968 KB	Output is correct
42	Correct	552 ms	169968 KB	Output is correct
43	Correct	114 ms	169968 KB	Output is correct
44	Correct	699 ms	169968 KB	Output is correct
45	Correct	617 ms	169968 KB	Output is correct
46	Correct	509 ms	169968 KB	Output is correct
47	Correct	339 ms	169968 KB	Output is correct
48	Correct	323 ms	169968 KB	Output is correct
49	Correct	373 ms	169968 KB	Output is correct
50	Correct	404 ms	169968 KB	Output is correct
51	Correct	419 ms	169968 KB	Output is correct
52	Correct	327 ms	368244 KB	Output is correct
53	Correct	309 ms	368244 KB	Output is correct
54	Correct	554 ms	368244 KB	Output is correct
55	Correct	527 ms	368244 KB	Output is correct
56	Correct	517 ms	368244 KB	Output is correct
57	Correct	640 ms	368244 KB	Output is correct
58	Correct	524 ms	368244 KB	Output is correct
59	Correct	462 ms	368244 KB	Output is correct
60	Correct	565 ms	368244 KB	Output is correct
61	Correct	136 ms	368244 KB	Output is correct
62	Correct	339 ms	368244 KB	Output is correct
63	Correct	524 ms	368244 KB	Output is correct
64	Correct	647 ms	368244 KB	Output is correct
65	Correct	816 ms	368244 KB	Output is correct
66	Correct	754 ms	368244 KB	Output is correct
67	Correct	174 ms	368244 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	80 ms	98808 KB	Output is correct
2	Correct	93 ms	98916 KB	Output is correct
3	Correct	102 ms	98916 KB	Output is correct
4	Correct	101 ms	98916 KB	Output is correct
5	Correct	89 ms	99048 KB	Output is correct
6	Correct	84 ms	99276 KB	Output is correct
7	Correct	84 ms	99276 KB	Output is correct
8	Correct	98 ms	99276 KB	Output is correct
9	Correct	98 ms	99296 KB	Output is correct
10	Correct	88 ms	99348 KB	Output is correct
11	Correct	98 ms	99348 KB	Output is correct
12	Correct	84 ms	99348 KB	Output is correct
13	Correct	93 ms	99348 KB	Output is correct
14	Correct	92 ms	99348 KB	Output is correct
15	Correct	99 ms	99348 KB	Output is correct
16	Correct	83 ms	99348 KB	Output is correct
17	Correct	99 ms	99348 KB	Output is correct
18	Correct	84 ms	99348 KB	Output is correct
19	Correct	92 ms	99348 KB	Output is correct
20	Correct	89 ms	99348 KB	Output is correct
21	Correct	88 ms	99348 KB	Output is correct
22	Correct	88 ms	99348 KB	Output is correct
23	Correct	90 ms	99348 KB	Output is correct
24	Correct	95 ms	99348 KB	Output is correct
25	Correct	84 ms	99348 KB	Output is correct
26	Correct	82 ms	99348 KB	Output is correct
27	Correct	87 ms	99348 KB	Output is correct
28	Correct	82 ms	99348 KB	Output is correct
29	Correct	84 ms	99348 KB	Output is correct
30	Correct	82 ms	99348 KB	Output is correct
31	Correct	1002 ms	168884 KB	Output is correct
32	Correct	129 ms	168884 KB	Output is correct
33	Correct	972 ms	168884 KB	Output is correct
34	Correct	959 ms	168884 KB	Output is correct
35	Correct	866 ms	169712 KB	Output is correct
36	Correct	936 ms	169968 KB	Output is correct
37	Correct	661 ms	169968 KB	Output is correct
38	Correct	603 ms	169968 KB	Output is correct
39	Correct	481 ms	169968 KB	Output is correct
40	Correct	526 ms	169968 KB	Output is correct
41	Correct	664 ms	169968 KB	Output is correct
42	Correct	552 ms	169968 KB	Output is correct
43	Correct	114 ms	169968 KB	Output is correct
44	Correct	699 ms	169968 KB	Output is correct
45	Correct	617 ms	169968 KB	Output is correct
46	Correct	509 ms	169968 KB	Output is correct
47	Correct	339 ms	169968 KB	Output is correct
48	Correct	323 ms	169968 KB	Output is correct
49	Correct	373 ms	169968 KB	Output is correct
50	Correct	404 ms	169968 KB	Output is correct
51	Correct	419 ms	169968 KB	Output is correct
52	Correct	2013 ms	264992 KB	Output is correct
53	Correct	1852 ms	264992 KB	Output is correct
54	Correct	1791 ms	264992 KB	Output is correct
55	Correct	1719 ms	265560 KB	Output is correct
56	Correct	2189 ms	277612 KB	Output is correct
57	Correct	2049 ms	277612 KB	Output is correct
58	Correct	1543 ms	277612 KB	Output is correct
59	Correct	1699 ms	277612 KB	Output is correct
60	Correct	1742 ms	284500 KB	Output is correct
61	Correct	1948 ms	284500 KB	Output is correct
62	Correct	1074 ms	284500 KB	Output is correct
63	Correct	1326 ms	284500 KB	Output is correct
64	Correct	4263 ms	346952 KB	Output is correct
65	Correct	280 ms	346952 KB	Output is correct
66	Correct	4578 ms	368244 KB	Output is correct
67	Correct	981 ms	368244 KB	Output is correct
68	Correct	2429 ms	368244 KB	Output is correct
69	Correct	2072 ms	368244 KB	Output is correct
70	Execution timed out	5049 ms	368244 KB	Time limit exceeded
71	Halted	0 ms	0 KB	-

답안 #49706

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 10.0 / 10.0

Subtask #4 0 / 23.0

Subtask #5 35.0 / 35.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
10.0 / 10.0

Subtask #4
0 / 23.0

Subtask #5
35.0 / 35.0

Subtask #6
0 / 20.0