oj.uz

답안 #1112557

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112557 2024-11-14T10:23:41 Z Pioneer 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 265736 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
// #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){
        if(tl==tr){
            t[v].insert(x);
            mx[v]=*t[v].rbegin();
            return;
        }
        int tm=(tl+tr)/2;
        if(pos<=tm){
            add(2*v,tl,tm,pos,x);
        }
        else{
            add(2*v+1,tm+1,tr,pos,x);
        }
        mx[v]=max(mx[2*v],mx[2*v+1]);
    }

    void del(int v,int tl,int tr,int pos,int x){
        if(tl==tr){
            t[v].erase(t[v].find(x));
            if(t[v].empty())mx[v]=-1;
            else mx[v]=*t[v].rbegin();
            return;
        }
        int tm=(tl+tr)/2;
        if(pos<=tm){
            del(2*v,tl,tm,pos,x);
        }
        else{
            del(2*v+1,tm+1,tr,pos,x);
        }
        mx[v]=max(mx[2*v],mx[2*v+1]);
    }

    int get(int v,int tl,int tr,int l,int r){
        if(l>r||tl>r||l>tr)return 0;
        if(l<=tl&&tr<=r)return mx[v];
        int tm=(tl+tr)/2;
        return max(get(2*v,tl,tm,l,r),get(2*v+1,tm+1,tr,l,r));
    }
}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;
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 166476 KB Output is correct
2 Correct 55 ms 166612 KB Output is correct
3 Correct 56 ms 166472 KB Output is correct
4 Correct 58 ms 166584 KB Output is correct
5 Correct 69 ms 166476 KB Output is correct
6 Correct 62 ms 166728 KB Output is correct
7 Correct 66 ms 166736 KB Output is correct
8 Correct 67 ms 166556 KB Output is correct
9 Correct 64 ms 166728 KB Output is correct
10 Correct 71 ms 166728 KB Output is correct
11 Correct 64 ms 166696 KB Output is correct
12 Correct 67 ms 166732 KB Output is correct
13 Correct 69 ms 166552 KB Output is correct
14 Correct 74 ms 166708 KB Output is correct
15 Correct 74 ms 166612 KB Output is correct
16 Correct 81 ms 166732 KB Output is correct
17 Correct 80 ms 166728 KB Output is correct
18 Correct 80 ms 166728 KB Output is correct
19 Correct 83 ms 166728 KB Output is correct
20 Correct 82 ms 166688 KB Output is correct
21 Correct 82 ms 166728 KB Output is correct
22 Correct 80 ms 166664 KB Output is correct
23 Correct 71 ms 166696 KB Output is correct
24 Correct 76 ms 166728 KB Output is correct
25 Correct 74 ms 166732 KB Output is correct
26 Correct 74 ms 166728 KB Output is correct
27 Correct 81 ms 166728 KB Output is correct
28 Correct 84 ms 166728 KB Output is correct
29 Correct 76 ms 166728 KB Output is correct
30 Correct 77 ms 166636 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 166476 KB Output is correct
2 Correct 55 ms 166612 KB Output is correct
3 Correct 56 ms 166472 KB Output is correct
4 Correct 58 ms 166584 KB Output is correct
5 Correct 69 ms 166476 KB Output is correct
6 Correct 62 ms 166728 KB Output is correct
7 Correct 66 ms 166736 KB Output is correct
8 Correct 67 ms 166556 KB Output is correct
9 Correct 64 ms 166728 KB Output is correct
10 Correct 71 ms 166728 KB Output is correct
11 Correct 64 ms 166696 KB Output is correct
12 Correct 67 ms 166732 KB Output is correct
13 Correct 69 ms 166552 KB Output is correct
14 Correct 74 ms 166708 KB Output is correct
15 Correct 74 ms 166612 KB Output is correct
16 Correct 81 ms 166732 KB Output is correct
17 Correct 80 ms 166728 KB Output is correct
18 Correct 80 ms 166728 KB Output is correct
19 Correct 83 ms 166728 KB Output is correct
20 Correct 82 ms 166688 KB Output is correct
21 Correct 82 ms 166728 KB Output is correct
22 Correct 80 ms 166664 KB Output is correct
23 Correct 71 ms 166696 KB Output is correct
24 Correct 76 ms 166728 KB Output is correct
25 Correct 74 ms 166732 KB Output is correct
26 Correct 74 ms 166728 KB Output is correct
27 Correct 81 ms 166728 KB Output is correct
28 Correct 84 ms 166728 KB Output is correct
29 Correct 76 ms 166728 KB Output is correct
30 Correct 77 ms 166636 KB Output is correct
31 Correct 561 ms 180636 KB Output is correct
32 Correct 478 ms 171192 KB Output is correct
33 Correct 608 ms 177144 KB Output is correct
34 Correct 557 ms 177072 KB Output is correct
35 Correct 614 ms 180580 KB Output is correct
36 Correct 608 ms 180668 KB Output is correct
37 Correct 472 ms 175356 KB Output is correct
38 Correct 464 ms 175308 KB Output is correct
39 Correct 398 ms 175032 KB Output is correct
40 Correct 423 ms 174952 KB Output is correct
41 Correct 409 ms 175160 KB Output is correct
42 Correct 326 ms 175032 KB Output is correct
43 Correct 161 ms 172984 KB Output is correct
44 Correct 387 ms 175260 KB Output is correct
45 Correct 398 ms 175032 KB Output is correct
46 Correct 412 ms 175032 KB Output is correct
47 Correct 278 ms 174520 KB Output is correct
48 Correct 293 ms 174488 KB Output is correct
49 Correct 326 ms 174764 KB Output is correct
50 Correct 326 ms 174796 KB Output is correct
51 Correct 356 ms 174880 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2423 ms 231132 KB Output is correct
2 Correct 3228 ms 221156 KB Output is correct
3 Correct 2297 ms 265732 KB Output is correct
4 Correct 2457 ms 236956 KB Output is correct
5 Correct 3628 ms 220820 KB Output is correct
6 Correct 3330 ms 221328 KB Output is correct
7 Correct 2163 ms 265736 KB Output is correct
8 Correct 2007 ms 236948 KB Output is correct
9 Correct 2041 ms 226792 KB Output is correct
10 Correct 2718 ms 221968 KB Output is correct
11 Correct 2050 ms 220808 KB Output is correct
12 Correct 2104 ms 221580 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3117 ms 230376 KB Output is correct
2 Execution timed out 5078 ms 191632 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 166476 KB Output is correct
2 Correct 55 ms 166612 KB Output is correct
3 Correct 56 ms 166472 KB Output is correct
4 Correct 58 ms 166584 KB Output is correct
5 Correct 69 ms 166476 KB Output is correct
6 Correct 62 ms 166728 KB Output is correct
7 Correct 66 ms 166736 KB Output is correct
8 Correct 67 ms 166556 KB Output is correct
9 Correct 64 ms 166728 KB Output is correct
10 Correct 71 ms 166728 KB Output is correct
11 Correct 64 ms 166696 KB Output is correct
12 Correct 67 ms 166732 KB Output is correct
13 Correct 69 ms 166552 KB Output is correct
14 Correct 74 ms 166708 KB Output is correct
15 Correct 74 ms 166612 KB Output is correct
16 Correct 81 ms 166732 KB Output is correct
17 Correct 80 ms 166728 KB Output is correct
18 Correct 80 ms 166728 KB Output is correct
19 Correct 83 ms 166728 KB Output is correct
20 Correct 82 ms 166688 KB Output is correct
21 Correct 82 ms 166728 KB Output is correct
22 Correct 80 ms 166664 KB Output is correct
23 Correct 71 ms 166696 KB Output is correct
24 Correct 76 ms 166728 KB Output is correct
25 Correct 74 ms 166732 KB Output is correct
26 Correct 74 ms 166728 KB Output is correct
27 Correct 81 ms 166728 KB Output is correct
28 Correct 84 ms 166728 KB Output is correct
29 Correct 76 ms 166728 KB Output is correct
30 Correct 77 ms 166636 KB Output is correct
31 Correct 561 ms 180636 KB Output is correct
32 Correct 478 ms 171192 KB Output is correct
33 Correct 608 ms 177144 KB Output is correct
34 Correct 557 ms 177072 KB Output is correct
35 Correct 614 ms 180580 KB Output is correct
36 Correct 608 ms 180668 KB Output is correct
37 Correct 472 ms 175356 KB Output is correct
38 Correct 464 ms 175308 KB Output is correct
39 Correct 398 ms 175032 KB Output is correct
40 Correct 423 ms 174952 KB Output is correct
41 Correct 409 ms 175160 KB Output is correct
42 Correct 326 ms 175032 KB Output is correct
43 Correct 161 ms 172984 KB Output is correct
44 Correct 387 ms 175260 KB Output is correct
45 Correct 398 ms 175032 KB Output is correct
46 Correct 412 ms 175032 KB Output is correct
47 Correct 278 ms 174520 KB Output is correct
48 Correct 293 ms 174488 KB Output is correct
49 Correct 326 ms 174764 KB Output is correct
50 Correct 326 ms 174796 KB Output is correct
51 Correct 356 ms 174880 KB Output is correct
52 Correct 315 ms 189064 KB Output is correct
53 Correct 283 ms 183616 KB Output is correct
54 Correct 317 ms 183240 KB Output is correct
55 Correct 419 ms 180004 KB Output is correct
56 Correct 419 ms 182176 KB Output is correct
57 Correct 415 ms 176568 KB Output is correct
58 Correct 390 ms 179748 KB Output is correct
59 Correct 371 ms 182052 KB Output is correct
60 Correct 352 ms 176568 KB Output is correct
61 Correct 154 ms 184504 KB Output is correct
62 Correct 368 ms 189112 KB Output is correct
63 Correct 361 ms 183988 KB Output is correct
64 Correct 389 ms 181432 KB Output is correct
65 Correct 381 ms 177340 KB Output is correct
66 Correct 401 ms 175396 KB Output is correct
67 Correct 218 ms 172288 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 166476 KB Output is correct
2 Correct 55 ms 166612 KB Output is correct
3 Correct 56 ms 166472 KB Output is correct
4 Correct 58 ms 166584 KB Output is correct
5 Correct 69 ms 166476 KB Output is correct
6 Correct 62 ms 166728 KB Output is correct
7 Correct 66 ms 166736 KB Output is correct
8 Correct 67 ms 166556 KB Output is correct
9 Correct 64 ms 166728 KB Output is correct
10 Correct 71 ms 166728 KB Output is correct
11 Correct 64 ms 166696 KB Output is correct
12 Correct 67 ms 166732 KB Output is correct
13 Correct 69 ms 166552 KB Output is correct
14 Correct 74 ms 166708 KB Output is correct
15 Correct 74 ms 166612 KB Output is correct
16 Correct 81 ms 166732 KB Output is correct
17 Correct 80 ms 166728 KB Output is correct
18 Correct 80 ms 166728 KB Output is correct
19 Correct 83 ms 166728 KB Output is correct
20 Correct 82 ms 166688 KB Output is correct
21 Correct 82 ms 166728 KB Output is correct
22 Correct 80 ms 166664 KB Output is correct
23 Correct 71 ms 166696 KB Output is correct
24 Correct 76 ms 166728 KB Output is correct
25 Correct 74 ms 166732 KB Output is correct
26 Correct 74 ms 166728 KB Output is correct
27 Correct 81 ms 166728 KB Output is correct
28 Correct 84 ms 166728 KB Output is correct
29 Correct 76 ms 166728 KB Output is correct
30 Correct 77 ms 166636 KB Output is correct
31 Correct 561 ms 180636 KB Output is correct
32 Correct 478 ms 171192 KB Output is correct
33 Correct 608 ms 177144 KB Output is correct
34 Correct 557 ms 177072 KB Output is correct
35 Correct 614 ms 180580 KB Output is correct
36 Correct 608 ms 180668 KB Output is correct
37 Correct 472 ms 175356 KB Output is correct
38 Correct 464 ms 175308 KB Output is correct
39 Correct 398 ms 175032 KB Output is correct
40 Correct 423 ms 174952 KB Output is correct
41 Correct 409 ms 175160 KB Output is correct
42 Correct 326 ms 175032 KB Output is correct
43 Correct 161 ms 172984 KB Output is correct
44 Correct 387 ms 175260 KB Output is correct
45 Correct 398 ms 175032 KB Output is correct
46 Correct 412 ms 175032 KB Output is correct
47 Correct 278 ms 174520 KB Output is correct
48 Correct 293 ms 174488 KB Output is correct
49 Correct 326 ms 174764 KB Output is correct
50 Correct 326 ms 174796 KB Output is correct
51 Correct 356 ms 174880 KB Output is correct
52 Correct 2423 ms 231132 KB Output is correct
53 Correct 3228 ms 221156 KB Output is correct
54 Correct 2297 ms 265732 KB Output is correct
55 Correct 2457 ms 236956 KB Output is correct
56 Correct 3628 ms 220820 KB Output is correct
57 Correct 3330 ms 221328 KB Output is correct
58 Correct 2163 ms 265736 KB Output is correct
59 Correct 2007 ms 236948 KB Output is correct
60 Correct 2041 ms 226792 KB Output is correct
61 Correct 2718 ms 221968 KB Output is correct
62 Correct 2050 ms 220808 KB Output is correct
63 Correct 2104 ms 221580 KB Output is correct
64 Correct 3117 ms 230376 KB Output is correct
65 Execution timed out 5078 ms 191632 KB Time limit exceeded
66 Halted 0 ms 0 KB -