oj.uz

답안 #1112573

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112573 2024-11-14T10:57:55 Z Pioneer 새 집 (APIO18_new_home) C++17
57 / 100
 5000 ms 265728 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){
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 166476 KB Output is correct
2 Correct 41 ms 166536 KB Output is correct
3 Correct 39 ms 166492 KB Output is correct
4 Correct 58 ms 166472 KB Output is correct
5 Correct 51 ms 166736 KB Output is correct
6 Correct 54 ms 166592 KB Output is correct
7 Correct 55 ms 166640 KB Output is correct
8 Correct 65 ms 166804 KB Output is correct
9 Correct 59 ms 166728 KB Output is correct
10 Correct 55 ms 166616 KB Output is correct
11 Correct 61 ms 166736 KB Output is correct
12 Correct 67 ms 166580 KB Output is correct
13 Correct 83 ms 166728 KB Output is correct
14 Correct 69 ms 166684 KB Output is correct
15 Correct 78 ms 166728 KB Output is correct
16 Correct 69 ms 166728 KB Output is correct
17 Correct 82 ms 166552 KB Output is correct
18 Correct 103 ms 166728 KB Output is correct
19 Correct 103 ms 166728 KB Output is correct
20 Correct 74 ms 166668 KB Output is correct
21 Correct 66 ms 166668 KB Output is correct
22 Correct 94 ms 166732 KB Output is correct
23 Correct 92 ms 166728 KB Output is correct
24 Correct 68 ms 166728 KB Output is correct
25 Correct 73 ms 166728 KB Output is correct
26 Correct 107 ms 166728 KB Output is correct
27 Correct 66 ms 166732 KB Output is correct
28 Correct 73 ms 166728 KB Output is correct
29 Correct 74 ms 166728 KB Output is correct
30 Correct 93 ms 166572 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 166476 KB Output is correct
2 Correct 41 ms 166536 KB Output is correct
3 Correct 39 ms 166492 KB Output is correct
4 Correct 58 ms 166472 KB Output is correct
5 Correct 51 ms 166736 KB Output is correct
6 Correct 54 ms 166592 KB Output is correct
7 Correct 55 ms 166640 KB Output is correct
8 Correct 65 ms 166804 KB Output is correct
9 Correct 59 ms 166728 KB Output is correct
10 Correct 55 ms 166616 KB Output is correct
11 Correct 61 ms 166736 KB Output is correct
12 Correct 67 ms 166580 KB Output is correct
13 Correct 83 ms 166728 KB Output is correct
14 Correct 69 ms 166684 KB Output is correct
15 Correct 78 ms 166728 KB Output is correct
16 Correct 69 ms 166728 KB Output is correct
17 Correct 82 ms 166552 KB Output is correct
18 Correct 103 ms 166728 KB Output is correct
19 Correct 103 ms 166728 KB Output is correct
20 Correct 74 ms 166668 KB Output is correct
21 Correct 66 ms 166668 KB Output is correct
22 Correct 94 ms 166732 KB Output is correct
23 Correct 92 ms 166728 KB Output is correct
24 Correct 68 ms 166728 KB Output is correct
25 Correct 73 ms 166728 KB Output is correct
26 Correct 107 ms 166728 KB Output is correct
27 Correct 66 ms 166732 KB Output is correct
28 Correct 73 ms 166728 KB Output is correct
29 Correct 74 ms 166728 KB Output is correct
30 Correct 93 ms 166572 KB Output is correct
31 Correct 459 ms 180664 KB Output is correct
32 Correct 460 ms 170940 KB Output is correct
33 Correct 492 ms 176960 KB Output is correct
34 Correct 445 ms 177064 KB Output is correct
35 Correct 587 ms 180664 KB Output is correct
36 Correct 550 ms 180476 KB Output is correct
37 Correct 456 ms 175292 KB Output is correct
38 Correct 421 ms 175292 KB Output is correct
39 Correct 371 ms 174864 KB Output is correct
40 Correct 398 ms 175032 KB Output is correct
41 Correct 332 ms 175116 KB Output is correct
42 Correct 301 ms 174980 KB Output is correct
43 Correct 197 ms 173000 KB Output is correct
44 Correct 344 ms 175288 KB Output is correct
45 Correct 317 ms 175240 KB Output is correct
46 Correct 346 ms 175092 KB Output is correct
47 Correct 236 ms 174520 KB Output is correct
48 Correct 242 ms 174520 KB Output is correct
49 Correct 266 ms 174780 KB Output is correct
50 Correct 242 ms 174776 KB Output is correct
51 Correct 311 ms 174660 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1763 ms 231096 KB Output is correct
2 Correct 2574 ms 221136 KB Output is correct
3 Correct 1765 ms 265660 KB Output is correct
4 Correct 1756 ms 237052 KB Output is correct
5 Correct 2575 ms 220868 KB Output is correct
6 Correct 2540 ms 221140 KB Output is correct
7 Correct 1508 ms 265728 KB Output is correct
8 Correct 1351 ms 236944 KB Output is correct
9 Correct 1488 ms 226868 KB Output is correct
10 Correct 2129 ms 221924 KB Output is correct
11 Correct 1514 ms 220820 KB Output is correct
12 Correct 1573 ms 221620 KB Output is correct

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2652 ms 230364 KB Output is correct
2 Execution timed out 5071 ms 193396 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 166476 KB Output is correct
2 Correct 41 ms 166536 KB Output is correct
3 Correct 39 ms 166492 KB Output is correct
4 Correct 58 ms 166472 KB Output is correct
5 Correct 51 ms 166736 KB Output is correct
6 Correct 54 ms 166592 KB Output is correct
7 Correct 55 ms 166640 KB Output is correct
8 Correct 65 ms 166804 KB Output is correct
9 Correct 59 ms 166728 KB Output is correct
10 Correct 55 ms 166616 KB Output is correct
11 Correct 61 ms 166736 KB Output is correct
12 Correct 67 ms 166580 KB Output is correct
13 Correct 83 ms 166728 KB Output is correct
14 Correct 69 ms 166684 KB Output is correct
15 Correct 78 ms 166728 KB Output is correct
16 Correct 69 ms 166728 KB Output is correct
17 Correct 82 ms 166552 KB Output is correct
18 Correct 103 ms 166728 KB Output is correct
19 Correct 103 ms 166728 KB Output is correct
20 Correct 74 ms 166668 KB Output is correct
21 Correct 66 ms 166668 KB Output is correct
22 Correct 94 ms 166732 KB Output is correct
23 Correct 92 ms 166728 KB Output is correct
24 Correct 68 ms 166728 KB Output is correct
25 Correct 73 ms 166728 KB Output is correct
26 Correct 107 ms 166728 KB Output is correct
27 Correct 66 ms 166732 KB Output is correct
28 Correct 73 ms 166728 KB Output is correct
29 Correct 74 ms 166728 KB Output is correct
30 Correct 93 ms 166572 KB Output is correct
31 Correct 459 ms 180664 KB Output is correct
32 Correct 460 ms 170940 KB Output is correct
33 Correct 492 ms 176960 KB Output is correct
34 Correct 445 ms 177064 KB Output is correct
35 Correct 587 ms 180664 KB Output is correct
36 Correct 550 ms 180476 KB Output is correct
37 Correct 456 ms 175292 KB Output is correct
38 Correct 421 ms 175292 KB Output is correct
39 Correct 371 ms 174864 KB Output is correct
40 Correct 398 ms 175032 KB Output is correct
41 Correct 332 ms 175116 KB Output is correct
42 Correct 301 ms 174980 KB Output is correct
43 Correct 197 ms 173000 KB Output is correct
44 Correct 344 ms 175288 KB Output is correct
45 Correct 317 ms 175240 KB Output is correct
46 Correct 346 ms 175092 KB Output is correct
47 Correct 236 ms 174520 KB Output is correct
48 Correct 242 ms 174520 KB Output is correct
49 Correct 266 ms 174780 KB Output is correct
50 Correct 242 ms 174776 KB Output is correct
51 Correct 311 ms 174660 KB Output is correct
52 Correct 268 ms 189112 KB Output is correct
53 Correct 269 ms 183740 KB Output is correct
54 Correct 286 ms 183224 KB Output is correct
55 Correct 330 ms 179896 KB Output is correct
56 Correct 333 ms 182360 KB Output is correct
57 Correct 311 ms 176824 KB Output is correct
58 Correct 297 ms 179780 KB Output is correct
59 Correct 303 ms 182184 KB Output is correct
60 Correct 299 ms 176368 KB Output is correct
61 Correct 138 ms 184516 KB Output is correct
62 Correct 324 ms 189112 KB Output is correct
63 Correct 341 ms 183812 KB Output is correct
64 Correct 348 ms 181564 KB Output is correct
65 Correct 332 ms 177196 KB Output is correct
66 Correct 308 ms 175592 KB Output is correct
67 Correct 177 ms 172216 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 166476 KB Output is correct
2 Correct 41 ms 166536 KB Output is correct
3 Correct 39 ms 166492 KB Output is correct
4 Correct 58 ms 166472 KB Output is correct
5 Correct 51 ms 166736 KB Output is correct
6 Correct 54 ms 166592 KB Output is correct
7 Correct 55 ms 166640 KB Output is correct
8 Correct 65 ms 166804 KB Output is correct
9 Correct 59 ms 166728 KB Output is correct
10 Correct 55 ms 166616 KB Output is correct
11 Correct 61 ms 166736 KB Output is correct
12 Correct 67 ms 166580 KB Output is correct
13 Correct 83 ms 166728 KB Output is correct
14 Correct 69 ms 166684 KB Output is correct
15 Correct 78 ms 166728 KB Output is correct
16 Correct 69 ms 166728 KB Output is correct
17 Correct 82 ms 166552 KB Output is correct
18 Correct 103 ms 166728 KB Output is correct
19 Correct 103 ms 166728 KB Output is correct
20 Correct 74 ms 166668 KB Output is correct
21 Correct 66 ms 166668 KB Output is correct
22 Correct 94 ms 166732 KB Output is correct
23 Correct 92 ms 166728 KB Output is correct
24 Correct 68 ms 166728 KB Output is correct
25 Correct 73 ms 166728 KB Output is correct
26 Correct 107 ms 166728 KB Output is correct
27 Correct 66 ms 166732 KB Output is correct
28 Correct 73 ms 166728 KB Output is correct
29 Correct 74 ms 166728 KB Output is correct
30 Correct 93 ms 166572 KB Output is correct
31 Correct 459 ms 180664 KB Output is correct
32 Correct 460 ms 170940 KB Output is correct
33 Correct 492 ms 176960 KB Output is correct
34 Correct 445 ms 177064 KB Output is correct
35 Correct 587 ms 180664 KB Output is correct
36 Correct 550 ms 180476 KB Output is correct
37 Correct 456 ms 175292 KB Output is correct
38 Correct 421 ms 175292 KB Output is correct
39 Correct 371 ms 174864 KB Output is correct
40 Correct 398 ms 175032 KB Output is correct
41 Correct 332 ms 175116 KB Output is correct
42 Correct 301 ms 174980 KB Output is correct
43 Correct 197 ms 173000 KB Output is correct
44 Correct 344 ms 175288 KB Output is correct
45 Correct 317 ms 175240 KB Output is correct
46 Correct 346 ms 175092 KB Output is correct
47 Correct 236 ms 174520 KB Output is correct
48 Correct 242 ms 174520 KB Output is correct
49 Correct 266 ms 174780 KB Output is correct
50 Correct 242 ms 174776 KB Output is correct
51 Correct 311 ms 174660 KB Output is correct
52 Correct 1763 ms 231096 KB Output is correct
53 Correct 2574 ms 221136 KB Output is correct
54 Correct 1765 ms 265660 KB Output is correct
55 Correct 1756 ms 237052 KB Output is correct
56 Correct 2575 ms 220868 KB Output is correct
57 Correct 2540 ms 221140 KB Output is correct
58 Correct 1508 ms 265728 KB Output is correct
59 Correct 1351 ms 236944 KB Output is correct
60 Correct 1488 ms 226868 KB Output is correct
61 Correct 2129 ms 221924 KB Output is correct
62 Correct 1514 ms 220820 KB Output is correct
63 Correct 1573 ms 221620 KB Output is correct
64 Correct 2652 ms 230364 KB Output is correct
65 Execution timed out 5071 ms 193396 KB Time limit exceeded
66 Halted 0 ms 0 KB -