oj.uz

Submission #968758

# Submission time Handle Problem Language Result Execution time Memory
968758 2024-04-24T03:49:02 Z socpite New Home (APIO18_new_home) C++14
57 / 100
 5000 ms 524348 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>, pair<int, int>>> undo_stack;

// 0 is min, 1 is max

void upd_st(const ev_upd &ele, int nodeid, 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({{nodeid, st[id][0]}, {id, 0}});
                st[id][0] = ele.val;
            }
        }
        else {
            if(st[id][1] < ele.val){
                undo_stack.push_back({{nodeid, st[id][1]}, {id, 1}});
                st[id][1] = ele.val;
            }
        }
    }
    else {
        int mid = (l+r)>>1;
        upd_st(ele, nodeid, l, mid, id<<1);
        upd_st(ele, nodeid, 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){
    for(auto ele: st_time[id])  {
        upd_st(ele, id);
    }
    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);
    }
    while(!undo_stack.empty() && undo_stack.back().first.first == id){
        st[undo_stack.back().second.first][undo_stack.back().second.second] = undo_stack.back().first.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:88: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]
   88 |         while(ptr < ev.size() && ev[ptr].first <= cpy[l]){
      |               ~~~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 57688 KB Output is correct
2 Correct 12 ms 57692 KB Output is correct
3 Correct 12 ms 57692 KB Output is correct
4 Correct 12 ms 57692 KB Output is correct
5 Correct 13 ms 57988 KB Output is correct
6 Correct 17 ms 58416 KB Output is correct
7 Correct 15 ms 58204 KB Output is correct
8 Correct 16 ms 58204 KB Output is correct
9 Correct 15 ms 58204 KB Output is correct
10 Correct 17 ms 58568 KB Output is correct
11 Correct 16 ms 58204 KB Output is correct
12 Correct 14 ms 58332 KB Output is correct
13 Correct 15 ms 57984 KB Output is correct
14 Correct 14 ms 58180 KB Output is correct
15 Correct 16 ms 58132 KB Output is correct
16 Correct 16 ms 58168 KB Output is correct
17 Correct 16 ms 58160 KB Output is correct
18 Correct 15 ms 58204 KB Output is correct
19 Correct 15 ms 58348 KB Output is correct
20 Correct 15 ms 58364 KB Output is correct
21 Correct 13 ms 57948 KB Output is correct
22 Correct 14 ms 58204 KB Output is correct
23 Correct 18 ms 58200 KB Output is correct
24 Correct 17 ms 58204 KB Output is correct
25 Correct 16 ms 58204 KB Output is correct
26 Correct 14 ms 58204 KB Output is correct
27 Correct 14 ms 57944 KB Output is correct
28 Correct 14 ms 58204 KB Output is correct
29 Correct 14 ms 58200 KB Output is correct
30 Correct 16 ms 57948 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 57688 KB Output is correct
2 Correct 12 ms 57692 KB Output is correct
3 Correct 12 ms 57692 KB Output is correct
4 Correct 12 ms 57692 KB Output is correct
5 Correct 13 ms 57988 KB Output is correct
6 Correct 17 ms 58416 KB Output is correct
7 Correct 15 ms 58204 KB Output is correct
8 Correct 16 ms 58204 KB Output is correct
9 Correct 15 ms 58204 KB Output is correct
10 Correct 17 ms 58568 KB Output is correct
11 Correct 16 ms 58204 KB Output is correct
12 Correct 14 ms 58332 KB Output is correct
13 Correct 15 ms 57984 KB Output is correct
14 Correct 14 ms 58180 KB Output is correct
15 Correct 16 ms 58132 KB Output is correct
16 Correct 16 ms 58168 KB Output is correct
17 Correct 16 ms 58160 KB Output is correct
18 Correct 15 ms 58204 KB Output is correct
19 Correct 15 ms 58348 KB Output is correct
20 Correct 15 ms 58364 KB Output is correct
21 Correct 13 ms 57948 KB Output is correct
22 Correct 14 ms 58204 KB Output is correct
23 Correct 18 ms 58200 KB Output is correct
24 Correct 17 ms 58204 KB Output is correct
25 Correct 16 ms 58204 KB Output is correct
26 Correct 14 ms 58204 KB Output is correct
27 Correct 14 ms 57944 KB Output is correct
28 Correct 14 ms 58204 KB Output is correct
29 Correct 14 ms 58200 KB Output is correct
30 Correct 16 ms 57948 KB Output is correct
31 Correct 2330 ms 202084 KB Output is correct
32 Correct 81 ms 62664 KB Output is correct
33 Correct 1855 ms 189808 KB Output is correct
34 Correct 2186 ms 189776 KB Output is correct
35 Correct 2192 ms 202260 KB Output is correct
36 Correct 1864 ms 198968 KB Output is correct
37 Correct 1257 ms 173432 KB Output is correct
38 Correct 1061 ms 173268 KB Output is correct
39 Correct 756 ms 148928 KB Output is correct
40 Correct 795 ms 153512 KB Output is correct
41 Correct 1128 ms 138932 KB Output is correct
42 Correct 1155 ms 140896 KB Output is correct
43 Correct 54 ms 63688 KB Output is correct
44 Correct 1155 ms 136748 KB Output is correct
45 Correct 919 ms 127432 KB Output is correct
46 Correct 673 ms 110236 KB Output is correct
47 Correct 358 ms 105036 KB Output is correct
48 Correct 347 ms 102848 KB Output is correct
49 Correct 486 ms 115096 KB Output is correct
50 Correct 703 ms 130956 KB Output is correct
51 Correct 493 ms 111016 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4235 ms 291124 KB Output is correct
2 Correct 4800 ms 338936 KB Output is correct
3 Correct 1839 ms 229700 KB Output is correct
4 Correct 3703 ms 286176 KB Output is correct
5 Correct 3498 ms 333656 KB Output is correct
6 Correct 4446 ms 349768 KB Output is correct
7 Correct 1779 ms 229952 KB Output is correct
8 Correct 3042 ms 283324 KB Output is correct
9 Correct 3746 ms 317376 KB Output is correct
10 Correct 4345 ms 353020 KB Output is correct
11 Correct 1783 ms 345184 KB Output is correct
12 Correct 2003 ms 347816 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5109 ms 524348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 57688 KB Output is correct
2 Correct 12 ms 57692 KB Output is correct
3 Correct 12 ms 57692 KB Output is correct
4 Correct 12 ms 57692 KB Output is correct
5 Correct 13 ms 57988 KB Output is correct
6 Correct 17 ms 58416 KB Output is correct
7 Correct 15 ms 58204 KB Output is correct
8 Correct 16 ms 58204 KB Output is correct
9 Correct 15 ms 58204 KB Output is correct
10 Correct 17 ms 58568 KB Output is correct
11 Correct 16 ms 58204 KB Output is correct
12 Correct 14 ms 58332 KB Output is correct
13 Correct 15 ms 57984 KB Output is correct
14 Correct 14 ms 58180 KB Output is correct
15 Correct 16 ms 58132 KB Output is correct
16 Correct 16 ms 58168 KB Output is correct
17 Correct 16 ms 58160 KB Output is correct
18 Correct 15 ms 58204 KB Output is correct
19 Correct 15 ms 58348 KB Output is correct
20 Correct 15 ms 58364 KB Output is correct
21 Correct 13 ms 57948 KB Output is correct
22 Correct 14 ms 58204 KB Output is correct
23 Correct 18 ms 58200 KB Output is correct
24 Correct 17 ms 58204 KB Output is correct
25 Correct 16 ms 58204 KB Output is correct
26 Correct 14 ms 58204 KB Output is correct
27 Correct 14 ms 57944 KB Output is correct
28 Correct 14 ms 58204 KB Output is correct
29 Correct 14 ms 58200 KB Output is correct
30 Correct 16 ms 57948 KB Output is correct
31 Correct 2330 ms 202084 KB Output is correct
32 Correct 81 ms 62664 KB Output is correct
33 Correct 1855 ms 189808 KB Output is correct
34 Correct 2186 ms 189776 KB Output is correct
35 Correct 2192 ms 202260 KB Output is correct
36 Correct 1864 ms 198968 KB Output is correct
37 Correct 1257 ms 173432 KB Output is correct
38 Correct 1061 ms 173268 KB Output is correct
39 Correct 756 ms 148928 KB Output is correct
40 Correct 795 ms 153512 KB Output is correct
41 Correct 1128 ms 138932 KB Output is correct
42 Correct 1155 ms 140896 KB Output is correct
43 Correct 54 ms 63688 KB Output is correct
44 Correct 1155 ms 136748 KB Output is correct
45 Correct 919 ms 127432 KB Output is correct
46 Correct 673 ms 110236 KB Output is correct
47 Correct 358 ms 105036 KB Output is correct
48 Correct 347 ms 102848 KB Output is correct
49 Correct 486 ms 115096 KB Output is correct
50 Correct 703 ms 130956 KB Output is correct
51 Correct 493 ms 111016 KB Output is correct
52 Correct 676 ms 124616 KB Output is correct
53 Correct 622 ms 117184 KB Output is correct
54 Correct 1446 ms 165360 KB Output is correct
55 Correct 1002 ms 143124 KB Output is correct
56 Correct 941 ms 140484 KB Output is correct
57 Correct 1096 ms 141252 KB Output is correct
58 Correct 1006 ms 138436 KB Output is correct
59 Correct 955 ms 136116 KB Output is correct
60 Correct 1130 ms 142064 KB Output is correct
61 Correct 57 ms 68804 KB Output is correct
62 Correct 673 ms 127824 KB Output is correct
63 Correct 1270 ms 148732 KB Output is correct
64 Correct 1332 ms 155992 KB Output is correct
65 Correct 1528 ms 159224 KB Output is correct
66 Correct 1245 ms 147360 KB Output is correct
67 Correct 140 ms 67424 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 57688 KB Output is correct
2 Correct 12 ms 57692 KB Output is correct
3 Correct 12 ms 57692 KB Output is correct
4 Correct 12 ms 57692 KB Output is correct
5 Correct 13 ms 57988 KB Output is correct
6 Correct 17 ms 58416 KB Output is correct
7 Correct 15 ms 58204 KB Output is correct
8 Correct 16 ms 58204 KB Output is correct
9 Correct 15 ms 58204 KB Output is correct
10 Correct 17 ms 58568 KB Output is correct
11 Correct 16 ms 58204 KB Output is correct
12 Correct 14 ms 58332 KB Output is correct
13 Correct 15 ms 57984 KB Output is correct
14 Correct 14 ms 58180 KB Output is correct
15 Correct 16 ms 58132 KB Output is correct
16 Correct 16 ms 58168 KB Output is correct
17 Correct 16 ms 58160 KB Output is correct
18 Correct 15 ms 58204 KB Output is correct
19 Correct 15 ms 58348 KB Output is correct
20 Correct 15 ms 58364 KB Output is correct
21 Correct 13 ms 57948 KB Output is correct
22 Correct 14 ms 58204 KB Output is correct
23 Correct 18 ms 58200 KB Output is correct
24 Correct 17 ms 58204 KB Output is correct
25 Correct 16 ms 58204 KB Output is correct
26 Correct 14 ms 58204 KB Output is correct
27 Correct 14 ms 57944 KB Output is correct
28 Correct 14 ms 58204 KB Output is correct
29 Correct 14 ms 58200 KB Output is correct
30 Correct 16 ms 57948 KB Output is correct
31 Correct 2330 ms 202084 KB Output is correct
32 Correct 81 ms 62664 KB Output is correct
33 Correct 1855 ms 189808 KB Output is correct
34 Correct 2186 ms 189776 KB Output is correct
35 Correct 2192 ms 202260 KB Output is correct
36 Correct 1864 ms 198968 KB Output is correct
37 Correct 1257 ms 173432 KB Output is correct
38 Correct 1061 ms 173268 KB Output is correct
39 Correct 756 ms 148928 KB Output is correct
40 Correct 795 ms 153512 KB Output is correct
41 Correct 1128 ms 138932 KB Output is correct
42 Correct 1155 ms 140896 KB Output is correct
43 Correct 54 ms 63688 KB Output is correct
44 Correct 1155 ms 136748 KB Output is correct
45 Correct 919 ms 127432 KB Output is correct
46 Correct 673 ms 110236 KB Output is correct
47 Correct 358 ms 105036 KB Output is correct
48 Correct 347 ms 102848 KB Output is correct
49 Correct 486 ms 115096 KB Output is correct
50 Correct 703 ms 130956 KB Output is correct
51 Correct 493 ms 111016 KB Output is correct
52 Correct 4235 ms 291124 KB Output is correct
53 Correct 4800 ms 338936 KB Output is correct
54 Correct 1839 ms 229700 KB Output is correct
55 Correct 3703 ms 286176 KB Output is correct
56 Correct 3498 ms 333656 KB Output is correct
57 Correct 4446 ms 349768 KB Output is correct
58 Correct 1779 ms 229952 KB Output is correct
59 Correct 3042 ms 283324 KB Output is correct
60 Correct 3746 ms 317376 KB Output is correct
61 Correct 4345 ms 353020 KB Output is correct
62 Correct 1783 ms 345184 KB Output is correct
63 Correct 2003 ms 347816 KB Output is correct
64 Execution timed out 5109 ms 524348 KB Time limit exceeded
65 Halted 0 ms 0 KB -