oj.uz

답안 #968864

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968864 2024-04-24T08:01:44 Z socpite 새 집 (APIO18_new_home) C++14
57 / 100
 5000 ms 344544 KB 
// #pragma GCC optimize("arch=skylake")
#include<bits/stdc++.h>
using namespace std;

const int maxn = 4e5+5;
const int INF = 1e9+5;

vector<pair<int, pair<int, int>>> ev;
vector<int> cp, cpy;
int n, q, k;

int ans[maxn];
int p[maxn], ty[maxn];
int L[maxn], Y[maxn];

int st[4*maxn][2];

struct ev_upd{
    int l, r, ty;
    ev_upd(int _l, int _r, int _ty): l(_l), r(_r), ty(_ty){};
};

vector<pair<int, int>> leaf_q[maxn];  
set<pair<int, int>> pos[maxn];
int last_time[maxn][2];


vector<ev_upd> st_time[4*maxn];

int crrt;

pair<pair<int, int>, int> undo_stack[maxn*100];
int stksz = 0;

// 0 is min, 1 is max

void upd_st(ev_upd &ele, int &cnt, int l = 0, int r = cp.size()-1, int id = 1){
    if(ele.l > ele.r || ele.l > cp[r] || ele.r < cp[l])return;
    if(ele.l <= cp[l] && cp[r] <= ele.r){
        if(ele.ty == 0){
            if(st[id][0] > ele.l){
                undo_stack[stksz++] = make_pair(make_pair(id, 0), st[id][0]);
                st[id][0] = ele.l;  
                cnt++;
            }
        }
        else {
            if(st[id][1] < ele.r){
                undo_stack[stksz++] = make_pair(make_pair(id, 1), st[id][1]);
                st[id][1] = ele.r;
                cnt++;
            }
        }
    }
    else {
        int mid = (l+r)>>1;
        upd_st(ele, cnt, l, mid, id<<1);
        upd_st(ele, cnt, mid+1, r, id<<1|1);
    }
}

int query_st(int pos, int l = 0, int r = cp.size()-1, int id = 1){
    int re = max(st[id][1] - pos, pos - st[id][0]);
    if(l < r){
        int mid = (l + r)>>1;
        if(pos <= cp[mid])re = max(re, query_st(pos, l, mid, id<<1));
        else re = max(re, query_st(pos, mid+1, r, id<<1|1));
    }
    return re;
}

void time_add(int ql, int qr, const ev_upd &ele, int l = 0, int r = cpy.size()-1, int id = 1){
    // cout << ql << " " << qr << " " << ele.l << " " << ele.r << " " << ele.ty << endl;  
    if(ql > qr || ql > cpy[r] || qr < cpy[l])return;
    if(ql <= cpy[l] && cpy[r] <= qr)st_time[id].push_back(ele);
    else {
        int mid = (l+r)>>1;
        time_add(ql, qr, ele, l, mid, id<<1);
        time_add(ql, qr, ele, mid+1, r, id<<1|1);
    }
}

int sumcol[maxn];
int sumall = 0, ptr = 0;

void time_dfs(int l = 0, int r = cpy.size()-1, int id = 1){
    int cnt = 0;
    for(auto &ele: st_time[id])  {
        upd_st(ele, cnt);
    }
    if(l == r){
        while(ptr < ev.size() && ev[ptr].first <= cpy[l]){
            if(ev[ptr].second.first){
                sumcol[ty[ev[ptr].second.second]]--;
                if(!sumcol[ty[ev[ptr].second.second]])sumall--;
            }
            else {
                if(!sumcol[ty[ev[ptr].second.second]])sumall++;
                sumcol[ty[ev[ptr].second.second]]++;
            }
            ptr++;
        }
        // cout << sumall << endl;
        for(auto qq: leaf_q[l]){
            ans[qq.second] = sumall < k ? -1 : query_st(qq.first);
        }
    }
    else {
        int mid = (l+r)>>1;
        time_dfs(l, mid, id<<1);
        time_dfs(mid+1, r, id<<1|1);
    }
    for(int i = 0; i < cnt; i++){
        stksz--;
        st[undo_stack[stksz].first.first][undo_stack[stksz].first.second] = undo_stack[stksz].second;
    }
}


void add_range(int l, int r){
    if(l != -INF)last_time[l][0] = crrt;
    if(r != INF)last_time[r][1] = crrt;
}

void del_range(int l, int r){
    // return;
    if(l == -INF){
        ev_upd ele(-INF, p[r], 1);
        time_add(last_time[r][1], crrt-1, ele);
        last_time[r][1] = 0;
    }
    else if(r == INF){
        time_add(last_time[l][0], crrt-1, ev_upd(p[l], INF, 0));
        last_time[l][0] = 0;
    }
    else {
        int mid = (p[l]+p[r])/2;
        time_add(last_time[l][0], crrt-1, ev_upd(p[l], mid, 0));
        time_add(last_time[r][1], crrt-1, ev_upd(mid+1, p[r], 1));
        last_time[r][1] = 0;
        last_time[l][0] = 0;
    }
}

void add(int x, int col){
    // cout << x << endl;
    auto it = pos[col].insert(make_pair(p[x], x)).first;
    if(pos[col].size() == 1){
        add_range(-INF, x);
        add_range(x, INF);
    }
    else {
        if(next(it) == pos[col].end()){
            int prv = prev(it)->second;
            del_range(prv, INF);
            add_range(prv, x);
            add_range(x, INF);
        }
        else if(it == pos[col].begin()){
            int nxt = next(it)->second;
            del_range(-INF, nxt);
            add_range(-INF, x);
            add_range(x, nxt);
        }
        else {
            int prv = prev(it)->second;
            int nxt = next(it)->second;
            del_range(prv, nxt);
            add_range(prv, x);
            add_range(x, nxt);
        }
    }
}

void del(int x, int col){
    // cout << "DEL " << x << endl;
    auto it = pos[col].erase(pos[col].find(make_pair(p[x], x)));
    if(pos[col].size() == 0){
        del_range(-INF, x);
        del_range(x, INF);
    }
    else {
        if(it == pos[col].end()){
            int prv = prev(it)->second;
            del_range(x, INF);
            del_range(prv, x);
            add_range(prv, INF);
        }
        else if(it == pos[col].begin()){
            int nxt = it->second;
            del_range(-INF, x);
            del_range(x, nxt);
            add_range(-INF, nxt);
        }
        else {
            int prv = prev(it)->second;
            int nxt = it->second;
            del_range(x, nxt);
            del_range(prv, x);
            add_range(prv, nxt);
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> k >> q;
    for(int i = 0; i < 4*maxn; i++)st[i][0] = INF, st[i][1] = -INF;
    for(int i = 1; i <= n; i++){
        int a, b;
        cin >> p[i] >> ty[i] >> a >> b;
        ev.push_back({a, {0, i}});
        ev.push_back({b+1, {1, i}});
    }
    for(int i = 1; i <= q; i++){
        cin >> L[i] >> Y[i];
        cp.push_back(L[i]);
        cpy.push_back(Y[i]);
    }
    sort(cp.begin(), cp.end());
    cp.erase(unique(cp.begin(), cp.end()), cp.end());
    sort(cpy.begin(), cpy.end());
    cpy.erase(unique(cpy.begin(), cpy.end()), cpy.end()); 
    sort(ev.begin(), ev.end());
    for(int i = 1; i <= q; i++)leaf_q[lower_bound(cpy.begin(), cpy.end(), Y[i]) - cpy.begin()].push_back({L[i], i});
    for(auto v: ev){
        crrt = v.first;
        if(v.second.first)del(v.second.second, ty[v.second.second]);
        else add(v.second.second, ty[v.second.second]);
    }
    // cout << "SUS" << endl;  
    // if(n > 100000)return 0;
    time_dfs();
    for(int i = 1; i <= q; i++)cout << ans[i] << "\n";
    
}

Compilation message

new_home.cpp: In function 'void time_dfs(int, int, int)':
new_home.cpp:92:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |         while(ptr < ev.size() && ev[ptr].first <= cpy[l]){
      |               ~~~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 80724 KB Output is correct
2 Correct 23 ms 80732 KB Output is correct
3 Correct 23 ms 80744 KB Output is correct
4 Correct 23 ms 80732 KB Output is correct
5 Correct 25 ms 80740 KB Output is correct
6 Correct 26 ms 80980 KB Output is correct
7 Correct 23 ms 80728 KB Output is correct
8 Correct 25 ms 80816 KB Output is correct
9 Correct 24 ms 80732 KB Output is correct
10 Correct 25 ms 80984 KB Output is correct
11 Correct 24 ms 80732 KB Output is correct
12 Correct 24 ms 80916 KB Output is correct
13 Correct 24 ms 80724 KB Output is correct
14 Correct 24 ms 80756 KB Output is correct
15 Correct 23 ms 80988 KB Output is correct
16 Correct 23 ms 80888 KB Output is correct
17 Correct 26 ms 80732 KB Output is correct
18 Correct 24 ms 80984 KB Output is correct
19 Correct 25 ms 80932 KB Output is correct
20 Correct 23 ms 80728 KB Output is correct
21 Correct 22 ms 80820 KB Output is correct
22 Correct 24 ms 80988 KB Output is correct
23 Correct 25 ms 80804 KB Output is correct
24 Correct 26 ms 80988 KB Output is correct
25 Correct 23 ms 80988 KB Output is correct
26 Correct 23 ms 80720 KB Output is correct
27 Correct 26 ms 80732 KB Output is correct
28 Correct 24 ms 80732 KB Output is correct
29 Correct 23 ms 80640 KB Output is correct
30 Correct 24 ms 80732 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 80724 KB Output is correct
2 Correct 23 ms 80732 KB Output is correct
3 Correct 23 ms 80744 KB Output is correct
4 Correct 23 ms 80732 KB Output is correct
5 Correct 25 ms 80740 KB Output is correct
6 Correct 26 ms 80980 KB Output is correct
7 Correct 23 ms 80728 KB Output is correct
8 Correct 25 ms 80816 KB Output is correct
9 Correct 24 ms 80732 KB Output is correct
10 Correct 25 ms 80984 KB Output is correct
11 Correct 24 ms 80732 KB Output is correct
12 Correct 24 ms 80916 KB Output is correct
13 Correct 24 ms 80724 KB Output is correct
14 Correct 24 ms 80756 KB Output is correct
15 Correct 23 ms 80988 KB Output is correct
16 Correct 23 ms 80888 KB Output is correct
17 Correct 26 ms 80732 KB Output is correct
18 Correct 24 ms 80984 KB Output is correct
19 Correct 25 ms 80932 KB Output is correct
20 Correct 23 ms 80728 KB Output is correct
21 Correct 22 ms 80820 KB Output is correct
22 Correct 24 ms 80988 KB Output is correct
23 Correct 25 ms 80804 KB Output is correct
24 Correct 26 ms 80988 KB Output is correct
25 Correct 23 ms 80988 KB Output is correct
26 Correct 23 ms 80720 KB Output is correct
27 Correct 26 ms 80732 KB Output is correct
28 Correct 24 ms 80732 KB Output is correct
29 Correct 23 ms 80640 KB Output is correct
30 Correct 24 ms 80732 KB Output is correct
31 Correct 1551 ms 159968 KB Output is correct
32 Correct 105 ms 92608 KB Output is correct
33 Correct 1148 ms 153864 KB Output is correct
34 Correct 1418 ms 153684 KB Output is correct
35 Correct 1466 ms 160224 KB Output is correct
36 Correct 1214 ms 159176 KB Output is correct
37 Correct 923 ms 141192 KB Output is correct
38 Correct 769 ms 141004 KB Output is correct
39 Correct 496 ms 122348 KB Output is correct
40 Correct 543 ms 126880 KB Output is correct
41 Correct 716 ms 122308 KB Output is correct
42 Correct 724 ms 123600 KB Output is correct
43 Correct 71 ms 91896 KB Output is correct
44 Correct 686 ms 120636 KB Output is correct
45 Correct 550 ms 113692 KB Output is correct
46 Correct 311 ms 100796 KB Output is correct
47 Correct 215 ms 99888 KB Output is correct
48 Correct 186 ms 97476 KB Output is correct
49 Correct 309 ms 105400 KB Output is correct
50 Correct 475 ms 117868 KB Output is correct
51 Correct 278 ms 102024 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 792 ms 162516 KB Output is correct
2 Correct 847 ms 152908 KB Output is correct
3 Correct 649 ms 155256 KB Output is correct
4 Correct 790 ms 161660 KB Output is correct
5 Correct 828 ms 151200 KB Output is correct
6 Correct 787 ms 151160 KB Output is correct
7 Correct 587 ms 153608 KB Output is correct
8 Correct 695 ms 159732 KB Output is correct
9 Correct 720 ms 160940 KB Output is correct
10 Correct 767 ms 159732 KB Output is correct
11 Correct 536 ms 153364 KB Output is correct
12 Correct 612 ms 158916 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 80724 KB Output is correct
2 Correct 23 ms 80732 KB Output is correct
3 Correct 23 ms 80744 KB Output is correct
4 Correct 23 ms 80732 KB Output is correct
5 Correct 25 ms 80740 KB Output is correct
6 Correct 26 ms 80980 KB Output is correct
7 Correct 23 ms 80728 KB Output is correct
8 Correct 25 ms 80816 KB Output is correct
9 Correct 24 ms 80732 KB Output is correct
10 Correct 25 ms 80984 KB Output is correct
11 Correct 24 ms 80732 KB Output is correct
12 Correct 24 ms 80916 KB Output is correct
13 Correct 24 ms 80724 KB Output is correct
14 Correct 24 ms 80756 KB Output is correct
15 Correct 23 ms 80988 KB Output is correct
16 Correct 23 ms 80888 KB Output is correct
17 Correct 26 ms 80732 KB Output is correct
18 Correct 24 ms 80984 KB Output is correct
19 Correct 25 ms 80932 KB Output is correct
20 Correct 23 ms 80728 KB Output is correct
21 Correct 22 ms 80820 KB Output is correct
22 Correct 24 ms 80988 KB Output is correct
23 Correct 25 ms 80804 KB Output is correct
24 Correct 26 ms 80988 KB Output is correct
25 Correct 23 ms 80988 KB Output is correct
26 Correct 23 ms 80720 KB Output is correct
27 Correct 26 ms 80732 KB Output is correct
28 Correct 24 ms 80732 KB Output is correct
29 Correct 23 ms 80640 KB Output is correct
30 Correct 24 ms 80732 KB Output is correct
31 Correct 1551 ms 159968 KB Output is correct
32 Correct 105 ms 92608 KB Output is correct
33 Correct 1148 ms 153864 KB Output is correct
34 Correct 1418 ms 153684 KB Output is correct
35 Correct 1466 ms 160224 KB Output is correct
36 Correct 1214 ms 159176 KB Output is correct
37 Correct 923 ms 141192 KB Output is correct
38 Correct 769 ms 141004 KB Output is correct
39 Correct 496 ms 122348 KB Output is correct
40 Correct 543 ms 126880 KB Output is correct
41 Correct 716 ms 122308 KB Output is correct
42 Correct 724 ms 123600 KB Output is correct
43 Correct 71 ms 91896 KB Output is correct
44 Correct 686 ms 120636 KB Output is correct
45 Correct 550 ms 113692 KB Output is correct
46 Correct 311 ms 100796 KB Output is correct
47 Correct 215 ms 99888 KB Output is correct
48 Correct 186 ms 97476 KB Output is correct
49 Correct 309 ms 105400 KB Output is correct
50 Correct 475 ms 117868 KB Output is correct
51 Correct 278 ms 102024 KB Output is correct
52 Correct 485 ms 118092 KB Output is correct
53 Correct 438 ms 114884 KB Output is correct
54 Correct 1016 ms 140784 KB Output is correct
55 Correct 674 ms 127940 KB Output is correct
56 Correct 647 ms 127244 KB Output is correct
57 Correct 721 ms 123588 KB Output is correct
58 Correct 670 ms 123984 KB Output is correct
59 Correct 624 ms 123640 KB Output is correct
60 Correct 705 ms 123704 KB Output is correct
61 Correct 74 ms 92212 KB Output is correct
62 Correct 500 ms 121216 KB Output is correct
63 Correct 824 ms 133056 KB Output is correct
64 Correct 912 ms 135876 KB Output is correct
65 Correct 998 ms 137344 KB Output is correct
66 Correct 798 ms 127376 KB Output is correct
67 Correct 134 ms 94144 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 80724 KB Output is correct
2 Correct 23 ms 80732 KB Output is correct
3 Correct 23 ms 80744 KB Output is correct
4 Correct 23 ms 80732 KB Output is correct
5 Correct 25 ms 80740 KB Output is correct
6 Correct 26 ms 80980 KB Output is correct
7 Correct 23 ms 80728 KB Output is correct
8 Correct 25 ms 80816 KB Output is correct
9 Correct 24 ms 80732 KB Output is correct
10 Correct 25 ms 80984 KB Output is correct
11 Correct 24 ms 80732 KB Output is correct
12 Correct 24 ms 80916 KB Output is correct
13 Correct 24 ms 80724 KB Output is correct
14 Correct 24 ms 80756 KB Output is correct
15 Correct 23 ms 80988 KB Output is correct
16 Correct 23 ms 80888 KB Output is correct
17 Correct 26 ms 80732 KB Output is correct
18 Correct 24 ms 80984 KB Output is correct
19 Correct 25 ms 80932 KB Output is correct
20 Correct 23 ms 80728 KB Output is correct
21 Correct 22 ms 80820 KB Output is correct
22 Correct 24 ms 80988 KB Output is correct
23 Correct 25 ms 80804 KB Output is correct
24 Correct 26 ms 80988 KB Output is correct
25 Correct 23 ms 80988 KB Output is correct
26 Correct 23 ms 80720 KB Output is correct
27 Correct 26 ms 80732 KB Output is correct
28 Correct 24 ms 80732 KB Output is correct
29 Correct 23 ms 80640 KB Output is correct
30 Correct 24 ms 80732 KB Output is correct
31 Correct 1551 ms 159968 KB Output is correct
32 Correct 105 ms 92608 KB Output is correct
33 Correct 1148 ms 153864 KB Output is correct
34 Correct 1418 ms 153684 KB Output is correct
35 Correct 1466 ms 160224 KB Output is correct
36 Correct 1214 ms 159176 KB Output is correct
37 Correct 923 ms 141192 KB Output is correct
38 Correct 769 ms 141004 KB Output is correct
39 Correct 496 ms 122348 KB Output is correct
40 Correct 543 ms 126880 KB Output is correct
41 Correct 716 ms 122308 KB Output is correct
42 Correct 724 ms 123600 KB Output is correct
43 Correct 71 ms 91896 KB Output is correct
44 Correct 686 ms 120636 KB Output is correct
45 Correct 550 ms 113692 KB Output is correct
46 Correct 311 ms 100796 KB Output is correct
47 Correct 215 ms 99888 KB Output is correct
48 Correct 186 ms 97476 KB Output is correct
49 Correct 309 ms 105400 KB Output is correct
50 Correct 475 ms 117868 KB Output is correct
51 Correct 278 ms 102024 KB Output is correct
52 Correct 792 ms 162516 KB Output is correct
53 Correct 847 ms 152908 KB Output is correct
54 Correct 649 ms 155256 KB Output is correct
55 Correct 790 ms 161660 KB Output is correct
56 Correct 828 ms 151200 KB Output is correct
57 Correct 787 ms 151160 KB Output is correct
58 Correct 587 ms 153608 KB Output is correct
59 Correct 695 ms 159732 KB Output is correct
60 Correct 720 ms 160940 KB Output is correct
61 Correct 767 ms 159732 KB Output is correct
62 Correct 536 ms 153364 KB Output is correct
63 Correct 612 ms 158916 KB Output is correct
64 Execution timed out 5104 ms 344544 KB Time limit exceeded
65 Halted 0 ms 0 KB -