oj.uz

답안 #968762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
968762 2024-04-24T03:51:21 Z socpite 새 집 (APIO18_new_home) C++14
57 / 100
 5000 ms 573084 KB 
#include<bits/stdc++.h>
using namespace std;

const int maxn = 3e5+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, val, ty;
    ev_upd(int _l, int _r, int _val, int _ty): l(_l), r(_r), val(_val), ty(_ty){};
    bool operator<(const ev_upd &b)const {
        return tie(l, r, val, ty) < tie(b.l, b.r, b.val, b.ty);
    }
};

map<ev_upd, vector<int>> mp;
map<int, vector<pair<int, int>>> leaf_q;  
multiset<int> pos[maxn];

vector<ev_upd> st_time[4*maxn];

int crrt;

vector<pair<pair<int, int>, int>> undo_stack;

// 0 is min, 1 is max

void upd_st(const ev_upd &ele, int &cnt, int l = 0, int r = cp.size()-1, int id = 1){
    if(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.val){
                undo_stack.push_back({{id, 0}, st[id][0]});
                st[id][0] = ele.val;
                cnt++;
            }
        }
        else {
            if(st[id][1] < ele.val){
                undo_stack.push_back({{id, 1}, st[id][1]});
                st[id][1] = ele.val;
                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){
    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[cpy[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++){
        st[undo_stack.back().first.first][undo_stack.back().first.second] = undo_stack.back().second;
        undo_stack.pop_back();
    }
}

void add_st(int l, int r, int val, int ty){
    if(l > r)return;
    mp[ev_upd(l, r, val, ty)].push_back(crrt);
}

void del_st(int l, int r, int val, int ty){
    if(l > r)return;
    ev_upd ele(l, r, val, ty);
    time_add(mp[ele].back(), crrt - 1, ele);
    mp[ele].pop_back();
}

void add_range(int l, int r){
    if(l == -INF)add_st(-INF, r, r, 1);
    else if(r == INF)add_st(l+1, INF, l, 0);
    else {
        int mid = (l+r)/2;
        add_st(l+1, mid, l, 0);
        add_st(mid+1, r, r, 1);
    }
}

void del_range(int l, int r){
    if(l == -INF)del_st(-INF, r, r, 1);
    else if(r == INF)del_st(l+1, INF, l, 0);
    else {
        int mid = (l+r)/2;
        del_st(l+1, mid, l, 0);
        del_st(mid+1, r, r, 1);
    }
}

void add(int x, int col){
    auto it = pos[col].insert(x);
    if(pos[col].size() == 1){
        add_range(-INF, x);
        add_range(x, INF);
    }
    else {
        if(next(it) == pos[col].end()){
            del_range(*prev(it), INF);
            add_range(*prev(it), x);
            add_range(x, INF);
        }
        else if(it == pos[col].begin()){
            del_range(-INF, *next(it));
            add_range(-INF, x);
            add_range(x, *next(it));
        }
        else {
            del_range(*prev(it), *next(it));
            add_range(*prev(it), *it);
            add_range(*it, *next(it));
        }
    }
}

void del(int x, int col){
    auto it = pos[col].erase(pos[col].find(x));
    if(pos[col].size() == 0){
        del_range(-INF, x);
        del_range(x, INF);
    }
    else {
        if(it == pos[col].end()){
            del_range(x, INF);
            del_range(*prev(it), x);
            add_range(*prev(it), INF);
        }
        else if(it == pos[col].begin()){
            del_range(-INF, x);
            del_range(x, *it);
            add_range(-INF, *it);
        }
        else {
            del_range(x, *it);
            del_range(*prev(it), x);
            add_range(*prev(it), *it);
        }
    }
}

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]);
        leaf_q[Y[i]].push_back({L[i], 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(auto v: ev){
        crrt = v.first;
        if(v.second.first)del(p[v.second.second], ty[v.second.second]);
        else add(p[v.second.second], ty[v.second.second]);
    }
    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:91: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]
   91 |         while(ptr < ev.size() && ev[ptr].first <= cpy[l]){
      |               ~~~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 57692 KB Output is correct
2 Correct 13 ms 57692 KB Output is correct
3 Correct 13 ms 57692 KB Output is correct
4 Correct 13 ms 57840 KB Output is correct
5 Correct 14 ms 57948 KB Output is correct
6 Correct 16 ms 58204 KB Output is correct
7 Correct 14 ms 58204 KB Output is correct
8 Correct 15 ms 58204 KB Output is correct
9 Correct 15 ms 58204 KB Output is correct
10 Correct 17 ms 58460 KB Output is correct
11 Correct 14 ms 58248 KB Output is correct
12 Correct 16 ms 58204 KB Output is correct
13 Correct 14 ms 58112 KB Output is correct
14 Correct 14 ms 57956 KB Output is correct
15 Correct 15 ms 58204 KB Output is correct
16 Correct 14 ms 58204 KB Output is correct
17 Correct 15 ms 58200 KB Output is correct
18 Correct 15 ms 58204 KB Output is correct
19 Correct 15 ms 58088 KB Output is correct
20 Correct 15 ms 58184 KB Output is correct
21 Correct 12 ms 57944 KB Output is correct
22 Correct 13 ms 58204 KB Output is correct
23 Correct 14 ms 58184 KB Output is correct
24 Correct 15 ms 58228 KB Output is correct
25 Correct 15 ms 58204 KB Output is correct
26 Correct 14 ms 58200 KB Output is correct
27 Correct 14 ms 57948 KB Output is correct
28 Correct 16 ms 58204 KB Output is correct
29 Correct 14 ms 58204 KB Output is correct
30 Correct 14 ms 57948 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 57692 KB Output is correct
2 Correct 13 ms 57692 KB Output is correct
3 Correct 13 ms 57692 KB Output is correct
4 Correct 13 ms 57840 KB Output is correct
5 Correct 14 ms 57948 KB Output is correct
6 Correct 16 ms 58204 KB Output is correct
7 Correct 14 ms 58204 KB Output is correct
8 Correct 15 ms 58204 KB Output is correct
9 Correct 15 ms 58204 KB Output is correct
10 Correct 17 ms 58460 KB Output is correct
11 Correct 14 ms 58248 KB Output is correct
12 Correct 16 ms 58204 KB Output is correct
13 Correct 14 ms 58112 KB Output is correct
14 Correct 14 ms 57956 KB Output is correct
15 Correct 15 ms 58204 KB Output is correct
16 Correct 14 ms 58204 KB Output is correct
17 Correct 15 ms 58200 KB Output is correct
18 Correct 15 ms 58204 KB Output is correct
19 Correct 15 ms 58088 KB Output is correct
20 Correct 15 ms 58184 KB Output is correct
21 Correct 12 ms 57944 KB Output is correct
22 Correct 13 ms 58204 KB Output is correct
23 Correct 14 ms 58184 KB Output is correct
24 Correct 15 ms 58228 KB Output is correct
25 Correct 15 ms 58204 KB Output is correct
26 Correct 14 ms 58200 KB Output is correct
27 Correct 14 ms 57948 KB Output is correct
28 Correct 16 ms 58204 KB Output is correct
29 Correct 14 ms 58204 KB Output is correct
30 Correct 14 ms 57948 KB Output is correct
31 Correct 2275 ms 199912 KB Output is correct
32 Correct 81 ms 62652 KB Output is correct
33 Correct 1788 ms 189528 KB Output is correct
34 Correct 2068 ms 187604 KB Output is correct
35 Correct 2219 ms 200044 KB Output is correct
36 Correct 1874 ms 198268 KB Output is correct
37 Correct 1272 ms 173496 KB Output is correct
38 Correct 1099 ms 173388 KB Output is correct
39 Correct 749 ms 148704 KB Output is correct
40 Correct 774 ms 155076 KB Output is correct
41 Correct 1106 ms 140664 KB Output is correct
42 Correct 1110 ms 142496 KB Output is correct
43 Correct 54 ms 65220 KB Output is correct
44 Correct 1073 ms 138440 KB Output is correct
45 Correct 930 ms 129224 KB Output is correct
46 Correct 652 ms 112156 KB Output is correct
47 Correct 351 ms 106500 KB Output is correct
48 Correct 338 ms 104408 KB Output is correct
49 Correct 485 ms 116712 KB Output is correct
50 Correct 687 ms 132872 KB Output is correct
51 Correct 474 ms 112228 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4225 ms 302816 KB Output is correct
2 Correct 4792 ms 347408 KB Output is correct
3 Correct 1836 ms 224100 KB Output is correct
4 Correct 3645 ms 285868 KB Output is correct
5 Correct 3557 ms 327460 KB Output is correct
6 Correct 4414 ms 342504 KB Output is correct
7 Correct 1733 ms 227208 KB Output is correct
8 Correct 3098 ms 284644 KB Output is correct
9 Correct 3725 ms 319500 KB Output is correct
10 Correct 4334 ms 358060 KB Output is correct
11 Correct 1757 ms 350604 KB Output is correct
12 Correct 2025 ms 350056 KB Output is correct

Subtask #4
0 / 23.0

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

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 57692 KB Output is correct
2 Correct 13 ms 57692 KB Output is correct
3 Correct 13 ms 57692 KB Output is correct
4 Correct 13 ms 57840 KB Output is correct
5 Correct 14 ms 57948 KB Output is correct
6 Correct 16 ms 58204 KB Output is correct
7 Correct 14 ms 58204 KB Output is correct
8 Correct 15 ms 58204 KB Output is correct
9 Correct 15 ms 58204 KB Output is correct
10 Correct 17 ms 58460 KB Output is correct
11 Correct 14 ms 58248 KB Output is correct
12 Correct 16 ms 58204 KB Output is correct
13 Correct 14 ms 58112 KB Output is correct
14 Correct 14 ms 57956 KB Output is correct
15 Correct 15 ms 58204 KB Output is correct
16 Correct 14 ms 58204 KB Output is correct
17 Correct 15 ms 58200 KB Output is correct
18 Correct 15 ms 58204 KB Output is correct
19 Correct 15 ms 58088 KB Output is correct
20 Correct 15 ms 58184 KB Output is correct
21 Correct 12 ms 57944 KB Output is correct
22 Correct 13 ms 58204 KB Output is correct
23 Correct 14 ms 58184 KB Output is correct
24 Correct 15 ms 58228 KB Output is correct
25 Correct 15 ms 58204 KB Output is correct
26 Correct 14 ms 58200 KB Output is correct
27 Correct 14 ms 57948 KB Output is correct
28 Correct 16 ms 58204 KB Output is correct
29 Correct 14 ms 58204 KB Output is correct
30 Correct 14 ms 57948 KB Output is correct
31 Correct 2275 ms 199912 KB Output is correct
32 Correct 81 ms 62652 KB Output is correct
33 Correct 1788 ms 189528 KB Output is correct
34 Correct 2068 ms 187604 KB Output is correct
35 Correct 2219 ms 200044 KB Output is correct
36 Correct 1874 ms 198268 KB Output is correct
37 Correct 1272 ms 173496 KB Output is correct
38 Correct 1099 ms 173388 KB Output is correct
39 Correct 749 ms 148704 KB Output is correct
40 Correct 774 ms 155076 KB Output is correct
41 Correct 1106 ms 140664 KB Output is correct
42 Correct 1110 ms 142496 KB Output is correct
43 Correct 54 ms 65220 KB Output is correct
44 Correct 1073 ms 138440 KB Output is correct
45 Correct 930 ms 129224 KB Output is correct
46 Correct 652 ms 112156 KB Output is correct
47 Correct 351 ms 106500 KB Output is correct
48 Correct 338 ms 104408 KB Output is correct
49 Correct 485 ms 116712 KB Output is correct
50 Correct 687 ms 132872 KB Output is correct
51 Correct 474 ms 112228 KB Output is correct
52 Correct 647 ms 121944 KB Output is correct
53 Correct 639 ms 116208 KB Output is correct
54 Correct 1464 ms 161632 KB Output is correct
55 Correct 1037 ms 142768 KB Output is correct
56 Correct 962 ms 139972 KB Output is correct
57 Correct 1071 ms 141184 KB Output is correct
58 Correct 1004 ms 138212 KB Output is correct
59 Correct 936 ms 135204 KB Output is correct
60 Correct 1117 ms 141620 KB Output is correct
61 Correct 58 ms 69248 KB Output is correct
62 Correct 650 ms 127572 KB Output is correct
63 Correct 1156 ms 147256 KB Output is correct
64 Correct 1286 ms 152252 KB Output is correct
65 Correct 1534 ms 158404 KB Output is correct
66 Correct 1236 ms 147124 KB Output is correct
67 Correct 139 ms 67520 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 57692 KB Output is correct
2 Correct 13 ms 57692 KB Output is correct
3 Correct 13 ms 57692 KB Output is correct
4 Correct 13 ms 57840 KB Output is correct
5 Correct 14 ms 57948 KB Output is correct
6 Correct 16 ms 58204 KB Output is correct
7 Correct 14 ms 58204 KB Output is correct
8 Correct 15 ms 58204 KB Output is correct
9 Correct 15 ms 58204 KB Output is correct
10 Correct 17 ms 58460 KB Output is correct
11 Correct 14 ms 58248 KB Output is correct
12 Correct 16 ms 58204 KB Output is correct
13 Correct 14 ms 58112 KB Output is correct
14 Correct 14 ms 57956 KB Output is correct
15 Correct 15 ms 58204 KB Output is correct
16 Correct 14 ms 58204 KB Output is correct
17 Correct 15 ms 58200 KB Output is correct
18 Correct 15 ms 58204 KB Output is correct
19 Correct 15 ms 58088 KB Output is correct
20 Correct 15 ms 58184 KB Output is correct
21 Correct 12 ms 57944 KB Output is correct
22 Correct 13 ms 58204 KB Output is correct
23 Correct 14 ms 58184 KB Output is correct
24 Correct 15 ms 58228 KB Output is correct
25 Correct 15 ms 58204 KB Output is correct
26 Correct 14 ms 58200 KB Output is correct
27 Correct 14 ms 57948 KB Output is correct
28 Correct 16 ms 58204 KB Output is correct
29 Correct 14 ms 58204 KB Output is correct
30 Correct 14 ms 57948 KB Output is correct
31 Correct 2275 ms 199912 KB Output is correct
32 Correct 81 ms 62652 KB Output is correct
33 Correct 1788 ms 189528 KB Output is correct
34 Correct 2068 ms 187604 KB Output is correct
35 Correct 2219 ms 200044 KB Output is correct
36 Correct 1874 ms 198268 KB Output is correct
37 Correct 1272 ms 173496 KB Output is correct
38 Correct 1099 ms 173388 KB Output is correct
39 Correct 749 ms 148704 KB Output is correct
40 Correct 774 ms 155076 KB Output is correct
41 Correct 1106 ms 140664 KB Output is correct
42 Correct 1110 ms 142496 KB Output is correct
43 Correct 54 ms 65220 KB Output is correct
44 Correct 1073 ms 138440 KB Output is correct
45 Correct 930 ms 129224 KB Output is correct
46 Correct 652 ms 112156 KB Output is correct
47 Correct 351 ms 106500 KB Output is correct
48 Correct 338 ms 104408 KB Output is correct
49 Correct 485 ms 116712 KB Output is correct
50 Correct 687 ms 132872 KB Output is correct
51 Correct 474 ms 112228 KB Output is correct
52 Correct 4225 ms 302816 KB Output is correct
53 Correct 4792 ms 347408 KB Output is correct
54 Correct 1836 ms 224100 KB Output is correct
55 Correct 3645 ms 285868 KB Output is correct
56 Correct 3557 ms 327460 KB Output is correct
57 Correct 4414 ms 342504 KB Output is correct
58 Correct 1733 ms 227208 KB Output is correct
59 Correct 3098 ms 284644 KB Output is correct
60 Correct 3725 ms 319500 KB Output is correct
61 Correct 4334 ms 358060 KB Output is correct
62 Correct 1757 ms 350604 KB Output is correct
63 Correct 2025 ms 350056 KB Output is correct
64 Execution timed out 5120 ms 573084 KB Time limit exceeded
65 Halted 0 ms 0 KB -