oj.uz

답안 #1112498

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112498 2024-11-14T08:54:56 Z Pioneer 새 집 (APIO18_new_home) C++17
47 / 100
 5000 ms 722608 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*8*MAX];
    int mx[4*8*MAX],L[4*8*MAX],R[4*8*MAX];
    int cnt=1;

    segtree(){
        memset(L,0,sizeof(L));
        memset(R,0,sizeof(R));
        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();
            // mx[v]=x;
            return;
        }
        int tm=(tl+tr)/2;
        if(pos<=tm){
            if(!L[v])L[v]=++cnt;
            add(L[v],tl,tm,pos,x);
        }
        else{
            if(!R[v])R[v]=++cnt;
            add(R[v],tm+1,tr,pos,x);
        }
        mx[v]=max(mx[L[v]],mx[R[v]]);
    }

    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(L[v],tl,tm,pos,x);
        }
        else{
            del(R[v],tm+1,tr,pos,x);
        }
        mx[v]=max(mx[L[v]],mx[R[v]]);
    }

    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;
        int res=0;
        if(L[v])res=max(res,get(L[v],tl,tm,l,r));
        if(R[v])res=max(res,get(R[v],tm+1,tr,l,r));
        return res;
    }
}tree;

int L[MAX],R[MAX];
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]);
        if(!(*l==-1&&*r==inf+1))tree.del(1,0,m-1,getx(*l+1),*r-1);
        tree.add(1,0,m-1,getx(*l+1),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]);
        tree.del(1,0,m-1,getx(*l+1),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,getx(*l+1),*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]);
        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 322 ms 607816 KB Output is correct
2 Correct 327 ms 607824 KB Output is correct
3 Correct 345 ms 607816 KB Output is correct
4 Correct 326 ms 608072 KB Output is correct
5 Correct 347 ms 607816 KB Output is correct
6 Correct 316 ms 607804 KB Output is correct
7 Correct 324 ms 607828 KB Output is correct
8 Correct 346 ms 607816 KB Output is correct
9 Correct 359 ms 607816 KB Output is correct
10 Correct 370 ms 607816 KB Output is correct
11 Correct 340 ms 610000 KB Output is correct
12 Correct 357 ms 607816 KB Output is correct
13 Correct 323 ms 607960 KB Output is correct
14 Correct 329 ms 607824 KB Output is correct
15 Correct 346 ms 607972 KB Output is correct
16 Correct 352 ms 607788 KB Output is correct
17 Correct 336 ms 607896 KB Output is correct
18 Correct 344 ms 607816 KB Output is correct
19 Correct 351 ms 607816 KB Output is correct
20 Correct 356 ms 607816 KB Output is correct
21 Correct 371 ms 607816 KB Output is correct
22 Correct 343 ms 607932 KB Output is correct
23 Correct 357 ms 607816 KB Output is correct
24 Correct 343 ms 607816 KB Output is correct
25 Correct 386 ms 607816 KB Output is correct
26 Correct 352 ms 607816 KB Output is correct
27 Correct 344 ms 607816 KB Output is correct
28 Correct 372 ms 607928 KB Output is correct
29 Correct 377 ms 607928 KB Output is correct
30 Correct 370 ms 607772 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 322 ms 607816 KB Output is correct
2 Correct 327 ms 607824 KB Output is correct
3 Correct 345 ms 607816 KB Output is correct
4 Correct 326 ms 608072 KB Output is correct
5 Correct 347 ms 607816 KB Output is correct
6 Correct 316 ms 607804 KB Output is correct
7 Correct 324 ms 607828 KB Output is correct
8 Correct 346 ms 607816 KB Output is correct
9 Correct 359 ms 607816 KB Output is correct
10 Correct 370 ms 607816 KB Output is correct
11 Correct 340 ms 610000 KB Output is correct
12 Correct 357 ms 607816 KB Output is correct
13 Correct 323 ms 607960 KB Output is correct
14 Correct 329 ms 607824 KB Output is correct
15 Correct 346 ms 607972 KB Output is correct
16 Correct 352 ms 607788 KB Output is correct
17 Correct 336 ms 607896 KB Output is correct
18 Correct 344 ms 607816 KB Output is correct
19 Correct 351 ms 607816 KB Output is correct
20 Correct 356 ms 607816 KB Output is correct
21 Correct 371 ms 607816 KB Output is correct
22 Correct 343 ms 607932 KB Output is correct
23 Correct 357 ms 607816 KB Output is correct
24 Correct 343 ms 607816 KB Output is correct
25 Correct 386 ms 607816 KB Output is correct
26 Correct 352 ms 607816 KB Output is correct
27 Correct 344 ms 607816 KB Output is correct
28 Correct 372 ms 607928 KB Output is correct
29 Correct 377 ms 607928 KB Output is correct
30 Correct 370 ms 607772 KB Output is correct
31 Correct 1056 ms 625228 KB Output is correct
32 Correct 741 ms 613732 KB Output is correct
33 Correct 1050 ms 621152 KB Output is correct
34 Correct 960 ms 621748 KB Output is correct
35 Correct 1053 ms 625332 KB Output is correct
36 Correct 1105 ms 624952 KB Output is correct
37 Correct 909 ms 619956 KB Output is correct
38 Correct 847 ms 620064 KB Output is correct
39 Correct 739 ms 619256 KB Output is correct
40 Correct 770 ms 619380 KB Output is correct
41 Correct 732 ms 619172 KB Output is correct
42 Correct 670 ms 616608 KB Output is correct
43 Correct 426 ms 616936 KB Output is correct
44 Correct 789 ms 619444 KB Output is correct
45 Correct 829 ms 619448 KB Output is correct
46 Correct 804 ms 619444 KB Output is correct
47 Correct 626 ms 618676 KB Output is correct
48 Correct 642 ms 618416 KB Output is correct
49 Correct 688 ms 618776 KB Output is correct
50 Correct 604 ms 619188 KB Output is correct
51 Correct 689 ms 618932 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3718 ms 674092 KB Output is correct
2 Correct 4869 ms 673848 KB Output is correct
3 Correct 3570 ms 722608 KB Output is correct
4 Correct 3526 ms 693568 KB Output is correct
5 Execution timed out 5025 ms 676352 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4439 ms 673348 KB Output is correct
2 Execution timed out 5069 ms 637880 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 322 ms 607816 KB Output is correct
2 Correct 327 ms 607824 KB Output is correct
3 Correct 345 ms 607816 KB Output is correct
4 Correct 326 ms 608072 KB Output is correct
5 Correct 347 ms 607816 KB Output is correct
6 Correct 316 ms 607804 KB Output is correct
7 Correct 324 ms 607828 KB Output is correct
8 Correct 346 ms 607816 KB Output is correct
9 Correct 359 ms 607816 KB Output is correct
10 Correct 370 ms 607816 KB Output is correct
11 Correct 340 ms 610000 KB Output is correct
12 Correct 357 ms 607816 KB Output is correct
13 Correct 323 ms 607960 KB Output is correct
14 Correct 329 ms 607824 KB Output is correct
15 Correct 346 ms 607972 KB Output is correct
16 Correct 352 ms 607788 KB Output is correct
17 Correct 336 ms 607896 KB Output is correct
18 Correct 344 ms 607816 KB Output is correct
19 Correct 351 ms 607816 KB Output is correct
20 Correct 356 ms 607816 KB Output is correct
21 Correct 371 ms 607816 KB Output is correct
22 Correct 343 ms 607932 KB Output is correct
23 Correct 357 ms 607816 KB Output is correct
24 Correct 343 ms 607816 KB Output is correct
25 Correct 386 ms 607816 KB Output is correct
26 Correct 352 ms 607816 KB Output is correct
27 Correct 344 ms 607816 KB Output is correct
28 Correct 372 ms 607928 KB Output is correct
29 Correct 377 ms 607928 KB Output is correct
30 Correct 370 ms 607772 KB Output is correct
31 Correct 1056 ms 625228 KB Output is correct
32 Correct 741 ms 613732 KB Output is correct
33 Correct 1050 ms 621152 KB Output is correct
34 Correct 960 ms 621748 KB Output is correct
35 Correct 1053 ms 625332 KB Output is correct
36 Correct 1105 ms 624952 KB Output is correct
37 Correct 909 ms 619956 KB Output is correct
38 Correct 847 ms 620064 KB Output is correct
39 Correct 739 ms 619256 KB Output is correct
40 Correct 770 ms 619380 KB Output is correct
41 Correct 732 ms 619172 KB Output is correct
42 Correct 670 ms 616608 KB Output is correct
43 Correct 426 ms 616936 KB Output is correct
44 Correct 789 ms 619444 KB Output is correct
45 Correct 829 ms 619448 KB Output is correct
46 Correct 804 ms 619444 KB Output is correct
47 Correct 626 ms 618676 KB Output is correct
48 Correct 642 ms 618416 KB Output is correct
49 Correct 688 ms 618776 KB Output is correct
50 Correct 604 ms 619188 KB Output is correct
51 Correct 689 ms 618932 KB Output is correct
52 Correct 608 ms 633192 KB Output is correct
53 Correct 554 ms 625904 KB Output is correct
54 Correct 602 ms 624792 KB Output is correct
55 Correct 800 ms 621488 KB Output is correct
56 Correct 787 ms 623796 KB Output is correct
57 Correct 840 ms 618332 KB Output is correct
58 Correct 722 ms 621492 KB Output is correct
59 Correct 735 ms 623884 KB Output is correct
60 Correct 742 ms 618164 KB Output is correct
61 Correct 444 ms 626100 KB Output is correct
62 Correct 697 ms 630976 KB Output is correct
63 Correct 686 ms 625588 KB Output is correct
64 Correct 666 ms 623132 KB Output is correct
65 Correct 712 ms 618820 KB Output is correct
66 Correct 760 ms 616884 KB Output is correct
67 Correct 468 ms 613992 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 322 ms 607816 KB Output is correct
2 Correct 327 ms 607824 KB Output is correct
3 Correct 345 ms 607816 KB Output is correct
4 Correct 326 ms 608072 KB Output is correct
5 Correct 347 ms 607816 KB Output is correct
6 Correct 316 ms 607804 KB Output is correct
7 Correct 324 ms 607828 KB Output is correct
8 Correct 346 ms 607816 KB Output is correct
9 Correct 359 ms 607816 KB Output is correct
10 Correct 370 ms 607816 KB Output is correct
11 Correct 340 ms 610000 KB Output is correct
12 Correct 357 ms 607816 KB Output is correct
13 Correct 323 ms 607960 KB Output is correct
14 Correct 329 ms 607824 KB Output is correct
15 Correct 346 ms 607972 KB Output is correct
16 Correct 352 ms 607788 KB Output is correct
17 Correct 336 ms 607896 KB Output is correct
18 Correct 344 ms 607816 KB Output is correct
19 Correct 351 ms 607816 KB Output is correct
20 Correct 356 ms 607816 KB Output is correct
21 Correct 371 ms 607816 KB Output is correct
22 Correct 343 ms 607932 KB Output is correct
23 Correct 357 ms 607816 KB Output is correct
24 Correct 343 ms 607816 KB Output is correct
25 Correct 386 ms 607816 KB Output is correct
26 Correct 352 ms 607816 KB Output is correct
27 Correct 344 ms 607816 KB Output is correct
28 Correct 372 ms 607928 KB Output is correct
29 Correct 377 ms 607928 KB Output is correct
30 Correct 370 ms 607772 KB Output is correct
31 Correct 1056 ms 625228 KB Output is correct
32 Correct 741 ms 613732 KB Output is correct
33 Correct 1050 ms 621152 KB Output is correct
34 Correct 960 ms 621748 KB Output is correct
35 Correct 1053 ms 625332 KB Output is correct
36 Correct 1105 ms 624952 KB Output is correct
37 Correct 909 ms 619956 KB Output is correct
38 Correct 847 ms 620064 KB Output is correct
39 Correct 739 ms 619256 KB Output is correct
40 Correct 770 ms 619380 KB Output is correct
41 Correct 732 ms 619172 KB Output is correct
42 Correct 670 ms 616608 KB Output is correct
43 Correct 426 ms 616936 KB Output is correct
44 Correct 789 ms 619444 KB Output is correct
45 Correct 829 ms 619448 KB Output is correct
46 Correct 804 ms 619444 KB Output is correct
47 Correct 626 ms 618676 KB Output is correct
48 Correct 642 ms 618416 KB Output is correct
49 Correct 688 ms 618776 KB Output is correct
50 Correct 604 ms 619188 KB Output is correct
51 Correct 689 ms 618932 KB Output is correct
52 Correct 3718 ms 674092 KB Output is correct
53 Correct 4869 ms 673848 KB Output is correct
54 Correct 3570 ms 722608 KB Output is correct
55 Correct 3526 ms 693568 KB Output is correct
56 Execution timed out 5025 ms 676352 KB Time limit exceeded
57 Halted 0 ms 0 KB -