oj.uz

Submission #1112578

# Submission time Handle Problem Language Result Execution time Memory
1112578 2024-11-14T11:01:10 Z Pioneer New Home (APIO18_new_home) C++17
57 / 100
 5000 ms 266696 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")

#define ll long long
// #define int ll
#define all(v) v.begin(),v.end()
#define sz(s) ((int)s.size())
#define pb push_back
#define F first
#define S second
#define pii pair<int,int>
#define ppb pop_back
#define lb lower_bound
#define ub upper_bound

using namespace std;

const int inf=1e8;
const int MAX=3e5+10;
const int mod=1e9+7;

int binpow(int a,int n){
    if(!n)return 1;
    if(n%2==1)return a*binpow(a,n-1)%mod;
    int k=binpow(a,n/2);
    return k*k%mod;
}

int n,k,q,m;
int a[MAX],b[MAX],x[MAX],t[MAX];
int l[MAX],y[MAX];
vector<int> events[MAX+MAX],zap[MAX+MAX];
multiset<int> st[MAX];
vector<int> tim,pos;

struct segtree{
    multiset<int> t[4*2*MAX];
    int mx[4*2*MAX];

    segtree(){
        memset(mx,-1,sizeof(mx));
    }

    void add(int v,int tl,int tr,int pos,int x){
        pos+=m;
        t[pos].insert(x);
        mx[pos]=*t[pos].rbegin();
        while(pos>1){
            pos/=2;
            mx[pos]=max(mx[2*pos],mx[2*pos+1]);
        }
    }

    void del(int v,int tl,int tr,int pos,int x){
        pos+=m;
        t[pos].erase(t[pos].find(x));
        mx[pos]=(t[pos].empty()?-1:*t[pos].rbegin());
        while(pos>1){
            pos/=2;
            mx[pos]=max(mx[2*pos],mx[2*pos+1]);
        }
    }

    int get(int v,int tl,int tr,int l,int r){
        l+=m,r+=m+1;
        int res=0;
        while(l<r){
            if(l&1){
                res=max(res,mx[l++]);
            }
            if(r&1){
                res=max(res,mx[--r]);
            }
            l/=2,r/=2;
        }
        return res;
    }
}tree;

int cnt[MAX],col;

int getx(int x){
    return lb(all(pos),x)-pos.begin();
}

void add(int id){
    if(cnt[t[id]]==0)col++;
    cnt[t[id]]++;
    if(st[t[id]].count(x[id]))st[t[id]].insert(x[id]);
    else{
        auto l=--st[t[id]].lb(x[id]);
        auto r=st[t[id]].lb(x[id]);
        int LL=getx(*l+1);
        if(!(*l==-1&&*r==inf+1))tree.del(1,0,m-1,LL,*r-1);
        tree.add(1,0,m-1,LL,x[id]-1);
        tree.add(1,0,m-1,getx(x[id]+1),*r-1);
        st[t[id]].insert(x[id]);
    }
}

void del(int id){
    id=-id;
    cnt[t[id]]--;
    if(cnt[t[id]]==0)col--;
    st[t[id]].erase(st[t[id]].find(x[id]));
    if(!st[t[id]].count(x[id])){
        auto l=--st[t[id]].lb(x[id]);
        auto r=st[t[id]].lb(x[id]);
        int LL=getx(*l+1);
        tree.del(1,0,m-1,LL,x[id]-1);
        tree.del(1,0,m-1,getx(x[id]+1),*r-1);
        if(!(*l==-1&&*r==inf+1))tree.add(1,0,m-1,LL,*r-1);
    }
}

bool check(int l,int r){
    l=max(l,0);
    r=min(r,inf);
    l=ub(all(pos),l)-pos.begin()-1;
    // cout<<0<<" "<<l<<" "<<tree.get(1,0,m-1,0,l)<<"\n";
    if(tree.get(1,0,m-1,0,l)>=r)return 0;
    return 1;
}

int ans[MAX];

void solve(){
    cin>>n>>k>>q;
    pos.pb(0),pos.pb(inf);
    for(int i=1;i<=n;i++){
        cin>>x[i]>>t[i]>>a[i]>>b[i];
        tim.pb(a[i]);
        tim.pb(b[i]+1);
        pos.pb(x[i]+1);
        pos.pb(x[i]-1);
    }
    for(int i=1;i<=q;i++){
        cin>>l[i]>>y[i];
        tim.pb(y[i]);
    }
    sort(all(tim));
    tim.erase(unique(all(tim)),tim.end());
    sort(all(pos));
    pos.erase(unique(all(pos)),pos.end());
    for(int i=1;i<=n;i++){
        a[i]=lb(all(tim),a[i])-tim.begin();
        b[i]=lb(all(tim),b[i]+1)-tim.begin();
        events[a[i]].pb(i);
        events[b[i]].pb(-i);
    }
    for(int i=1;i<=q;i++){
        y[i]=lb(all(tim),y[i])-tim.begin();
        zap[y[i]].pb(i);
    }
    for(int i=1;i<=k;i++){
        st[i].insert(-1);
        st[i].insert(inf+1);
    }
    m=sz(pos);
    for(int i=0;i<sz(tim);i++){
        for(auto id:events[i]){
            if(id>0){
                add(id);
            }
            else{
                del(id);
            }
        }
        for(int id:zap[i]){
            if(col!=k){
                ans[id]=-1;
            }
            else{
                int L=0,R=inf,res=inf;
                while(L<=R){
                    int mid=(L+R)/2;
                    if(check(l[id]-mid,l[id]+mid)){
                        R=mid-1,res=mid;
                    }
                    else L=mid+1;
                }
                ans[id]=res;
            }
        }
    }
    for(int i=1;i<=q;i++)cout<<ans[i]<<"\n";
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--)solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 166480 KB Output is correct
2 Correct 44 ms 166652 KB Output is correct
3 Correct 47 ms 166668 KB Output is correct
4 Correct 49 ms 166472 KB Output is correct
5 Correct 55 ms 166476 KB Output is correct
6 Correct 56 ms 166728 KB Output is correct
7 Correct 52 ms 166732 KB Output is correct
8 Correct 53 ms 166728 KB Output is correct
9 Correct 59 ms 166736 KB Output is correct
10 Correct 56 ms 166716 KB Output is correct
11 Correct 66 ms 166728 KB Output is correct
12 Correct 62 ms 166588 KB Output is correct
13 Correct 60 ms 166576 KB Output is correct
14 Correct 61 ms 166588 KB Output is correct
15 Correct 62 ms 166728 KB Output is correct
16 Correct 68 ms 166736 KB Output is correct
17 Correct 73 ms 166728 KB Output is correct
18 Correct 80 ms 166984 KB Output is correct
19 Correct 62 ms 166728 KB Output is correct
20 Correct 65 ms 166736 KB Output is correct
21 Correct 69 ms 166748 KB Output is correct
22 Correct 71 ms 166728 KB Output is correct
23 Correct 71 ms 166728 KB Output is correct
24 Correct 75 ms 166728 KB Output is correct
25 Correct 77 ms 166728 KB Output is correct
26 Correct 73 ms 166728 KB Output is correct
27 Correct 72 ms 166704 KB Output is correct
28 Correct 69 ms 166736 KB Output is correct
29 Correct 68 ms 166728 KB Output is correct
30 Correct 68 ms 166692 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 166480 KB Output is correct
2 Correct 44 ms 166652 KB Output is correct
3 Correct 47 ms 166668 KB Output is correct
4 Correct 49 ms 166472 KB Output is correct
5 Correct 55 ms 166476 KB Output is correct
6 Correct 56 ms 166728 KB Output is correct
7 Correct 52 ms 166732 KB Output is correct
8 Correct 53 ms 166728 KB Output is correct
9 Correct 59 ms 166736 KB Output is correct
10 Correct 56 ms 166716 KB Output is correct
11 Correct 66 ms 166728 KB Output is correct
12 Correct 62 ms 166588 KB Output is correct
13 Correct 60 ms 166576 KB Output is correct
14 Correct 61 ms 166588 KB Output is correct
15 Correct 62 ms 166728 KB Output is correct
16 Correct 68 ms 166736 KB Output is correct
17 Correct 73 ms 166728 KB Output is correct
18 Correct 80 ms 166984 KB Output is correct
19 Correct 62 ms 166728 KB Output is correct
20 Correct 65 ms 166736 KB Output is correct
21 Correct 69 ms 166748 KB Output is correct
22 Correct 71 ms 166728 KB Output is correct
23 Correct 71 ms 166728 KB Output is correct
24 Correct 75 ms 166728 KB Output is correct
25 Correct 77 ms 166728 KB Output is correct
26 Correct 73 ms 166728 KB Output is correct
27 Correct 72 ms 166704 KB Output is correct
28 Correct 69 ms 166736 KB Output is correct
29 Correct 68 ms 166728 KB Output is correct
30 Correct 68 ms 166692 KB Output is correct
31 Correct 432 ms 180868 KB Output is correct
32 Correct 429 ms 171072 KB Output is correct
33 Correct 475 ms 177020 KB Output is correct
34 Correct 465 ms 177080 KB Output is correct
35 Correct 495 ms 181688 KB Output is correct
36 Correct 514 ms 180608 KB Output is correct
37 Correct 398 ms 175288 KB Output is correct
38 Correct 405 ms 175256 KB Output is correct
39 Correct 328 ms 175004 KB Output is correct
40 Correct 342 ms 175024 KB Output is correct
41 Correct 274 ms 175256 KB Output is correct
42 Correct 237 ms 175032 KB Output is correct
43 Correct 142 ms 173240 KB Output is correct
44 Correct 279 ms 175288 KB Output is correct
45 Correct 279 ms 175032 KB Output is correct
46 Correct 295 ms 175032 KB Output is correct
47 Correct 219 ms 174520 KB Output is correct
48 Correct 239 ms 174520 KB Output is correct
49 Correct 255 ms 174776 KB Output is correct
50 Correct 251 ms 174776 KB Output is correct
51 Correct 303 ms 174876 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1771 ms 234336 KB Output is correct
2 Correct 2575 ms 221144 KB Output is correct
3 Correct 1727 ms 265804 KB Output is correct
4 Correct 1784 ms 236900 KB Output is correct
5 Correct 2664 ms 220820 KB Output is correct
6 Correct 2854 ms 221276 KB Output is correct
7 Correct 1895 ms 266696 KB Output is correct
8 Correct 1572 ms 236928 KB Output is correct
9 Correct 1666 ms 226704 KB Output is correct
10 Correct 2145 ms 221960 KB Output is correct
11 Correct 1598 ms 220772 KB Output is correct
12 Correct 1680 ms 221644 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2435 ms 230364 KB Output is correct
2 Execution timed out 5060 ms 191544 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 166480 KB Output is correct
2 Correct 44 ms 166652 KB Output is correct
3 Correct 47 ms 166668 KB Output is correct
4 Correct 49 ms 166472 KB Output is correct
5 Correct 55 ms 166476 KB Output is correct
6 Correct 56 ms 166728 KB Output is correct
7 Correct 52 ms 166732 KB Output is correct
8 Correct 53 ms 166728 KB Output is correct
9 Correct 59 ms 166736 KB Output is correct
10 Correct 56 ms 166716 KB Output is correct
11 Correct 66 ms 166728 KB Output is correct
12 Correct 62 ms 166588 KB Output is correct
13 Correct 60 ms 166576 KB Output is correct
14 Correct 61 ms 166588 KB Output is correct
15 Correct 62 ms 166728 KB Output is correct
16 Correct 68 ms 166736 KB Output is correct
17 Correct 73 ms 166728 KB Output is correct
18 Correct 80 ms 166984 KB Output is correct
19 Correct 62 ms 166728 KB Output is correct
20 Correct 65 ms 166736 KB Output is correct
21 Correct 69 ms 166748 KB Output is correct
22 Correct 71 ms 166728 KB Output is correct
23 Correct 71 ms 166728 KB Output is correct
24 Correct 75 ms 166728 KB Output is correct
25 Correct 77 ms 166728 KB Output is correct
26 Correct 73 ms 166728 KB Output is correct
27 Correct 72 ms 166704 KB Output is correct
28 Correct 69 ms 166736 KB Output is correct
29 Correct 68 ms 166728 KB Output is correct
30 Correct 68 ms 166692 KB Output is correct
31 Correct 432 ms 180868 KB Output is correct
32 Correct 429 ms 171072 KB Output is correct
33 Correct 475 ms 177020 KB Output is correct
34 Correct 465 ms 177080 KB Output is correct
35 Correct 495 ms 181688 KB Output is correct
36 Correct 514 ms 180608 KB Output is correct
37 Correct 398 ms 175288 KB Output is correct
38 Correct 405 ms 175256 KB Output is correct
39 Correct 328 ms 175004 KB Output is correct
40 Correct 342 ms 175024 KB Output is correct
41 Correct 274 ms 175256 KB Output is correct
42 Correct 237 ms 175032 KB Output is correct
43 Correct 142 ms 173240 KB Output is correct
44 Correct 279 ms 175288 KB Output is correct
45 Correct 279 ms 175032 KB Output is correct
46 Correct 295 ms 175032 KB Output is correct
47 Correct 219 ms 174520 KB Output is correct
48 Correct 239 ms 174520 KB Output is correct
49 Correct 255 ms 174776 KB Output is correct
50 Correct 251 ms 174776 KB Output is correct
51 Correct 303 ms 174876 KB Output is correct
52 Correct 274 ms 188992 KB Output is correct
53 Correct 252 ms 183736 KB Output is correct
54 Correct 313 ms 183224 KB Output is correct
55 Correct 327 ms 179896 KB Output is correct
56 Correct 344 ms 182200 KB Output is correct
57 Correct 313 ms 176556 KB Output is correct
58 Correct 312 ms 179740 KB Output is correct
59 Correct 314 ms 182200 KB Output is correct
60 Correct 288 ms 176568 KB Output is correct
61 Correct 147 ms 184504 KB Output is correct
62 Correct 310 ms 189112 KB Output is correct
63 Correct 308 ms 183992 KB Output is correct
64 Correct 308 ms 181600 KB Output is correct
65 Correct 302 ms 177336 KB Output is correct
66 Correct 302 ms 175276 KB Output is correct
67 Correct 178 ms 172304 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 166480 KB Output is correct
2 Correct 44 ms 166652 KB Output is correct
3 Correct 47 ms 166668 KB Output is correct
4 Correct 49 ms 166472 KB Output is correct
5 Correct 55 ms 166476 KB Output is correct
6 Correct 56 ms 166728 KB Output is correct
7 Correct 52 ms 166732 KB Output is correct
8 Correct 53 ms 166728 KB Output is correct
9 Correct 59 ms 166736 KB Output is correct
10 Correct 56 ms 166716 KB Output is correct
11 Correct 66 ms 166728 KB Output is correct
12 Correct 62 ms 166588 KB Output is correct
13 Correct 60 ms 166576 KB Output is correct
14 Correct 61 ms 166588 KB Output is correct
15 Correct 62 ms 166728 KB Output is correct
16 Correct 68 ms 166736 KB Output is correct
17 Correct 73 ms 166728 KB Output is correct
18 Correct 80 ms 166984 KB Output is correct
19 Correct 62 ms 166728 KB Output is correct
20 Correct 65 ms 166736 KB Output is correct
21 Correct 69 ms 166748 KB Output is correct
22 Correct 71 ms 166728 KB Output is correct
23 Correct 71 ms 166728 KB Output is correct
24 Correct 75 ms 166728 KB Output is correct
25 Correct 77 ms 166728 KB Output is correct
26 Correct 73 ms 166728 KB Output is correct
27 Correct 72 ms 166704 KB Output is correct
28 Correct 69 ms 166736 KB Output is correct
29 Correct 68 ms 166728 KB Output is correct
30 Correct 68 ms 166692 KB Output is correct
31 Correct 432 ms 180868 KB Output is correct
32 Correct 429 ms 171072 KB Output is correct
33 Correct 475 ms 177020 KB Output is correct
34 Correct 465 ms 177080 KB Output is correct
35 Correct 495 ms 181688 KB Output is correct
36 Correct 514 ms 180608 KB Output is correct
37 Correct 398 ms 175288 KB Output is correct
38 Correct 405 ms 175256 KB Output is correct
39 Correct 328 ms 175004 KB Output is correct
40 Correct 342 ms 175024 KB Output is correct
41 Correct 274 ms 175256 KB Output is correct
42 Correct 237 ms 175032 KB Output is correct
43 Correct 142 ms 173240 KB Output is correct
44 Correct 279 ms 175288 KB Output is correct
45 Correct 279 ms 175032 KB Output is correct
46 Correct 295 ms 175032 KB Output is correct
47 Correct 219 ms 174520 KB Output is correct
48 Correct 239 ms 174520 KB Output is correct
49 Correct 255 ms 174776 KB Output is correct
50 Correct 251 ms 174776 KB Output is correct
51 Correct 303 ms 174876 KB Output is correct
52 Correct 1771 ms 234336 KB Output is correct
53 Correct 2575 ms 221144 KB Output is correct
54 Correct 1727 ms 265804 KB Output is correct
55 Correct 1784 ms 236900 KB Output is correct
56 Correct 2664 ms 220820 KB Output is correct
57 Correct 2854 ms 221276 KB Output is correct
58 Correct 1895 ms 266696 KB Output is correct
59 Correct 1572 ms 236928 KB Output is correct
60 Correct 1666 ms 226704 KB Output is correct
61 Correct 2145 ms 221960 KB Output is correct
62 Correct 1598 ms 220772 KB Output is correct
63 Correct 1680 ms 221644 KB Output is correct
64 Correct 2435 ms 230364 KB Output is correct
65 Execution timed out 5060 ms 191544 KB Time limit exceeded
66 Halted 0 ms 0 KB -