oj.uz

답안 #864589

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
864589 2023-10-23T09:40:29 Z danikoynov 새 집 (APIO18_new_home) C++14
12 / 100
 5000 ms 55588 KB 
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 3e5 + 10, inf = 1e9;

struct store
{
    int x, t, a, b;
}s[maxn];

struct query
{
    int l, y, idx;
}task[maxn];

int n, k, q;

void input()
{
    cin >> n >> k >> q;
    for (int i = 1; i <= n; i ++)
        cin >> s[i].x >> s[i].t >> s[i].a >> s[i].b;

    for (int i = 1; i <= q; i ++)
        cin >> task[i].l >> task[i].y, task[i].idx = i;
}

int type[maxn];
int solve_naive(int pivot, int year)
{
    for (int i = 1; i <= k; i ++)
        type[i] = inf;

    for (int i = 1; i <= n; i ++)
    {
        if (s[i].a <= year && s[i].b >= year)
            type[s[i].t] = min(type[s[i].t], abs(pivot - s[i].x));
    }

    int ans = -1;
    for (int i = 1; i <= k; i ++)
    {
        if (type[i] == inf)
            return -1;
        ans = max(ans, type[i]);
    }

    return ans;
}

bool cmp_query(query t1, query t2)
{
    return t1.y < t2.y;
}

struct event
{
    int type, cor, add, arrive;

    event(int _type, int _cor, int _add, int _arrive)
    {
        type = _type;
        cor = _cor;
        add = _add;
        arrive = _arrive;
    }
};

bool cmp_event(event e1, event e2)
{
    if (e1.arrive != e2.arrive)
        return e1.arrive < e2.arrive;

    if (e1.add != e2.add)
        return e1.add < e2.add;

    return e1.cor < e2.cor; /// could have dublicates
}


multiset < int > act[maxn];


void add_event(int type, int cor)
{
    act[type].insert(cor);
}

void remove_event(int type, int cor)
{
    act[type].erase(act[type].find(cor));
}

int ans[maxn];

int single_query(int cor)
{
    int far = 0;
    for (int i = 1; i <= k; i ++)
    {
        multiset < int > :: iterator it = act[i].upper_bound(cor);
        int closest = inf;
        ///if (it != act[i].end())
        ///cout << "here " << cor << " " << *it << endl;
        if (it != act[i].end())
            closest = min(closest, *it - cor);
        
        if (it != act[i].begin())
            closest = min(closest, cor - *prev(it));
        
        far = max(far, closest);
        ///cout << far << endl;
    }

    if (far > 2e8)
        return -1;

    return far;
}
void answer_queries()
{
    sort(task + 1, task + q + 1, cmp_query);
    
    vector < event > events;
    for (int i = 1; i <= n; i ++)
    {
        events.push_back(event(s[i].t, s[i].x, 1, s[i].a));
        events.push_back(event(s[i].t, s[i].x, -1, s[i].b + 1));
    }

    sort(events.begin(), events.end(), cmp_event);

    for (int i = 1; i <= k; i ++)
    {
        act[i].insert(-inf);
        act[i].insert(inf);
    }
    int pt = 1;
    for (event cur : events)
    {
        while(pt <= q && task[pt].y < cur.arrive)
        {
            ans[task[pt].idx] = single_query(task[pt].l);
            pt ++;
        }

        if (cur.add == 1)
            add_event(cur.type, cur.cor);
        else
            remove_event(cur.type, cur.cor);
    }

    while(pt <= q)
    {
         ans[task[pt].idx] = single_query(task[pt].l);
         pt ++;
    }

    for (int i = 1; i <= q; i ++)
        cout << ans[i] << endl;
}
void solve()
{
    input();
    answer_queries();
}

int main()
{
    solve();
    return 0;
}

/**
4 2 4
3 1 1 10
9 2 2 4
7 2 5 7
4 1 8 10
5 3
5 6
5 9
1 10

2 1 3
1 1 1 4
1 1 2 6
1 3
1 5
1 7

1 1 1
100000000 1 1 1
1 1



*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 18780 KB Output is correct
2 Correct 3 ms 18780 KB Output is correct
3 Correct 4 ms 18880 KB Output is correct
4 Correct 3 ms 18780 KB Output is correct
5 Correct 4 ms 18892 KB Output is correct
6 Correct 4 ms 18780 KB Output is correct
7 Correct 5 ms 18780 KB Output is correct
8 Correct 5 ms 18876 KB Output is correct
9 Correct 5 ms 18780 KB Output is correct
10 Correct 4 ms 18780 KB Output is correct
11 Correct 4 ms 18780 KB Output is correct
12 Correct 4 ms 18780 KB Output is correct
13 Correct 6 ms 18884 KB Output is correct
14 Correct 4 ms 18780 KB Output is correct
15 Correct 5 ms 18904 KB Output is correct
16 Correct 5 ms 18780 KB Output is correct
17 Correct 5 ms 18876 KB Output is correct
18 Correct 5 ms 19032 KB Output is correct
19 Correct 5 ms 18888 KB Output is correct
20 Correct 5 ms 18780 KB Output is correct
21 Correct 5 ms 18780 KB Output is correct
22 Correct 5 ms 18888 KB Output is correct
23 Correct 5 ms 18908 KB Output is correct
24 Correct 5 ms 18780 KB Output is correct
25 Correct 5 ms 18936 KB Output is correct
26 Correct 4 ms 18780 KB Output is correct
27 Correct 4 ms 18780 KB Output is correct
28 Correct 4 ms 18776 KB Output is correct
29 Correct 4 ms 18780 KB Output is correct
30 Correct 4 ms 18780 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 18780 KB Output is correct
2 Correct 3 ms 18780 KB Output is correct
3 Correct 4 ms 18880 KB Output is correct
4 Correct 3 ms 18780 KB Output is correct
5 Correct 4 ms 18892 KB Output is correct
6 Correct 4 ms 18780 KB Output is correct
7 Correct 5 ms 18780 KB Output is correct
8 Correct 5 ms 18876 KB Output is correct
9 Correct 5 ms 18780 KB Output is correct
10 Correct 4 ms 18780 KB Output is correct
11 Correct 4 ms 18780 KB Output is correct
12 Correct 4 ms 18780 KB Output is correct
13 Correct 6 ms 18884 KB Output is correct
14 Correct 4 ms 18780 KB Output is correct
15 Correct 5 ms 18904 KB Output is correct
16 Correct 5 ms 18780 KB Output is correct
17 Correct 5 ms 18876 KB Output is correct
18 Correct 5 ms 19032 KB Output is correct
19 Correct 5 ms 18888 KB Output is correct
20 Correct 5 ms 18780 KB Output is correct
21 Correct 5 ms 18780 KB Output is correct
22 Correct 5 ms 18888 KB Output is correct
23 Correct 5 ms 18908 KB Output is correct
24 Correct 5 ms 18780 KB Output is correct
25 Correct 5 ms 18936 KB Output is correct
26 Correct 4 ms 18780 KB Output is correct
27 Correct 4 ms 18780 KB Output is correct
28 Correct 4 ms 18776 KB Output is correct
29 Correct 4 ms 18780 KB Output is correct
30 Correct 4 ms 18780 KB Output is correct
31 Correct 1610 ms 28432 KB Output is correct
32 Correct 152 ms 26180 KB Output is correct
33 Correct 254 ms 26396 KB Output is correct
34 Correct 1308 ms 26604 KB Output is correct
35 Correct 796 ms 28160 KB Output is correct
36 Correct 272 ms 28092 KB Output is correct
37 Correct 237 ms 25536 KB Output is correct
38 Correct 192 ms 25404 KB Output is correct
39 Correct 196 ms 25624 KB Output is correct
40 Correct 185 ms 25516 KB Output is correct
41 Correct 351 ms 25532 KB Output is correct
42 Correct 420 ms 25396 KB Output is correct
43 Correct 363 ms 28416 KB Output is correct
44 Correct 314 ms 25532 KB Output is correct
45 Correct 219 ms 25536 KB Output is correct
46 Correct 186 ms 25912 KB Output is correct
47 Correct 175 ms 25180 KB Output is correct
48 Correct 173 ms 25276 KB Output is correct
49 Correct 186 ms 25392 KB Output is correct
50 Correct 301 ms 25280 KB Output is correct
51 Correct 177 ms 25408 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 18780 KB Output is correct
2 Correct 3 ms 18780 KB Output is correct
3 Correct 4 ms 18880 KB Output is correct
4 Correct 3 ms 18780 KB Output is correct
5 Correct 4 ms 18892 KB Output is correct
6 Correct 4 ms 18780 KB Output is correct
7 Correct 5 ms 18780 KB Output is correct
8 Correct 5 ms 18876 KB Output is correct
9 Correct 5 ms 18780 KB Output is correct
10 Correct 4 ms 18780 KB Output is correct
11 Correct 4 ms 18780 KB Output is correct
12 Correct 4 ms 18780 KB Output is correct
13 Correct 6 ms 18884 KB Output is correct
14 Correct 4 ms 18780 KB Output is correct
15 Correct 5 ms 18904 KB Output is correct
16 Correct 5 ms 18780 KB Output is correct
17 Correct 5 ms 18876 KB Output is correct
18 Correct 5 ms 19032 KB Output is correct
19 Correct 5 ms 18888 KB Output is correct
20 Correct 5 ms 18780 KB Output is correct
21 Correct 5 ms 18780 KB Output is correct
22 Correct 5 ms 18888 KB Output is correct
23 Correct 5 ms 18908 KB Output is correct
24 Correct 5 ms 18780 KB Output is correct
25 Correct 5 ms 18936 KB Output is correct
26 Correct 4 ms 18780 KB Output is correct
27 Correct 4 ms 18780 KB Output is correct
28 Correct 4 ms 18776 KB Output is correct
29 Correct 4 ms 18780 KB Output is correct
30 Correct 4 ms 18780 KB Output is correct
31 Correct 1610 ms 28432 KB Output is correct
32 Correct 152 ms 26180 KB Output is correct
33 Correct 254 ms 26396 KB Output is correct
34 Correct 1308 ms 26604 KB Output is correct
35 Correct 796 ms 28160 KB Output is correct
36 Correct 272 ms 28092 KB Output is correct
37 Correct 237 ms 25536 KB Output is correct
38 Correct 192 ms 25404 KB Output is correct
39 Correct 196 ms 25624 KB Output is correct
40 Correct 185 ms 25516 KB Output is correct
41 Correct 351 ms 25532 KB Output is correct
42 Correct 420 ms 25396 KB Output is correct
43 Correct 363 ms 28416 KB Output is correct
44 Correct 314 ms 25532 KB Output is correct
45 Correct 219 ms 25536 KB Output is correct
46 Correct 186 ms 25912 KB Output is correct
47 Correct 175 ms 25180 KB Output is correct
48 Correct 173 ms 25276 KB Output is correct
49 Correct 186 ms 25392 KB Output is correct
50 Correct 301 ms 25280 KB Output is correct
51 Correct 177 ms 25408 KB Output is correct
52 Execution timed out 5067 ms 32108 KB Time limit exceeded
53 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 18780 KB Output is correct
2 Correct 3 ms 18780 KB Output is correct
3 Correct 4 ms 18880 KB Output is correct
4 Correct 3 ms 18780 KB Output is correct
5 Correct 4 ms 18892 KB Output is correct
6 Correct 4 ms 18780 KB Output is correct
7 Correct 5 ms 18780 KB Output is correct
8 Correct 5 ms 18876 KB Output is correct
9 Correct 5 ms 18780 KB Output is correct
10 Correct 4 ms 18780 KB Output is correct
11 Correct 4 ms 18780 KB Output is correct
12 Correct 4 ms 18780 KB Output is correct
13 Correct 6 ms 18884 KB Output is correct
14 Correct 4 ms 18780 KB Output is correct
15 Correct 5 ms 18904 KB Output is correct
16 Correct 5 ms 18780 KB Output is correct
17 Correct 5 ms 18876 KB Output is correct
18 Correct 5 ms 19032 KB Output is correct
19 Correct 5 ms 18888 KB Output is correct
20 Correct 5 ms 18780 KB Output is correct
21 Correct 5 ms 18780 KB Output is correct
22 Correct 5 ms 18888 KB Output is correct
23 Correct 5 ms 18908 KB Output is correct
24 Correct 5 ms 18780 KB Output is correct
25 Correct 5 ms 18936 KB Output is correct
26 Correct 4 ms 18780 KB Output is correct
27 Correct 4 ms 18780 KB Output is correct
28 Correct 4 ms 18776 KB Output is correct
29 Correct 4 ms 18780 KB Output is correct
30 Correct 4 ms 18780 KB Output is correct
31 Correct 1610 ms 28432 KB Output is correct
32 Correct 152 ms 26180 KB Output is correct
33 Correct 254 ms 26396 KB Output is correct
34 Correct 1308 ms 26604 KB Output is correct
35 Correct 796 ms 28160 KB Output is correct
36 Correct 272 ms 28092 KB Output is correct
37 Correct 237 ms 25536 KB Output is correct
38 Correct 192 ms 25404 KB Output is correct
39 Correct 196 ms 25624 KB Output is correct
40 Correct 185 ms 25516 KB Output is correct
41 Correct 351 ms 25532 KB Output is correct
42 Correct 420 ms 25396 KB Output is correct
43 Correct 363 ms 28416 KB Output is correct
44 Correct 314 ms 25532 KB Output is correct
45 Correct 219 ms 25536 KB Output is correct
46 Correct 186 ms 25912 KB Output is correct
47 Correct 175 ms 25180 KB Output is correct
48 Correct 173 ms 25276 KB Output is correct
49 Correct 186 ms 25392 KB Output is correct
50 Correct 301 ms 25280 KB Output is correct
51 Correct 177 ms 25408 KB Output is correct
52 Execution timed out 5037 ms 55588 KB Time limit exceeded
53 Halted 0 ms 0 KB -