oj.uz

답안 #49699

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
49699 2018-06-02T08:47:32 Z gs13105 새 집 (APIO18_new_home) C++17
80 / 100
 5000 ms 445864 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 MAXI = 1048576;
const int INF = 100000000;

static char buf[17100100]; // 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[MAXN + 1];

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

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

vector<que> inp;
bool chk[MAXN + 1];
int ans[MAXN + 1];

int main()
{
    //freopen("in", "r", stdin);
    //freopen("out", "w", stdout);

    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:312:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(p2 < mem[x].q.size())
                   ~~~^~~~~~~~~~~~~~~~~
new_home.cpp:314: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:334: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 76 ms 88312 KB Output is correct
2 Correct 75 ms 88312 KB Output is correct
3 Correct 73 ms 88368 KB Output is correct
4 Correct 74 ms 88532 KB Output is correct
5 Correct 75 ms 88592 KB Output is correct
6 Correct 73 ms 88736 KB Output is correct
7 Correct 74 ms 88736 KB Output is correct
8 Correct 79 ms 88868 KB Output is correct
9 Correct 84 ms 88868 KB Output is correct
10 Correct 213 ms 88896 KB Output is correct
11 Correct 74 ms 88896 KB Output is correct
12 Correct 81 ms 88896 KB Output is correct
13 Correct 71 ms 88896 KB Output is correct
14 Correct 72 ms 88896 KB Output is correct
15 Correct 74 ms 88896 KB Output is correct
16 Correct 72 ms 88896 KB Output is correct
17 Correct 76 ms 88896 KB Output is correct
18 Correct 75 ms 88896 KB Output is correct
19 Correct 79 ms 88896 KB Output is correct
20 Correct 78 ms 88896 KB Output is correct
21 Correct 73 ms 88896 KB Output is correct
22 Correct 77 ms 88896 KB Output is correct
23 Correct 78 ms 88896 KB Output is correct
24 Correct 79 ms 88896 KB Output is correct
25 Correct 73 ms 88896 KB Output is correct
26 Correct 77 ms 88896 KB Output is correct
27 Correct 77 ms 88896 KB Output is correct
28 Correct 83 ms 88896 KB Output is correct
29 Correct 77 ms 88896 KB Output is correct
30 Correct 75 ms 88896 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 88312 KB Output is correct
2 Correct 75 ms 88312 KB Output is correct
3 Correct 73 ms 88368 KB Output is correct
4 Correct 74 ms 88532 KB Output is correct
5 Correct 75 ms 88592 KB Output is correct
6 Correct 73 ms 88736 KB Output is correct
7 Correct 74 ms 88736 KB Output is correct
8 Correct 79 ms 88868 KB Output is correct
9 Correct 84 ms 88868 KB Output is correct
10 Correct 213 ms 88896 KB Output is correct
11 Correct 74 ms 88896 KB Output is correct
12 Correct 81 ms 88896 KB Output is correct
13 Correct 71 ms 88896 KB Output is correct
14 Correct 72 ms 88896 KB Output is correct
15 Correct 74 ms 88896 KB Output is correct
16 Correct 72 ms 88896 KB Output is correct
17 Correct 76 ms 88896 KB Output is correct
18 Correct 75 ms 88896 KB Output is correct
19 Correct 79 ms 88896 KB Output is correct
20 Correct 78 ms 88896 KB Output is correct
21 Correct 73 ms 88896 KB Output is correct
22 Correct 77 ms 88896 KB Output is correct
23 Correct 78 ms 88896 KB Output is correct
24 Correct 79 ms 88896 KB Output is correct
25 Correct 73 ms 88896 KB Output is correct
26 Correct 77 ms 88896 KB Output is correct
27 Correct 77 ms 88896 KB Output is correct
28 Correct 83 ms 88896 KB Output is correct
29 Correct 77 ms 88896 KB Output is correct
30 Correct 75 ms 88896 KB Output is correct
31 Correct 814 ms 158428 KB Output is correct
32 Correct 109 ms 158428 KB Output is correct
33 Correct 829 ms 158428 KB Output is correct
34 Correct 899 ms 158428 KB Output is correct
35 Correct 1040 ms 159060 KB Output is correct
36 Correct 1043 ms 159200 KB Output is correct
37 Correct 673 ms 159200 KB Output is correct
38 Correct 653 ms 159200 KB Output is correct
39 Correct 466 ms 159200 KB Output is correct
40 Correct 516 ms 159200 KB Output is correct
41 Correct 665 ms 159200 KB Output is correct
42 Correct 522 ms 159200 KB Output is correct
43 Correct 117 ms 159200 KB Output is correct
44 Correct 675 ms 159200 KB Output is correct
45 Correct 596 ms 159200 KB Output is correct
46 Correct 444 ms 159200 KB Output is correct
47 Correct 291 ms 159200 KB Output is correct
48 Correct 268 ms 159200 KB Output is correct
49 Correct 348 ms 159200 KB Output is correct
50 Correct 369 ms 159200 KB Output is correct
51 Correct 356 ms 159200 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1794 ms 254600 KB Output is correct
2 Correct 2021 ms 254600 KB Output is correct
3 Correct 1850 ms 254600 KB Output is correct
4 Correct 1740 ms 254712 KB Output is correct
5 Correct 2260 ms 267028 KB Output is correct
6 Correct 1937 ms 267028 KB Output is correct
7 Correct 1776 ms 267028 KB Output is correct
8 Correct 2017 ms 267028 KB Output is correct
9 Correct 1829 ms 274056 KB Output is correct
10 Correct 1770 ms 274056 KB Output is correct
11 Correct 1183 ms 274056 KB Output is correct
12 Correct 1303 ms 274056 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4835 ms 336336 KB Output is correct
2 Correct 351 ms 336336 KB Output is correct
3 Correct 4466 ms 357520 KB Output is correct
4 Correct 1044 ms 357520 KB Output is correct
5 Correct 2426 ms 357520 KB Output is correct
6 Correct 1967 ms 357520 KB Output is correct
7 Correct 4586 ms 357520 KB Output is correct
8 Correct 4528 ms 357520 KB Output is correct
9 Correct 1578 ms 357520 KB Output is correct
10 Correct 3109 ms 357520 KB Output is correct
11 Correct 4472 ms 357520 KB Output is correct
12 Correct 4358 ms 357612 KB Output is correct
13 Correct 1740 ms 357612 KB Output is correct
14 Correct 1674 ms 357612 KB Output is correct
15 Correct 2351 ms 357612 KB Output is correct
16 Correct 2385 ms 357612 KB Output is correct
17 Correct 2235 ms 357612 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 88312 KB Output is correct
2 Correct 75 ms 88312 KB Output is correct
3 Correct 73 ms 88368 KB Output is correct
4 Correct 74 ms 88532 KB Output is correct
5 Correct 75 ms 88592 KB Output is correct
6 Correct 73 ms 88736 KB Output is correct
7 Correct 74 ms 88736 KB Output is correct
8 Correct 79 ms 88868 KB Output is correct
9 Correct 84 ms 88868 KB Output is correct
10 Correct 213 ms 88896 KB Output is correct
11 Correct 74 ms 88896 KB Output is correct
12 Correct 81 ms 88896 KB Output is correct
13 Correct 71 ms 88896 KB Output is correct
14 Correct 72 ms 88896 KB Output is correct
15 Correct 74 ms 88896 KB Output is correct
16 Correct 72 ms 88896 KB Output is correct
17 Correct 76 ms 88896 KB Output is correct
18 Correct 75 ms 88896 KB Output is correct
19 Correct 79 ms 88896 KB Output is correct
20 Correct 78 ms 88896 KB Output is correct
21 Correct 73 ms 88896 KB Output is correct
22 Correct 77 ms 88896 KB Output is correct
23 Correct 78 ms 88896 KB Output is correct
24 Correct 79 ms 88896 KB Output is correct
25 Correct 73 ms 88896 KB Output is correct
26 Correct 77 ms 88896 KB Output is correct
27 Correct 77 ms 88896 KB Output is correct
28 Correct 83 ms 88896 KB Output is correct
29 Correct 77 ms 88896 KB Output is correct
30 Correct 75 ms 88896 KB Output is correct
31 Correct 814 ms 158428 KB Output is correct
32 Correct 109 ms 158428 KB Output is correct
33 Correct 829 ms 158428 KB Output is correct
34 Correct 899 ms 158428 KB Output is correct
35 Correct 1040 ms 159060 KB Output is correct
36 Correct 1043 ms 159200 KB Output is correct
37 Correct 673 ms 159200 KB Output is correct
38 Correct 653 ms 159200 KB Output is correct
39 Correct 466 ms 159200 KB Output is correct
40 Correct 516 ms 159200 KB Output is correct
41 Correct 665 ms 159200 KB Output is correct
42 Correct 522 ms 159200 KB Output is correct
43 Correct 117 ms 159200 KB Output is correct
44 Correct 675 ms 159200 KB Output is correct
45 Correct 596 ms 159200 KB Output is correct
46 Correct 444 ms 159200 KB Output is correct
47 Correct 291 ms 159200 KB Output is correct
48 Correct 268 ms 159200 KB Output is correct
49 Correct 348 ms 159200 KB Output is correct
50 Correct 369 ms 159200 KB Output is correct
51 Correct 356 ms 159200 KB Output is correct
52 Correct 285 ms 357612 KB Output is correct
53 Correct 290 ms 357612 KB Output is correct
54 Correct 564 ms 357612 KB Output is correct
55 Correct 593 ms 357612 KB Output is correct
56 Correct 565 ms 357612 KB Output is correct
57 Correct 651 ms 357612 KB Output is correct
58 Correct 560 ms 357612 KB Output is correct
59 Correct 493 ms 357612 KB Output is correct
60 Correct 639 ms 357612 KB Output is correct
61 Correct 109 ms 357612 KB Output is correct
62 Correct 305 ms 357612 KB Output is correct
63 Correct 460 ms 357612 KB Output is correct
64 Correct 574 ms 357612 KB Output is correct
65 Correct 683 ms 357612 KB Output is correct
66 Correct 676 ms 357612 KB Output is correct
67 Correct 203 ms 357612 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 88312 KB Output is correct
2 Correct 75 ms 88312 KB Output is correct
3 Correct 73 ms 88368 KB Output is correct
4 Correct 74 ms 88532 KB Output is correct
5 Correct 75 ms 88592 KB Output is correct
6 Correct 73 ms 88736 KB Output is correct
7 Correct 74 ms 88736 KB Output is correct
8 Correct 79 ms 88868 KB Output is correct
9 Correct 84 ms 88868 KB Output is correct
10 Correct 213 ms 88896 KB Output is correct
11 Correct 74 ms 88896 KB Output is correct
12 Correct 81 ms 88896 KB Output is correct
13 Correct 71 ms 88896 KB Output is correct
14 Correct 72 ms 88896 KB Output is correct
15 Correct 74 ms 88896 KB Output is correct
16 Correct 72 ms 88896 KB Output is correct
17 Correct 76 ms 88896 KB Output is correct
18 Correct 75 ms 88896 KB Output is correct
19 Correct 79 ms 88896 KB Output is correct
20 Correct 78 ms 88896 KB Output is correct
21 Correct 73 ms 88896 KB Output is correct
22 Correct 77 ms 88896 KB Output is correct
23 Correct 78 ms 88896 KB Output is correct
24 Correct 79 ms 88896 KB Output is correct
25 Correct 73 ms 88896 KB Output is correct
26 Correct 77 ms 88896 KB Output is correct
27 Correct 77 ms 88896 KB Output is correct
28 Correct 83 ms 88896 KB Output is correct
29 Correct 77 ms 88896 KB Output is correct
30 Correct 75 ms 88896 KB Output is correct
31 Correct 814 ms 158428 KB Output is correct
32 Correct 109 ms 158428 KB Output is correct
33 Correct 829 ms 158428 KB Output is correct
34 Correct 899 ms 158428 KB Output is correct
35 Correct 1040 ms 159060 KB Output is correct
36 Correct 1043 ms 159200 KB Output is correct
37 Correct 673 ms 159200 KB Output is correct
38 Correct 653 ms 159200 KB Output is correct
39 Correct 466 ms 159200 KB Output is correct
40 Correct 516 ms 159200 KB Output is correct
41 Correct 665 ms 159200 KB Output is correct
42 Correct 522 ms 159200 KB Output is correct
43 Correct 117 ms 159200 KB Output is correct
44 Correct 675 ms 159200 KB Output is correct
45 Correct 596 ms 159200 KB Output is correct
46 Correct 444 ms 159200 KB Output is correct
47 Correct 291 ms 159200 KB Output is correct
48 Correct 268 ms 159200 KB Output is correct
49 Correct 348 ms 159200 KB Output is correct
50 Correct 369 ms 159200 KB Output is correct
51 Correct 356 ms 159200 KB Output is correct
52 Correct 1794 ms 254600 KB Output is correct
53 Correct 2021 ms 254600 KB Output is correct
54 Correct 1850 ms 254600 KB Output is correct
55 Correct 1740 ms 254712 KB Output is correct
56 Correct 2260 ms 267028 KB Output is correct
57 Correct 1937 ms 267028 KB Output is correct
58 Correct 1776 ms 267028 KB Output is correct
59 Correct 2017 ms 267028 KB Output is correct
60 Correct 1829 ms 274056 KB Output is correct
61 Correct 1770 ms 274056 KB Output is correct
62 Correct 1183 ms 274056 KB Output is correct
63 Correct 1303 ms 274056 KB Output is correct
64 Correct 4835 ms 336336 KB Output is correct
65 Correct 351 ms 336336 KB Output is correct
66 Correct 4466 ms 357520 KB Output is correct
67 Correct 1044 ms 357520 KB Output is correct
68 Correct 2426 ms 357520 KB Output is correct
69 Correct 1967 ms 357520 KB Output is correct
70 Correct 4586 ms 357520 KB Output is correct
71 Correct 4528 ms 357520 KB Output is correct
72 Correct 1578 ms 357520 KB Output is correct
73 Correct 3109 ms 357520 KB Output is correct
74 Correct 4472 ms 357520 KB Output is correct
75 Correct 4358 ms 357612 KB Output is correct
76 Correct 1740 ms 357612 KB Output is correct
77 Correct 1674 ms 357612 KB Output is correct
78 Correct 2351 ms 357612 KB Output is correct
79 Correct 2385 ms 357612 KB Output is correct
80 Correct 2235 ms 357612 KB Output is correct
81 Correct 285 ms 357612 KB Output is correct
82 Correct 290 ms 357612 KB Output is correct
83 Correct 564 ms 357612 KB Output is correct
84 Correct 593 ms 357612 KB Output is correct
85 Correct 565 ms 357612 KB Output is correct
86 Correct 651 ms 357612 KB Output is correct
87 Correct 560 ms 357612 KB Output is correct
88 Correct 493 ms 357612 KB Output is correct
89 Correct 639 ms 357612 KB Output is correct
90 Correct 109 ms 357612 KB Output is correct
91 Correct 305 ms 357612 KB Output is correct
92 Correct 460 ms 357612 KB Output is correct
93 Correct 574 ms 357612 KB Output is correct
94 Correct 683 ms 357612 KB Output is correct
95 Correct 676 ms 357612 KB Output is correct
96 Correct 203 ms 357612 KB Output is correct
97 Correct 2000 ms 357612 KB Output is correct
98 Correct 309 ms 357612 KB Output is correct
99 Execution timed out 5034 ms 445864 KB Time limit exceeded
100 Halted 0 ms 0 KB -