답안 #49461 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
49461	2018-05-29T06:34:00 Z	gs13105	새 집 (APIO18_new_home)	C++17	47 / 100	5000 ms	327876 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 MAXN = 300000;
const int MAXI = 1048576;
const int INF = 100000000;

int n, k, q, bp;

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

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

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

vector<eve1> arr1;
map<int, ent1> loc1[MAXN + 10];

// add  : t time, p = 1, [x -> y] loc, d origin
// query: t time, p = 2, x loc, y idx, d = -1
// sub  : t time, p = 3, [x -> y] loc, d origin
struct eve2
{
    int t, p, x, y, d;
    bool operator <(const eve2 &e) const
    {
        return t != e.t ? t < e.t : p < e.p;
    }
};

vector<eve2> arr2;
void add_seg(int t, int t2, int x, int y)
{
    if(t > t2 || x == y)
        return;

    int nx = bp + idx(min(x, y));
    int ny = bp + idx(max(x, y) + 1) - 1;
    if(nx > ny)
        return;

    arr2.push_back({ t, 1, nx, ny, x });
    arr2.push_back({ t2, 3, nx, ny, x });
}

map<int, int> mem2[MAXI + 10];

void upd(int x, int p, int d)
{
    if(p == 1)
        mem2[x][d]++;
    else
    {
        auto it = mem2[x].find(d);
        it->second--;
        if(!it->second)
            mem2[x].erase(it);
    }
}

void add(const eve2 &e)
{
    int x = e.x;
    int y = e.y;

    while(x < y)
    {
        if(x % 2 == 1)
        {
            upd(x, e.p, e.d);
            x++;
        }
        if(y % 2 == 0)
        {
            upd(y, e.p, e.d);
            y--;
        }
        x /= 2;
        y /= 2;
    }
    if(x == y)
        upd(x, e.p, e.d);
}

int get(int p)
{
    int r = 0;
    int x = bp + idx(p);

    while(x)
    {
        if(!mem2[x].empty())
        {
            r = max(r, abs(p - mem2[x].begin()->first));
            r = max(r, abs(p - prev(mem2[x].end())->first));
        }
        x /= 2;
    }
    return r;
}

vector<pair<int, int>> can;
int ans[MAXN + 10];

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

    scanf("%d%d%d", &n, &k, &q);
    for(int i = 0; i < n; i++)
    {
        int x, t, a, b;
        scanf("%d%d%d%d", &x, &t, &a, &b);
        arr1.push_back({ a, x, t });
        arr1.push_back({ b, x, -t });
    }
    for(int i = 0; i < q; i++)
    {
        int l, y;
        scanf("%d%d", &l, &y);
        arr2.push_back({ y, 2, l, i, -1 });
        com.push_back(l);
    }

    sort(com.begin(), com.end());
    com.erase(unique(com.begin(), com.end()), com.end());
    for(bp = 1; bp < (int)com.size(); bp *= 2);

    sort(arr1.begin(), arr1.end());
    int cur, cnt = 0;
    for(eve1 &e : arr1)
    {
        if(e.d > 0)
        {
            if(loc1[e.d].size() == 0)
            {
                cnt++;
                if(cnt == k)
                    cur = e.t;
            }

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

            it = loc1[e.d].insert({ e.x, { 1, 1, e.t, INF, e.t } }).first;
            ent1 &p = it->second;
            
            if(it != loc1[e.d].begin())
            {
                int x = prev(it)->first;
                ent1 &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) != loc1[e.d].end())
            {
                int x = next(it)->first;
                ent1 &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 = loc1[e.d].find(e.x);
            ent1 &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 != loc1[e.d].begin())
            {
                int x = prev(it)->first;
                ent1 &q = prev(it)->second;

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

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

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

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

            if(loc1[e.d].size() == 0)
            {
                if(cnt == k)
                    can.push_back({ cur, e.t });
                cnt--;
            }
        }
    }

    sort(arr2.begin(), arr2.end());
    int p = 0, sz = (int)can.size();
    for(eve2 &e : arr2)
    {
        if(e.p == 1 || e.p == 3)
            add(e);
        else
        {
            while(p < sz && can[p].second < e.t)
                p++;
            
            if(p < sz && can[p].first <= e.t)
                ans[e.y] = get(e.x);
            else
                ans[e.y] = -1;
        }
    }

    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:140:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &k, &q);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:144:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d%d", &x, &t, &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
new_home.cpp:151:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &l, &y);
         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	53 ms	63608 KB	Output is correct
2	Correct	52 ms	63716 KB	Output is correct
3	Correct	52 ms	63748 KB	Output is correct
4	Correct	60 ms	63748 KB	Output is correct
5	Correct	60 ms	63900 KB	Output is correct
6	Correct	62 ms	64040 KB	Output is correct
7	Correct	61 ms	64040 KB	Output is correct
8	Correct	65 ms	64040 KB	Output is correct
9	Correct	64 ms	64168 KB	Output is correct
10	Correct	59 ms	64180 KB	Output is correct
11	Correct	67 ms	64180 KB	Output is correct
12	Correct	53 ms	64180 KB	Output is correct
13	Correct	54 ms	64180 KB	Output is correct
14	Correct	56 ms	64184 KB	Output is correct
15	Correct	52 ms	64184 KB	Output is correct
16	Correct	56 ms	64184 KB	Output is correct
17	Correct	57 ms	64184 KB	Output is correct
18	Correct	58 ms	64184 KB	Output is correct
19	Correct	60 ms	64184 KB	Output is correct
20	Correct	60 ms	64184 KB	Output is correct
21	Correct	56 ms	64184 KB	Output is correct
22	Correct	61 ms	64184 KB	Output is correct
23	Correct	56 ms	64184 KB	Output is correct
24	Correct	53 ms	64184 KB	Output is correct
25	Correct	53 ms	64184 KB	Output is correct
26	Correct	53 ms	64184 KB	Output is correct
27	Correct	52 ms	64184 KB	Output is correct
28	Correct	54 ms	64184 KB	Output is correct
29	Correct	58 ms	64184 KB	Output is correct
30	Correct	57 ms	64184 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	53 ms	63608 KB	Output is correct
2	Correct	52 ms	63716 KB	Output is correct
3	Correct	52 ms	63748 KB	Output is correct
4	Correct	60 ms	63748 KB	Output is correct
5	Correct	60 ms	63900 KB	Output is correct
6	Correct	62 ms	64040 KB	Output is correct
7	Correct	61 ms	64040 KB	Output is correct
8	Correct	65 ms	64040 KB	Output is correct
9	Correct	64 ms	64168 KB	Output is correct
10	Correct	59 ms	64180 KB	Output is correct
11	Correct	67 ms	64180 KB	Output is correct
12	Correct	53 ms	64180 KB	Output is correct
13	Correct	54 ms	64180 KB	Output is correct
14	Correct	56 ms	64184 KB	Output is correct
15	Correct	52 ms	64184 KB	Output is correct
16	Correct	56 ms	64184 KB	Output is correct
17	Correct	57 ms	64184 KB	Output is correct
18	Correct	58 ms	64184 KB	Output is correct
19	Correct	60 ms	64184 KB	Output is correct
20	Correct	60 ms	64184 KB	Output is correct
21	Correct	56 ms	64184 KB	Output is correct
22	Correct	61 ms	64184 KB	Output is correct
23	Correct	56 ms	64184 KB	Output is correct
24	Correct	53 ms	64184 KB	Output is correct
25	Correct	53 ms	64184 KB	Output is correct
26	Correct	53 ms	64184 KB	Output is correct
27	Correct	52 ms	64184 KB	Output is correct
28	Correct	54 ms	64184 KB	Output is correct
29	Correct	58 ms	64184 KB	Output is correct
30	Correct	57 ms	64184 KB	Output is correct
31	Correct	3523 ms	119436 KB	Output is correct
32	Correct	112 ms	119436 KB	Output is correct
33	Correct	1261 ms	119436 KB	Output is correct
34	Correct	3590 ms	119436 KB	Output is correct
35	Correct	2735 ms	119436 KB	Output is correct
36	Correct	1253 ms	119436 KB	Output is correct
37	Correct	932 ms	119436 KB	Output is correct
38	Correct	697 ms	119436 KB	Output is correct
39	Correct	543 ms	119436 KB	Output is correct
40	Correct	492 ms	119436 KB	Output is correct
41	Correct	1287 ms	119436 KB	Output is correct
42	Correct	1374 ms	119436 KB	Output is correct
43	Correct	106 ms	119436 KB	Output is correct
44	Correct	1233 ms	119436 KB	Output is correct
45	Correct	869 ms	119436 KB	Output is correct
46	Correct	710 ms	119436 KB	Output is correct
47	Correct	486 ms	119436 KB	Output is correct
48	Correct	423 ms	119436 KB	Output is correct
49	Correct	595 ms	119436 KB	Output is correct
50	Correct	854 ms	119436 KB	Output is correct
51	Correct	564 ms	119436 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	5116 ms	327876 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	5023 ms	327876 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	53 ms	63608 KB	Output is correct
2	Correct	52 ms	63716 KB	Output is correct
3	Correct	52 ms	63748 KB	Output is correct
4	Correct	60 ms	63748 KB	Output is correct
5	Correct	60 ms	63900 KB	Output is correct
6	Correct	62 ms	64040 KB	Output is correct
7	Correct	61 ms	64040 KB	Output is correct
8	Correct	65 ms	64040 KB	Output is correct
9	Correct	64 ms	64168 KB	Output is correct
10	Correct	59 ms	64180 KB	Output is correct
11	Correct	67 ms	64180 KB	Output is correct
12	Correct	53 ms	64180 KB	Output is correct
13	Correct	54 ms	64180 KB	Output is correct
14	Correct	56 ms	64184 KB	Output is correct
15	Correct	52 ms	64184 KB	Output is correct
16	Correct	56 ms	64184 KB	Output is correct
17	Correct	57 ms	64184 KB	Output is correct
18	Correct	58 ms	64184 KB	Output is correct
19	Correct	60 ms	64184 KB	Output is correct
20	Correct	60 ms	64184 KB	Output is correct
21	Correct	56 ms	64184 KB	Output is correct
22	Correct	61 ms	64184 KB	Output is correct
23	Correct	56 ms	64184 KB	Output is correct
24	Correct	53 ms	64184 KB	Output is correct
25	Correct	53 ms	64184 KB	Output is correct
26	Correct	53 ms	64184 KB	Output is correct
27	Correct	52 ms	64184 KB	Output is correct
28	Correct	54 ms	64184 KB	Output is correct
29	Correct	58 ms	64184 KB	Output is correct
30	Correct	57 ms	64184 KB	Output is correct
31	Correct	3523 ms	119436 KB	Output is correct
32	Correct	112 ms	119436 KB	Output is correct
33	Correct	1261 ms	119436 KB	Output is correct
34	Correct	3590 ms	119436 KB	Output is correct
35	Correct	2735 ms	119436 KB	Output is correct
36	Correct	1253 ms	119436 KB	Output is correct
37	Correct	932 ms	119436 KB	Output is correct
38	Correct	697 ms	119436 KB	Output is correct
39	Correct	543 ms	119436 KB	Output is correct
40	Correct	492 ms	119436 KB	Output is correct
41	Correct	1287 ms	119436 KB	Output is correct
42	Correct	1374 ms	119436 KB	Output is correct
43	Correct	106 ms	119436 KB	Output is correct
44	Correct	1233 ms	119436 KB	Output is correct
45	Correct	869 ms	119436 KB	Output is correct
46	Correct	710 ms	119436 KB	Output is correct
47	Correct	486 ms	119436 KB	Output is correct
48	Correct	423 ms	119436 KB	Output is correct
49	Correct	595 ms	119436 KB	Output is correct
50	Correct	854 ms	119436 KB	Output is correct
51	Correct	564 ms	119436 KB	Output is correct
52	Correct	1680 ms	327876 KB	Output is correct
53	Correct	1320 ms	327876 KB	Output is correct
54	Correct	3775 ms	327876 KB	Output is correct
55	Correct	1690 ms	327876 KB	Output is correct
56	Correct	1944 ms	327876 KB	Output is correct
57	Correct	1958 ms	327876 KB	Output is correct
58	Correct	2151 ms	327876 KB	Output is correct
59	Correct	2231 ms	327876 KB	Output is correct
60	Correct	1870 ms	327876 KB	Output is correct
61	Correct	135 ms	327876 KB	Output is correct
62	Correct	1937 ms	327876 KB	Output is correct
63	Correct	2907 ms	327876 KB	Output is correct
64	Correct	3024 ms	327876 KB	Output is correct
65	Correct	3799 ms	327876 KB	Output is correct
66	Correct	1524 ms	327876 KB	Output is correct
67	Correct	280 ms	327876 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	53 ms	63608 KB	Output is correct
2	Correct	52 ms	63716 KB	Output is correct
3	Correct	52 ms	63748 KB	Output is correct
4	Correct	60 ms	63748 KB	Output is correct
5	Correct	60 ms	63900 KB	Output is correct
6	Correct	62 ms	64040 KB	Output is correct
7	Correct	61 ms	64040 KB	Output is correct
8	Correct	65 ms	64040 KB	Output is correct
9	Correct	64 ms	64168 KB	Output is correct
10	Correct	59 ms	64180 KB	Output is correct
11	Correct	67 ms	64180 KB	Output is correct
12	Correct	53 ms	64180 KB	Output is correct
13	Correct	54 ms	64180 KB	Output is correct
14	Correct	56 ms	64184 KB	Output is correct
15	Correct	52 ms	64184 KB	Output is correct
16	Correct	56 ms	64184 KB	Output is correct
17	Correct	57 ms	64184 KB	Output is correct
18	Correct	58 ms	64184 KB	Output is correct
19	Correct	60 ms	64184 KB	Output is correct
20	Correct	60 ms	64184 KB	Output is correct
21	Correct	56 ms	64184 KB	Output is correct
22	Correct	61 ms	64184 KB	Output is correct
23	Correct	56 ms	64184 KB	Output is correct
24	Correct	53 ms	64184 KB	Output is correct
25	Correct	53 ms	64184 KB	Output is correct
26	Correct	53 ms	64184 KB	Output is correct
27	Correct	52 ms	64184 KB	Output is correct
28	Correct	54 ms	64184 KB	Output is correct
29	Correct	58 ms	64184 KB	Output is correct
30	Correct	57 ms	64184 KB	Output is correct
31	Correct	3523 ms	119436 KB	Output is correct
32	Correct	112 ms	119436 KB	Output is correct
33	Correct	1261 ms	119436 KB	Output is correct
34	Correct	3590 ms	119436 KB	Output is correct
35	Correct	2735 ms	119436 KB	Output is correct
36	Correct	1253 ms	119436 KB	Output is correct
37	Correct	932 ms	119436 KB	Output is correct
38	Correct	697 ms	119436 KB	Output is correct
39	Correct	543 ms	119436 KB	Output is correct
40	Correct	492 ms	119436 KB	Output is correct
41	Correct	1287 ms	119436 KB	Output is correct
42	Correct	1374 ms	119436 KB	Output is correct
43	Correct	106 ms	119436 KB	Output is correct
44	Correct	1233 ms	119436 KB	Output is correct
45	Correct	869 ms	119436 KB	Output is correct
46	Correct	710 ms	119436 KB	Output is correct
47	Correct	486 ms	119436 KB	Output is correct
48	Correct	423 ms	119436 KB	Output is correct
49	Correct	595 ms	119436 KB	Output is correct
50	Correct	854 ms	119436 KB	Output is correct
51	Correct	564 ms	119436 KB	Output is correct
52	Execution timed out	5116 ms	327876 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

답안 #49461

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 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
0 / 10.0

Subtask #4
0 / 23.0

Subtask #5
35.0 / 35.0

Subtask #6
0 / 20.0