oj.uz

답안 #1112489

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112489 2024-11-14T08:48:36 Z Pioneer 새 집 (APIO18_new_home) C++17
47 / 100
 5000 ms 682840 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;

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();
            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){
            assert(L[v]!=0);
            del(L[v],tl,tm,pos,x);
        }
        else{
            assert(R[v]!=0);
            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;

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,inf,*l+1,*r-1);
        tree.add(1,0,inf,*l+1,x[id]-1);
        tree.add(1,0,inf,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,inf,*l+1,x[id]-1);
        tree.del(1,0,inf,x[id]+1,*r-1);
        if(!(*l==-1&&*r==inf+1))tree.add(1,0,inf,*l+1,*r-1);
    }
}

bool check(int l,int r){
    l=max(l,0);
    r=min(r,inf);
    if(tree.get(1,0,inf,0,l)>=r)return 0;
    return 1;
}

int ans[MAX];

void solve(){
    cin>>n>>k>>q;
    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);
    }
    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());
    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);
    }
    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 372 ms 607976 KB Output is correct
2 Correct 364 ms 607816 KB Output is correct
3 Correct 388 ms 608104 KB Output is correct
4 Correct 369 ms 607656 KB Output is correct
5 Correct 390 ms 607816 KB Output is correct
6 Correct 377 ms 607736 KB Output is correct
7 Correct 375 ms 607580 KB Output is correct
8 Correct 387 ms 607980 KB Output is correct
9 Correct 397 ms 607392 KB Output is correct
10 Correct 403 ms 607304 KB Output is correct
11 Correct 370 ms 607816 KB Output is correct
12 Correct 351 ms 607824 KB Output is correct
13 Correct 329 ms 607816 KB Output is correct
14 Correct 339 ms 607852 KB Output is correct
15 Correct 354 ms 607816 KB Output is correct
16 Correct 345 ms 608224 KB Output is correct
17 Correct 364 ms 607976 KB Output is correct
18 Correct 353 ms 607960 KB Output is correct
19 Correct 380 ms 607548 KB Output is correct
20 Correct 391 ms 607300 KB Output is correct
21 Correct 404 ms 607988 KB Output is correct
22 Correct 385 ms 607560 KB Output is correct
23 Correct 398 ms 607420 KB Output is correct
24 Correct 389 ms 607368 KB Output is correct
25 Correct 387 ms 607304 KB Output is correct
26 Correct 382 ms 607304 KB Output is correct
27 Correct 373 ms 607868 KB Output is correct
28 Correct 410 ms 607468 KB Output is correct
29 Correct 387 ms 607452 KB Output is correct
30 Correct 391 ms 607476 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 372 ms 607976 KB Output is correct
2 Correct 364 ms 607816 KB Output is correct
3 Correct 388 ms 608104 KB Output is correct
4 Correct 369 ms 607656 KB Output is correct
5 Correct 390 ms 607816 KB Output is correct
6 Correct 377 ms 607736 KB Output is correct
7 Correct 375 ms 607580 KB Output is correct
8 Correct 387 ms 607980 KB Output is correct
9 Correct 397 ms 607392 KB Output is correct
10 Correct 403 ms 607304 KB Output is correct
11 Correct 370 ms 607816 KB Output is correct
12 Correct 351 ms 607824 KB Output is correct
13 Correct 329 ms 607816 KB Output is correct
14 Correct 339 ms 607852 KB Output is correct
15 Correct 354 ms 607816 KB Output is correct
16 Correct 345 ms 608224 KB Output is correct
17 Correct 364 ms 607976 KB Output is correct
18 Correct 353 ms 607960 KB Output is correct
19 Correct 380 ms 607548 KB Output is correct
20 Correct 391 ms 607300 KB Output is correct
21 Correct 404 ms 607988 KB Output is correct
22 Correct 385 ms 607560 KB Output is correct
23 Correct 398 ms 607420 KB Output is correct
24 Correct 389 ms 607368 KB Output is correct
25 Correct 387 ms 607304 KB Output is correct
26 Correct 382 ms 607304 KB Output is correct
27 Correct 373 ms 607868 KB Output is correct
28 Correct 410 ms 607468 KB Output is correct
29 Correct 387 ms 607452 KB Output is correct
30 Correct 391 ms 607476 KB Output is correct
31 Correct 998 ms 623300 KB Output is correct
32 Correct 925 ms 612400 KB Output is correct
33 Correct 941 ms 620372 KB Output is correct
34 Correct 884 ms 619972 KB Output is correct
35 Correct 949 ms 624440 KB Output is correct
36 Correct 1045 ms 624324 KB Output is correct
37 Correct 798 ms 618948 KB Output is correct
38 Correct 890 ms 619204 KB Output is correct
39 Correct 737 ms 618692 KB Output is correct
40 Correct 762 ms 618696 KB Output is correct
41 Correct 740 ms 618692 KB Output is correct
42 Correct 635 ms 618948 KB Output is correct
43 Correct 641 ms 616388 KB Output is correct
44 Correct 851 ms 619024 KB Output is correct
45 Correct 762 ms 618948 KB Output is correct
46 Correct 830 ms 618948 KB Output is correct
47 Correct 642 ms 618436 KB Output is correct
48 Correct 685 ms 618180 KB Output is correct
49 Correct 706 ms 617920 KB Output is correct
50 Correct 696 ms 618220 KB Output is correct
51 Correct 717 ms 617960 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3435 ms 682648 KB Output is correct
2 Execution timed out 5096 ms 673136 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4131 ms 682840 KB Output is correct
2 Execution timed out 5106 ms 634708 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 372 ms 607976 KB Output is correct
2 Correct 364 ms 607816 KB Output is correct
3 Correct 388 ms 608104 KB Output is correct
4 Correct 369 ms 607656 KB Output is correct
5 Correct 390 ms 607816 KB Output is correct
6 Correct 377 ms 607736 KB Output is correct
7 Correct 375 ms 607580 KB Output is correct
8 Correct 387 ms 607980 KB Output is correct
9 Correct 397 ms 607392 KB Output is correct
10 Correct 403 ms 607304 KB Output is correct
11 Correct 370 ms 607816 KB Output is correct
12 Correct 351 ms 607824 KB Output is correct
13 Correct 329 ms 607816 KB Output is correct
14 Correct 339 ms 607852 KB Output is correct
15 Correct 354 ms 607816 KB Output is correct
16 Correct 345 ms 608224 KB Output is correct
17 Correct 364 ms 607976 KB Output is correct
18 Correct 353 ms 607960 KB Output is correct
19 Correct 380 ms 607548 KB Output is correct
20 Correct 391 ms 607300 KB Output is correct
21 Correct 404 ms 607988 KB Output is correct
22 Correct 385 ms 607560 KB Output is correct
23 Correct 398 ms 607420 KB Output is correct
24 Correct 389 ms 607368 KB Output is correct
25 Correct 387 ms 607304 KB Output is correct
26 Correct 382 ms 607304 KB Output is correct
27 Correct 373 ms 607868 KB Output is correct
28 Correct 410 ms 607468 KB Output is correct
29 Correct 387 ms 607452 KB Output is correct
30 Correct 391 ms 607476 KB Output is correct
31 Correct 998 ms 623300 KB Output is correct
32 Correct 925 ms 612400 KB Output is correct
33 Correct 941 ms 620372 KB Output is correct
34 Correct 884 ms 619972 KB Output is correct
35 Correct 949 ms 624440 KB Output is correct
36 Correct 1045 ms 624324 KB Output is correct
37 Correct 798 ms 618948 KB Output is correct
38 Correct 890 ms 619204 KB Output is correct
39 Correct 737 ms 618692 KB Output is correct
40 Correct 762 ms 618696 KB Output is correct
41 Correct 740 ms 618692 KB Output is correct
42 Correct 635 ms 618948 KB Output is correct
43 Correct 641 ms 616388 KB Output is correct
44 Correct 851 ms 619024 KB Output is correct
45 Correct 762 ms 618948 KB Output is correct
46 Correct 830 ms 618948 KB Output is correct
47 Correct 642 ms 618436 KB Output is correct
48 Correct 685 ms 618180 KB Output is correct
49 Correct 706 ms 617920 KB Output is correct
50 Correct 696 ms 618220 KB Output is correct
51 Correct 717 ms 617960 KB Output is correct
52 Correct 691 ms 633028 KB Output is correct
53 Correct 688 ms 625940 KB Output is correct
54 Correct 697 ms 627188 KB Output is correct
55 Correct 736 ms 623804 KB Output is correct
56 Correct 736 ms 626116 KB Output is correct
57 Correct 784 ms 620572 KB Output is correct
58 Correct 727 ms 623736 KB Output is correct
59 Correct 752 ms 626116 KB Output is correct
60 Correct 703 ms 620440 KB Output is correct
61 Correct 629 ms 627908 KB Output is correct
62 Correct 721 ms 633120 KB Output is correct
63 Correct 668 ms 627908 KB Output is correct
64 Correct 724 ms 625504 KB Output is correct
65 Correct 746 ms 621272 KB Output is correct
66 Correct 739 ms 619092 KB Output is correct
67 Correct 622 ms 614340 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 372 ms 607976 KB Output is correct
2 Correct 364 ms 607816 KB Output is correct
3 Correct 388 ms 608104 KB Output is correct
4 Correct 369 ms 607656 KB Output is correct
5 Correct 390 ms 607816 KB Output is correct
6 Correct 377 ms 607736 KB Output is correct
7 Correct 375 ms 607580 KB Output is correct
8 Correct 387 ms 607980 KB Output is correct
9 Correct 397 ms 607392 KB Output is correct
10 Correct 403 ms 607304 KB Output is correct
11 Correct 370 ms 607816 KB Output is correct
12 Correct 351 ms 607824 KB Output is correct
13 Correct 329 ms 607816 KB Output is correct
14 Correct 339 ms 607852 KB Output is correct
15 Correct 354 ms 607816 KB Output is correct
16 Correct 345 ms 608224 KB Output is correct
17 Correct 364 ms 607976 KB Output is correct
18 Correct 353 ms 607960 KB Output is correct
19 Correct 380 ms 607548 KB Output is correct
20 Correct 391 ms 607300 KB Output is correct
21 Correct 404 ms 607988 KB Output is correct
22 Correct 385 ms 607560 KB Output is correct
23 Correct 398 ms 607420 KB Output is correct
24 Correct 389 ms 607368 KB Output is correct
25 Correct 387 ms 607304 KB Output is correct
26 Correct 382 ms 607304 KB Output is correct
27 Correct 373 ms 607868 KB Output is correct
28 Correct 410 ms 607468 KB Output is correct
29 Correct 387 ms 607452 KB Output is correct
30 Correct 391 ms 607476 KB Output is correct
31 Correct 998 ms 623300 KB Output is correct
32 Correct 925 ms 612400 KB Output is correct
33 Correct 941 ms 620372 KB Output is correct
34 Correct 884 ms 619972 KB Output is correct
35 Correct 949 ms 624440 KB Output is correct
36 Correct 1045 ms 624324 KB Output is correct
37 Correct 798 ms 618948 KB Output is correct
38 Correct 890 ms 619204 KB Output is correct
39 Correct 737 ms 618692 KB Output is correct
40 Correct 762 ms 618696 KB Output is correct
41 Correct 740 ms 618692 KB Output is correct
42 Correct 635 ms 618948 KB Output is correct
43 Correct 641 ms 616388 KB Output is correct
44 Correct 851 ms 619024 KB Output is correct
45 Correct 762 ms 618948 KB Output is correct
46 Correct 830 ms 618948 KB Output is correct
47 Correct 642 ms 618436 KB Output is correct
48 Correct 685 ms 618180 KB Output is correct
49 Correct 706 ms 617920 KB Output is correct
50 Correct 696 ms 618220 KB Output is correct
51 Correct 717 ms 617960 KB Output is correct
52 Correct 3435 ms 682648 KB Output is correct
53 Execution timed out 5096 ms 673136 KB Time limit exceeded
54 Halted 0 ms 0 KB -