답안 #49442 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
49442	2018-05-29T04:41:50 Z	gs13105	새 집 (APIO18_new_home)	C++17	5 / 100	5000 ms	106728 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];

// segment: [t, t2] time, [x -> y] loc
// query  : t time, t2 = -1, x loc, y idx
struct eve2
{
    int t, t2, x, y;
    bool operator <(const eve2 &e) const
    {
        return t != e.t ? t < e.t : t2 > e.t2;
    }
};

vector<eve2> arr2;
list<pair<int, int>> mem2[MAXI + 10];

vector<eve2> naive;
void add(eve2 &e)
{
    if(e.t <= e.t2 && e.x != e.y)
        naive.push_back(e);
}

int get(int t, int x)
{
    int r = 0;
    for(eve2 &e : naive)
    {
        if(e.t <= t && t <= e.t2 && min(e.x, e.y) <= x && x <= max(e.x, e.y))
        {
            int c = abs(x - e.x);
            r = max(r, c);
        }
    }
    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, -1, l, i });
        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 = -1, cnt = 0;
    for(eve1 &e : arr1)
    {
        if(e.d > 0)
        {
            if(loc1[e.d].size() == 0)
            {
                cnt++;
                if(cnt == k)
                {
                    assert(cur == -1);
                    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;

                assert(x < e.x);

                arr2.push_back({ 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;

                assert(x > e.x);

                arr2.push_back({ 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;
            }

            assert(p.c == 1);

            arr2.push_back({ p.lt, e.t, e.x, p.l });
            arr2.push_back({ p.rt, e.t, e.x, p.r });

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

                assert(x < e.x);

                arr2.push_back({ 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;

                assert(x > e.x);

                arr2.push_back({ 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)
                {
                    assert(cur != -1);
                    can.push_back({ cur, e.t });
                    cur = -1;
                }
                cnt--;
            }
        }
    }

    assert(cnt == 0);
    for(int i = 1; i <= k; i++)
        assert(loc1[i].empty());

    sort(arr2.begin(), arr2.end());
    int p = 0, sz = (int)can.size();
    for(eve2 &e : arr2)
    {
        if(e.t2 != -1)
        {
            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.t, 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:92: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:96: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:103: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	36 ms	39032 KB	Output is correct
2	Correct	44 ms	39032 KB	Output is correct
3	Correct	38 ms	39092 KB	Output is correct
4	Correct	40 ms	39252 KB	Output is correct
5	Correct	47 ms	39252 KB	Output is correct
6	Correct	41 ms	39328 KB	Output is correct
7	Correct	36 ms	39328 KB	Output is correct
8	Correct	47 ms	39328 KB	Output is correct
9	Correct	37 ms	39328 KB	Output is correct
10	Correct	37 ms	39344 KB	Output is correct
11	Correct	36 ms	39344 KB	Output is correct
12	Correct	150 ms	39436 KB	Output is correct
13	Correct	36 ms	39436 KB	Output is correct
14	Correct	39 ms	39436 KB	Output is correct
15	Correct	39 ms	39436 KB	Output is correct
16	Correct	46 ms	39436 KB	Output is correct
17	Correct	45 ms	39436 KB	Output is correct
18	Correct	45 ms	39436 KB	Output is correct
19	Correct	39 ms	39436 KB	Output is correct
20	Correct	37 ms	39436 KB	Output is correct
21	Correct	37 ms	39436 KB	Output is correct
22	Correct	37 ms	39436 KB	Output is correct
23	Correct	43 ms	39436 KB	Output is correct
24	Correct	36 ms	39436 KB	Output is correct
25	Correct	36 ms	39436 KB	Output is correct
26	Correct	39 ms	39528 KB	Output is correct
27	Correct	36 ms	39528 KB	Output is correct
28	Correct	38 ms	39528 KB	Output is correct
29	Correct	41 ms	39528 KB	Output is correct
30	Correct	36 ms	39528 KB	Output is correct

Subtask #2
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	36 ms	39032 KB	Output is correct
2	Correct	44 ms	39032 KB	Output is correct
3	Correct	38 ms	39092 KB	Output is correct
4	Correct	40 ms	39252 KB	Output is correct
5	Correct	47 ms	39252 KB	Output is correct
6	Correct	41 ms	39328 KB	Output is correct
7	Correct	36 ms	39328 KB	Output is correct
8	Correct	47 ms	39328 KB	Output is correct
9	Correct	37 ms	39328 KB	Output is correct
10	Correct	37 ms	39344 KB	Output is correct
11	Correct	36 ms	39344 KB	Output is correct
12	Correct	150 ms	39436 KB	Output is correct
13	Correct	36 ms	39436 KB	Output is correct
14	Correct	39 ms	39436 KB	Output is correct
15	Correct	39 ms	39436 KB	Output is correct
16	Correct	46 ms	39436 KB	Output is correct
17	Correct	45 ms	39436 KB	Output is correct
18	Correct	45 ms	39436 KB	Output is correct
19	Correct	39 ms	39436 KB	Output is correct
20	Correct	37 ms	39436 KB	Output is correct
21	Correct	37 ms	39436 KB	Output is correct
22	Correct	37 ms	39436 KB	Output is correct
23	Correct	43 ms	39436 KB	Output is correct
24	Correct	36 ms	39436 KB	Output is correct
25	Correct	36 ms	39436 KB	Output is correct
26	Correct	39 ms	39528 KB	Output is correct
27	Correct	36 ms	39528 KB	Output is correct
28	Correct	38 ms	39528 KB	Output is correct
29	Correct	41 ms	39528 KB	Output is correct
30	Correct	36 ms	39528 KB	Output is correct
31	Execution timed out	5038 ms	53880 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	36 ms	39032 KB	Output is correct
2	Correct	44 ms	39032 KB	Output is correct
3	Correct	38 ms	39092 KB	Output is correct
4	Correct	40 ms	39252 KB	Output is correct
5	Correct	47 ms	39252 KB	Output is correct
6	Correct	41 ms	39328 KB	Output is correct
7	Correct	36 ms	39328 KB	Output is correct
8	Correct	47 ms	39328 KB	Output is correct
9	Correct	37 ms	39328 KB	Output is correct
10	Correct	37 ms	39344 KB	Output is correct
11	Correct	36 ms	39344 KB	Output is correct
12	Correct	150 ms	39436 KB	Output is correct
13	Correct	36 ms	39436 KB	Output is correct
14	Correct	39 ms	39436 KB	Output is correct
15	Correct	39 ms	39436 KB	Output is correct
16	Correct	46 ms	39436 KB	Output is correct
17	Correct	45 ms	39436 KB	Output is correct
18	Correct	45 ms	39436 KB	Output is correct
19	Correct	39 ms	39436 KB	Output is correct
20	Correct	37 ms	39436 KB	Output is correct
21	Correct	37 ms	39436 KB	Output is correct
22	Correct	37 ms	39436 KB	Output is correct
23	Correct	43 ms	39436 KB	Output is correct
24	Correct	36 ms	39436 KB	Output is correct
25	Correct	36 ms	39436 KB	Output is correct
26	Correct	39 ms	39528 KB	Output is correct
27	Correct	36 ms	39528 KB	Output is correct
28	Correct	38 ms	39528 KB	Output is correct
29	Correct	41 ms	39528 KB	Output is correct
30	Correct	36 ms	39528 KB	Output is correct
31	Execution timed out	5038 ms	53880 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	36 ms	39032 KB	Output is correct
2	Correct	44 ms	39032 KB	Output is correct
3	Correct	38 ms	39092 KB	Output is correct
4	Correct	40 ms	39252 KB	Output is correct
5	Correct	47 ms	39252 KB	Output is correct
6	Correct	41 ms	39328 KB	Output is correct
7	Correct	36 ms	39328 KB	Output is correct
8	Correct	47 ms	39328 KB	Output is correct
9	Correct	37 ms	39328 KB	Output is correct
10	Correct	37 ms	39344 KB	Output is correct
11	Correct	36 ms	39344 KB	Output is correct
12	Correct	150 ms	39436 KB	Output is correct
13	Correct	36 ms	39436 KB	Output is correct
14	Correct	39 ms	39436 KB	Output is correct
15	Correct	39 ms	39436 KB	Output is correct
16	Correct	46 ms	39436 KB	Output is correct
17	Correct	45 ms	39436 KB	Output is correct
18	Correct	45 ms	39436 KB	Output is correct
19	Correct	39 ms	39436 KB	Output is correct
20	Correct	37 ms	39436 KB	Output is correct
21	Correct	37 ms	39436 KB	Output is correct
22	Correct	37 ms	39436 KB	Output is correct
23	Correct	43 ms	39436 KB	Output is correct
24	Correct	36 ms	39436 KB	Output is correct
25	Correct	36 ms	39436 KB	Output is correct
26	Correct	39 ms	39528 KB	Output is correct
27	Correct	36 ms	39528 KB	Output is correct
28	Correct	38 ms	39528 KB	Output is correct
29	Correct	41 ms	39528 KB	Output is correct
30	Correct	36 ms	39528 KB	Output is correct
31	Execution timed out	5038 ms	53880 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

답안 #49442

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 0 / 7.0

Subtask #3 0 / 10.0

Subtask #4 0 / 23.0

Subtask #5 0 / 35.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
0 / 7.0

Subtask #3
0 / 10.0

Subtask #4
0 / 23.0

Subtask #5
0 / 35.0

Subtask #6
0 / 20.0