oj.uz

답안 #49704

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
49704 2018-06-02T09:04:51 Z gs13105 새 집 (APIO18_new_home) C++17
80 / 100
 5000 ms 445436 KB 
#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 MAXN = 300000;
const int MAXN2 = 524288;
const int MAXI = 1048576;
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;
};

vector<eve> arr;
map<int, pos> loc[MAXN2];

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, INF - y + 1, INF - x + 1 });
}

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

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

vector<que> inp;
bool chk[MAXN2];
int ans[MAXN2];

int main()
{
    n = _readInt();
    k = _readInt();
    q = _readInt();
    arr.reserve(2 * n);
    for(int i = 0; i < n; i++)
    {
        int x, t, a, b;
        x = _readInt();
        t = _readInt();
        a = _readInt();
        b = _readInt();
        arr.push_back({ a, x, t });
        arr.push_back({ b, x, -t });
    }
    inp.reserve(q);
    com.reserve(q);
    for(int i = 0; i < q; i++)
    {
        int l, y;
        l = _readInt();
        y = _readInt();
        inp.push_back({ 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.begin(), arr.end());
    int cur, cnt = 0;
    for(eve &e : arr)
    {
        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.begin(), inp.end());
    for(que &e : inp)
    {
        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++;
                }
            }
        }
        {
            int mx, p1, p2;
            mx = p1 = 0;
            p2 = mem[x].q.size() - 1;

            while(p2 >= 0)
            {
                int qx = INF - mem[x].q[p2].first + 1;
                if(p1 != mem[x].v[1].size() && mem[x].v[1][p1].first <= qx)
                {
                    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 - qx);
                    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:310:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(p2 < mem[x].q.size())
                   ~~~^~~~~~~~~~~~~~~~~
new_home.cpp:312: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:332:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 if(p1 != mem[x].v[1].size() && mem[x].v[1][p1].first <= qx)
                    ~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 98936 KB Output is correct
2 Correct 86 ms 98936 KB Output is correct
3 Correct 86 ms 98936 KB Output is correct
4 Correct 87 ms 99156 KB Output is correct
5 Correct 85 ms 99156 KB Output is correct
6 Correct 83 ms 99352 KB Output is correct
7 Correct 86 ms 99352 KB Output is correct
8 Correct 87 ms 99352 KB Output is correct
9 Correct 86 ms 99352 KB Output is correct
10 Correct 88 ms 99412 KB Output is correct
11 Correct 87 ms 99412 KB Output is correct
12 Correct 85 ms 99412 KB Output is correct
13 Correct 88 ms 99412 KB Output is correct
14 Correct 84 ms 99412 KB Output is correct
15 Correct 92 ms 99412 KB Output is correct
16 Correct 85 ms 99412 KB Output is correct
17 Correct 87 ms 99412 KB Output is correct
18 Correct 82 ms 99412 KB Output is correct
19 Correct 90 ms 99412 KB Output is correct
20 Correct 87 ms 99412 KB Output is correct
21 Correct 84 ms 99412 KB Output is correct
22 Correct 84 ms 99412 KB Output is correct
23 Correct 100 ms 99412 KB Output is correct
24 Correct 84 ms 99412 KB Output is correct
25 Correct 86 ms 99412 KB Output is correct
26 Correct 87 ms 99412 KB Output is correct
27 Correct 84 ms 99412 KB Output is correct
28 Correct 81 ms 99412 KB Output is correct
29 Correct 84 ms 99412 KB Output is correct
30 Correct 80 ms 99412 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 98936 KB Output is correct
2 Correct 86 ms 98936 KB Output is correct
3 Correct 86 ms 98936 KB Output is correct
4 Correct 87 ms 99156 KB Output is correct
5 Correct 85 ms 99156 KB Output is correct
6 Correct 83 ms 99352 KB Output is correct
7 Correct 86 ms 99352 KB Output is correct
8 Correct 87 ms 99352 KB Output is correct
9 Correct 86 ms 99352 KB Output is correct
10 Correct 88 ms 99412 KB Output is correct
11 Correct 87 ms 99412 KB Output is correct
12 Correct 85 ms 99412 KB Output is correct
13 Correct 88 ms 99412 KB Output is correct
14 Correct 84 ms 99412 KB Output is correct
15 Correct 92 ms 99412 KB Output is correct
16 Correct 85 ms 99412 KB Output is correct
17 Correct 87 ms 99412 KB Output is correct
18 Correct 82 ms 99412 KB Output is correct
19 Correct 90 ms 99412 KB Output is correct
20 Correct 87 ms 99412 KB Output is correct
21 Correct 84 ms 99412 KB Output is correct
22 Correct 84 ms 99412 KB Output is correct
23 Correct 100 ms 99412 KB Output is correct
24 Correct 84 ms 99412 KB Output is correct
25 Correct 86 ms 99412 KB Output is correct
26 Correct 87 ms 99412 KB Output is correct
27 Correct 84 ms 99412 KB Output is correct
28 Correct 81 ms 99412 KB Output is correct
29 Correct 84 ms 99412 KB Output is correct
30 Correct 80 ms 99412 KB Output is correct
31 Correct 1090 ms 169052 KB Output is correct
32 Correct 120 ms 169052 KB Output is correct
33 Correct 984 ms 169052 KB Output is correct
34 Correct 1020 ms 169052 KB Output is correct
35 Correct 1124 ms 169652 KB Output is correct
36 Correct 966 ms 169960 KB Output is correct
37 Correct 611 ms 169960 KB Output is correct
38 Correct 722 ms 169960 KB Output is correct
39 Correct 490 ms 169960 KB Output is correct
40 Correct 530 ms 169960 KB Output is correct
41 Correct 699 ms 169960 KB Output is correct
42 Correct 586 ms 169960 KB Output is correct
43 Correct 115 ms 169960 KB Output is correct
44 Correct 678 ms 169960 KB Output is correct
45 Correct 660 ms 169960 KB Output is correct
46 Correct 523 ms 169960 KB Output is correct
47 Correct 296 ms 169960 KB Output is correct
48 Correct 254 ms 169960 KB Output is correct
49 Correct 331 ms 169960 KB Output is correct
50 Correct 409 ms 169960 KB Output is correct
51 Correct 358 ms 169960 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1770 ms 264896 KB Output is correct
2 Correct 1931 ms 264896 KB Output is correct
3 Correct 1576 ms 264896 KB Output is correct
4 Correct 1895 ms 265236 KB Output is correct
5 Correct 2043 ms 277500 KB Output is correct
6 Correct 1820 ms 277500 KB Output is correct
7 Correct 1496 ms 277500 KB Output is correct
8 Correct 1892 ms 277500 KB Output is correct
9 Correct 2100 ms 284432 KB Output is correct
10 Correct 1781 ms 284432 KB Output is correct
11 Correct 1046 ms 284432 KB Output is correct
12 Correct 1316 ms 284432 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4805 ms 346928 KB Output is correct
2 Correct 251 ms 346928 KB Output is correct
3 Correct 4673 ms 368060 KB Output is correct
4 Correct 946 ms 368060 KB Output is correct
5 Correct 2234 ms 368060 KB Output is correct
6 Correct 2019 ms 368060 KB Output is correct
7 Correct 4326 ms 368060 KB Output is correct
8 Correct 4322 ms 368060 KB Output is correct
9 Correct 1656 ms 368060 KB Output is correct
10 Correct 3092 ms 368060 KB Output is correct
11 Correct 4377 ms 368060 KB Output is correct
12 Correct 4787 ms 368240 KB Output is correct
13 Correct 1820 ms 368240 KB Output is correct
14 Correct 1799 ms 368240 KB Output is correct
15 Correct 2274 ms 368240 KB Output is correct
16 Correct 2597 ms 368240 KB Output is correct
17 Correct 2533 ms 368240 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 98936 KB Output is correct
2 Correct 86 ms 98936 KB Output is correct
3 Correct 86 ms 98936 KB Output is correct
4 Correct 87 ms 99156 KB Output is correct
5 Correct 85 ms 99156 KB Output is correct
6 Correct 83 ms 99352 KB Output is correct
7 Correct 86 ms 99352 KB Output is correct
8 Correct 87 ms 99352 KB Output is correct
9 Correct 86 ms 99352 KB Output is correct
10 Correct 88 ms 99412 KB Output is correct
11 Correct 87 ms 99412 KB Output is correct
12 Correct 85 ms 99412 KB Output is correct
13 Correct 88 ms 99412 KB Output is correct
14 Correct 84 ms 99412 KB Output is correct
15 Correct 92 ms 99412 KB Output is correct
16 Correct 85 ms 99412 KB Output is correct
17 Correct 87 ms 99412 KB Output is correct
18 Correct 82 ms 99412 KB Output is correct
19 Correct 90 ms 99412 KB Output is correct
20 Correct 87 ms 99412 KB Output is correct
21 Correct 84 ms 99412 KB Output is correct
22 Correct 84 ms 99412 KB Output is correct
23 Correct 100 ms 99412 KB Output is correct
24 Correct 84 ms 99412 KB Output is correct
25 Correct 86 ms 99412 KB Output is correct
26 Correct 87 ms 99412 KB Output is correct
27 Correct 84 ms 99412 KB Output is correct
28 Correct 81 ms 99412 KB Output is correct
29 Correct 84 ms 99412 KB Output is correct
30 Correct 80 ms 99412 KB Output is correct
31 Correct 1090 ms 169052 KB Output is correct
32 Correct 120 ms 169052 KB Output is correct
33 Correct 984 ms 169052 KB Output is correct
34 Correct 1020 ms 169052 KB Output is correct
35 Correct 1124 ms 169652 KB Output is correct
36 Correct 966 ms 169960 KB Output is correct
37 Correct 611 ms 169960 KB Output is correct
38 Correct 722 ms 169960 KB Output is correct
39 Correct 490 ms 169960 KB Output is correct
40 Correct 530 ms 169960 KB Output is correct
41 Correct 699 ms 169960 KB Output is correct
42 Correct 586 ms 169960 KB Output is correct
43 Correct 115 ms 169960 KB Output is correct
44 Correct 678 ms 169960 KB Output is correct
45 Correct 660 ms 169960 KB Output is correct
46 Correct 523 ms 169960 KB Output is correct
47 Correct 296 ms 169960 KB Output is correct
48 Correct 254 ms 169960 KB Output is correct
49 Correct 331 ms 169960 KB Output is correct
50 Correct 409 ms 169960 KB Output is correct
51 Correct 358 ms 169960 KB Output is correct
52 Correct 291 ms 368240 KB Output is correct
53 Correct 291 ms 368240 KB Output is correct
54 Correct 586 ms 368240 KB Output is correct
55 Correct 693 ms 368240 KB Output is correct
56 Correct 532 ms 368240 KB Output is correct
57 Correct 667 ms 368240 KB Output is correct
58 Correct 574 ms 368240 KB Output is correct
59 Correct 438 ms 368240 KB Output is correct
60 Correct 549 ms 368240 KB Output is correct
61 Correct 116 ms 368240 KB Output is correct
62 Correct 320 ms 368240 KB Output is correct
63 Correct 471 ms 368240 KB Output is correct
64 Correct 597 ms 368240 KB Output is correct
65 Correct 647 ms 368240 KB Output is correct
66 Correct 626 ms 368240 KB Output is correct
67 Correct 168 ms 368240 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 98936 KB Output is correct
2 Correct 86 ms 98936 KB Output is correct
3 Correct 86 ms 98936 KB Output is correct
4 Correct 87 ms 99156 KB Output is correct
5 Correct 85 ms 99156 KB Output is correct
6 Correct 83 ms 99352 KB Output is correct
7 Correct 86 ms 99352 KB Output is correct
8 Correct 87 ms 99352 KB Output is correct
9 Correct 86 ms 99352 KB Output is correct
10 Correct 88 ms 99412 KB Output is correct
11 Correct 87 ms 99412 KB Output is correct
12 Correct 85 ms 99412 KB Output is correct
13 Correct 88 ms 99412 KB Output is correct
14 Correct 84 ms 99412 KB Output is correct
15 Correct 92 ms 99412 KB Output is correct
16 Correct 85 ms 99412 KB Output is correct
17 Correct 87 ms 99412 KB Output is correct
18 Correct 82 ms 99412 KB Output is correct
19 Correct 90 ms 99412 KB Output is correct
20 Correct 87 ms 99412 KB Output is correct
21 Correct 84 ms 99412 KB Output is correct
22 Correct 84 ms 99412 KB Output is correct
23 Correct 100 ms 99412 KB Output is correct
24 Correct 84 ms 99412 KB Output is correct
25 Correct 86 ms 99412 KB Output is correct
26 Correct 87 ms 99412 KB Output is correct
27 Correct 84 ms 99412 KB Output is correct
28 Correct 81 ms 99412 KB Output is correct
29 Correct 84 ms 99412 KB Output is correct
30 Correct 80 ms 99412 KB Output is correct
31 Correct 1090 ms 169052 KB Output is correct
32 Correct 120 ms 169052 KB Output is correct
33 Correct 984 ms 169052 KB Output is correct
34 Correct 1020 ms 169052 KB Output is correct
35 Correct 1124 ms 169652 KB Output is correct
36 Correct 966 ms 169960 KB Output is correct
37 Correct 611 ms 169960 KB Output is correct
38 Correct 722 ms 169960 KB Output is correct
39 Correct 490 ms 169960 KB Output is correct
40 Correct 530 ms 169960 KB Output is correct
41 Correct 699 ms 169960 KB Output is correct
42 Correct 586 ms 169960 KB Output is correct
43 Correct 115 ms 169960 KB Output is correct
44 Correct 678 ms 169960 KB Output is correct
45 Correct 660 ms 169960 KB Output is correct
46 Correct 523 ms 169960 KB Output is correct
47 Correct 296 ms 169960 KB Output is correct
48 Correct 254 ms 169960 KB Output is correct
49 Correct 331 ms 169960 KB Output is correct
50 Correct 409 ms 169960 KB Output is correct
51 Correct 358 ms 169960 KB Output is correct
52 Correct 1770 ms 264896 KB Output is correct
53 Correct 1931 ms 264896 KB Output is correct
54 Correct 1576 ms 264896 KB Output is correct
55 Correct 1895 ms 265236 KB Output is correct
56 Correct 2043 ms 277500 KB Output is correct
57 Correct 1820 ms 277500 KB Output is correct
58 Correct 1496 ms 277500 KB Output is correct
59 Correct 1892 ms 277500 KB Output is correct
60 Correct 2100 ms 284432 KB Output is correct
61 Correct 1781 ms 284432 KB Output is correct
62 Correct 1046 ms 284432 KB Output is correct
63 Correct 1316 ms 284432 KB Output is correct
64 Correct 4805 ms 346928 KB Output is correct
65 Correct 251 ms 346928 KB Output is correct
66 Correct 4673 ms 368060 KB Output is correct
67 Correct 946 ms 368060 KB Output is correct
68 Correct 2234 ms 368060 KB Output is correct
69 Correct 2019 ms 368060 KB Output is correct
70 Correct 4326 ms 368060 KB Output is correct
71 Correct 4322 ms 368060 KB Output is correct
72 Correct 1656 ms 368060 KB Output is correct
73 Correct 3092 ms 368060 KB Output is correct
74 Correct 4377 ms 368060 KB Output is correct
75 Correct 4787 ms 368240 KB Output is correct
76 Correct 1820 ms 368240 KB Output is correct
77 Correct 1799 ms 368240 KB Output is correct
78 Correct 2274 ms 368240 KB Output is correct
79 Correct 2597 ms 368240 KB Output is correct
80 Correct 2533 ms 368240 KB Output is correct
81 Correct 291 ms 368240 KB Output is correct
82 Correct 291 ms 368240 KB Output is correct
83 Correct 586 ms 368240 KB Output is correct
84 Correct 693 ms 368240 KB Output is correct
85 Correct 532 ms 368240 KB Output is correct
86 Correct 667 ms 368240 KB Output is correct
87 Correct 574 ms 368240 KB Output is correct
88 Correct 438 ms 368240 KB Output is correct
89 Correct 549 ms 368240 KB Output is correct
90 Correct 116 ms 368240 KB Output is correct
91 Correct 320 ms 368240 KB Output is correct
92 Correct 471 ms 368240 KB Output is correct
93 Correct 597 ms 368240 KB Output is correct
94 Correct 647 ms 368240 KB Output is correct
95 Correct 626 ms 368240 KB Output is correct
96 Correct 168 ms 368240 KB Output is correct
97 Correct 2005 ms 368240 KB Output is correct
98 Correct 304 ms 368240 KB Output is correct
99 Execution timed out 5028 ms 445436 KB Time limit exceeded
100 Halted 0 ms 0 KB -