oj.uz

답안 #487809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
487809 2021-11-16T17:25:13 Z leaked 새 집 (APIO18_new_home) C++14
47 / 100
 5000 ms 331892 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define sz(x) (int)(x).size()
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define vec vector
#define pw(x) (1LL<<(x))
#define m_p make_pair
#define fast_iati ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;

template <class T> bool umin(T &a,const T &b){return (a>b?a=b,1:0);}
template <class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
typedef long long ll;
typedef pair<int,int> pii;

const int N=3e5+100;
bool del[5*N];
struct segtree{
    priority_queue<pii> st[4*N];
    void add(int l,int r,int tp,pii x,int v,int tl,int tr){
        if(tl>=l&&tr<=r){
            st[v].push(x);
            return;
        }
        if(tl>r||tr<l) return;
        int tm=(tl+tr)>>1;
        add(l,r,tp,x,2*v,tl,tm);add(l,r,tp,x,2*v+1,tm+1,tr);
    }
    int get(int id,int v,int tl,int tr){
        int ans=-1e9;
        while(sz(st[v]) && del[st[v].top().s]) st[v].pop();
        if(sz(st[v]))
            ans=st[v].top().f;
        if(tl==tr){
            return ans;
        }
        int tm=(tl+tr)>>1;
        if(tm>=id)
            return max(ans,get(id,2*v,tl,tm));
        else
            return max(ans,get(id,2*v+1,tm+1,tr));
    }
}lft,rgt;
vec<int> kek;
map<pii,int>mp;
int tmr;
int gl(int x){
    return upper_bound(all(kek),x)-kek.begin()-1;
}
int gu(int x){
    return upper_bound(all(kek),x)-kek.begin();
}
void add(int l,int r,int t,int tp){
    if(l==r) return;
    int mid=(l+r)>>1;
    if(!t){
        del[mp[{l,tp}]]=1;
        return;
    }
    mp[{l,tp}]=tmr;
    if(gl(mid)>=0){
        lft.add(gl(l),gl(mid),t,{-l,tmr},1,0,sz(kek)-1);
    }
    if(gl(mid)+1<=gl(r))
        rgt.add(gl(mid)+1,gl(r),t,{r,tmr},1,0,sz(kek)-1);
    ++tmr;
}
const int Nax=3e5+1;
multiset<int> st[N];
vec<int>here[N];
signed main(){
    fast_iati;
    int n,q,k;
    cin>>n>>k>>q;
    vec<array<int,3>>arr;
    vec<int>x(n),a(n),b(n),t(n);
    for(int i=0;i<n;i++){
        cin>>x[i]>>t[i]>>a[i]>>b[i];
//        x[i]=rand(),t[i]=rand()%k+1;
//        a[i]=rand(),b[i]=rand();
//        if(a[i]>b[i])
//            swap(a[i],b[i]);
//        kek.pb(x[i]);
        arr.pb({a[i],0,i});
        arr.pb({b[i]+1,-1,i});
        --t[i];
        here[t[i]].pb(i);
    }
    vec<int>l(q),y(q);
    for(int i=0;i<q;i++){
        cin>>l[i]>>y[i];
//        l[i]=rand(),y[i]=rand();
        kek.pb(l[i]);
        arr.pb({y[i],2,i});
    }
    sort(all(kek));kek.erase(unique(all(kek)),kek.end());
    sort(all(arr));
    auto stupid=[&](array<int,3> z){
        pii me={-1e9,0};
        int tx=l[z[1]];
        for(int j=0;j<k;j++){
            if(sz(st[j])==2) continue;
////            cout<<"TYP "<<endl;
////            for(auto &z : st[j])
////                cout<<z<<' ';
////            cout<<endl
            auto it=st[j].lower_bound(tx);
            int omn=2e9;
            if(it!=st[j].end()) umin(omn,*it-tx);
            if(it!=st[j].begin()) umin(omn,tx-*prev(it));
            umax(me.f,omn);me.s++;
        }
        return me;
    };
    auto solve=[&](array<int,3> z){
        int x=l[z[1]];
        x=gl(x);
        int fe=lft.get(x,1,0,sz(kek)-1)+l[z[1]];
        int si=rgt.get(x,1,0,sz(kek)-1)-l[z[1]];
        return max(fe,si);
    };
    vec<int>cnt(k,0);
    for(int i=0;i<k;i++){
        add(-3e8,3e8,1,i);
        st[i].insert(-3e8);
        st[i].insert(3e8);
    }
    int total=0;
    vec<int>ans(q,-1);
    for(auto &z : arr){
        swap(z[1],z[2]);
        if(z[2]==2){
            if(total!=k){
                ans[z[1]]=-1;
                continue;
            }
            int rio=solve(z);
            ans[z[1]]=rio;
        }
        else if(z[2]==-1){
            int i=z[1];
            auto it=st[t[i]].lower_bound(x[i]);
            add(x[i],*next(it),0,t[i]);
            add(*prev(it),x[i],0,t[i]);
            add(*prev(it),*next(it),1,t[i]);
            st[t[i]].erase(it);
            cnt[t[i]]--;
            if(!cnt[t[i]]) total--;
        }
        else{
            int i=z[1];
            if(!cnt[t[i]]) total++;
            cnt[t[i]]++;
            st[t[i]].insert(x[i]);
            auto it=st[t[i]].lower_bound(x[i]);
            add(*prev(it),*next(it),0,t[i]);
            add(x[i],*next(it),1,t[i]);
            add(*prev(it),x[i],1,t[i]);
        }
    }
    for(auto &z : ans)
        cout<<z<<'\n';
    return 0;
}
/*
4 2 4
3 1 1 10
9 2 2 4
7 2 5 7
4 1 8 10
5 3
5 6
5 9
1 10


2 1 3
1 1 1 4
1 1 2 6
1 3
1 5
1 7

1 1 1
100000000 1 1 1
1 1
*/

Compilation message

new_home.cpp: In function 'int main()':
new_home.cpp:103:10: warning: variable 'stupid' set but not used [-Wunused-but-set-variable]
  103 |     auto stupid=[&](array<int,3> z){
      |          ^~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 96560 KB Output is correct
2 Correct 41 ms 96580 KB Output is correct
3 Correct 41 ms 96548 KB Output is correct
4 Correct 42 ms 96508 KB Output is correct
5 Correct 43 ms 96624 KB Output is correct
6 Correct 47 ms 96728 KB Output is correct
7 Correct 49 ms 96716 KB Output is correct
8 Correct 48 ms 96812 KB Output is correct
9 Correct 42 ms 96788 KB Output is correct
10 Correct 44 ms 96760 KB Output is correct
11 Correct 44 ms 96708 KB Output is correct
12 Correct 43 ms 96708 KB Output is correct
13 Correct 43 ms 96728 KB Output is correct
14 Correct 54 ms 96708 KB Output is correct
15 Correct 46 ms 96716 KB Output is correct
16 Correct 53 ms 96840 KB Output is correct
17 Correct 44 ms 96732 KB Output is correct
18 Correct 45 ms 96792 KB Output is correct
19 Correct 44 ms 96692 KB Output is correct
20 Correct 46 ms 96740 KB Output is correct
21 Correct 43 ms 96716 KB Output is correct
22 Correct 43 ms 96752 KB Output is correct
23 Correct 58 ms 96708 KB Output is correct
24 Correct 49 ms 96756 KB Output is correct
25 Correct 52 ms 96764 KB Output is correct
26 Correct 45 ms 96836 KB Output is correct
27 Correct 44 ms 96672 KB Output is correct
28 Correct 43 ms 96728 KB Output is correct
29 Correct 45 ms 96704 KB Output is correct
30 Correct 43 ms 96632 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 96560 KB Output is correct
2 Correct 41 ms 96580 KB Output is correct
3 Correct 41 ms 96548 KB Output is correct
4 Correct 42 ms 96508 KB Output is correct
5 Correct 43 ms 96624 KB Output is correct
6 Correct 47 ms 96728 KB Output is correct
7 Correct 49 ms 96716 KB Output is correct
8 Correct 48 ms 96812 KB Output is correct
9 Correct 42 ms 96788 KB Output is correct
10 Correct 44 ms 96760 KB Output is correct
11 Correct 44 ms 96708 KB Output is correct
12 Correct 43 ms 96708 KB Output is correct
13 Correct 43 ms 96728 KB Output is correct
14 Correct 54 ms 96708 KB Output is correct
15 Correct 46 ms 96716 KB Output is correct
16 Correct 53 ms 96840 KB Output is correct
17 Correct 44 ms 96732 KB Output is correct
18 Correct 45 ms 96792 KB Output is correct
19 Correct 44 ms 96692 KB Output is correct
20 Correct 46 ms 96740 KB Output is correct
21 Correct 43 ms 96716 KB Output is correct
22 Correct 43 ms 96752 KB Output is correct
23 Correct 58 ms 96708 KB Output is correct
24 Correct 49 ms 96756 KB Output is correct
25 Correct 52 ms 96764 KB Output is correct
26 Correct 45 ms 96836 KB Output is correct
27 Correct 44 ms 96672 KB Output is correct
28 Correct 43 ms 96728 KB Output is correct
29 Correct 45 ms 96704 KB Output is correct
30 Correct 43 ms 96632 KB Output is correct
31 Correct 1154 ms 139464 KB Output is correct
32 Correct 171 ms 104420 KB Output is correct
33 Correct 881 ms 122400 KB Output is correct
34 Correct 1160 ms 138880 KB Output is correct
35 Correct 1093 ms 133920 KB Output is correct
36 Correct 883 ms 122592 KB Output is correct
37 Correct 659 ms 123624 KB Output is correct
38 Correct 506 ms 117332 KB Output is correct
39 Correct 445 ms 118356 KB Output is correct
40 Correct 451 ms 116976 KB Output is correct
41 Correct 796 ms 119284 KB Output is correct
42 Correct 807 ms 124248 KB Output is correct
43 Correct 121 ms 106080 KB Output is correct
44 Correct 820 ms 118984 KB Output is correct
45 Correct 778 ms 116052 KB Output is correct
46 Correct 694 ms 115120 KB Output is correct
47 Correct 314 ms 118096 KB Output is correct
48 Correct 340 ms 117500 KB Output is correct
49 Correct 399 ms 120160 KB Output is correct
50 Correct 467 ms 125416 KB Output is correct
51 Correct 430 ms 118648 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5090 ms 331892 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5037 ms 327128 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 96560 KB Output is correct
2 Correct 41 ms 96580 KB Output is correct
3 Correct 41 ms 96548 KB Output is correct
4 Correct 42 ms 96508 KB Output is correct
5 Correct 43 ms 96624 KB Output is correct
6 Correct 47 ms 96728 KB Output is correct
7 Correct 49 ms 96716 KB Output is correct
8 Correct 48 ms 96812 KB Output is correct
9 Correct 42 ms 96788 KB Output is correct
10 Correct 44 ms 96760 KB Output is correct
11 Correct 44 ms 96708 KB Output is correct
12 Correct 43 ms 96708 KB Output is correct
13 Correct 43 ms 96728 KB Output is correct
14 Correct 54 ms 96708 KB Output is correct
15 Correct 46 ms 96716 KB Output is correct
16 Correct 53 ms 96840 KB Output is correct
17 Correct 44 ms 96732 KB Output is correct
18 Correct 45 ms 96792 KB Output is correct
19 Correct 44 ms 96692 KB Output is correct
20 Correct 46 ms 96740 KB Output is correct
21 Correct 43 ms 96716 KB Output is correct
22 Correct 43 ms 96752 KB Output is correct
23 Correct 58 ms 96708 KB Output is correct
24 Correct 49 ms 96756 KB Output is correct
25 Correct 52 ms 96764 KB Output is correct
26 Correct 45 ms 96836 KB Output is correct
27 Correct 44 ms 96672 KB Output is correct
28 Correct 43 ms 96728 KB Output is correct
29 Correct 45 ms 96704 KB Output is correct
30 Correct 43 ms 96632 KB Output is correct
31 Correct 1154 ms 139464 KB Output is correct
32 Correct 171 ms 104420 KB Output is correct
33 Correct 881 ms 122400 KB Output is correct
34 Correct 1160 ms 138880 KB Output is correct
35 Correct 1093 ms 133920 KB Output is correct
36 Correct 883 ms 122592 KB Output is correct
37 Correct 659 ms 123624 KB Output is correct
38 Correct 506 ms 117332 KB Output is correct
39 Correct 445 ms 118356 KB Output is correct
40 Correct 451 ms 116976 KB Output is correct
41 Correct 796 ms 119284 KB Output is correct
42 Correct 807 ms 124248 KB Output is correct
43 Correct 121 ms 106080 KB Output is correct
44 Correct 820 ms 118984 KB Output is correct
45 Correct 778 ms 116052 KB Output is correct
46 Correct 694 ms 115120 KB Output is correct
47 Correct 314 ms 118096 KB Output is correct
48 Correct 340 ms 117500 KB Output is correct
49 Correct 399 ms 120160 KB Output is correct
50 Correct 467 ms 125416 KB Output is correct
51 Correct 430 ms 118648 KB Output is correct
52 Correct 501 ms 130976 KB Output is correct
53 Correct 517 ms 128516 KB Output is correct
54 Correct 835 ms 138020 KB Output is correct
55 Correct 721 ms 125916 KB Output is correct
56 Correct 690 ms 127420 KB Output is correct
57 Correct 838 ms 123428 KB Output is correct
58 Correct 702 ms 127784 KB Output is correct
59 Correct 658 ms 129148 KB Output is correct
60 Correct 811 ms 125900 KB Output is correct
61 Correct 186 ms 120836 KB Output is correct
62 Correct 556 ms 130144 KB Output is correct
63 Correct 692 ms 133376 KB Output is correct
64 Correct 759 ms 134220 KB Output is correct
65 Correct 820 ms 133144 KB Output is correct
66 Correct 844 ms 122788 KB Output is correct
67 Correct 282 ms 113260 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 96560 KB Output is correct
2 Correct 41 ms 96580 KB Output is correct
3 Correct 41 ms 96548 KB Output is correct
4 Correct 42 ms 96508 KB Output is correct
5 Correct 43 ms 96624 KB Output is correct
6 Correct 47 ms 96728 KB Output is correct
7 Correct 49 ms 96716 KB Output is correct
8 Correct 48 ms 96812 KB Output is correct
9 Correct 42 ms 96788 KB Output is correct
10 Correct 44 ms 96760 KB Output is correct
11 Correct 44 ms 96708 KB Output is correct
12 Correct 43 ms 96708 KB Output is correct
13 Correct 43 ms 96728 KB Output is correct
14 Correct 54 ms 96708 KB Output is correct
15 Correct 46 ms 96716 KB Output is correct
16 Correct 53 ms 96840 KB Output is correct
17 Correct 44 ms 96732 KB Output is correct
18 Correct 45 ms 96792 KB Output is correct
19 Correct 44 ms 96692 KB Output is correct
20 Correct 46 ms 96740 KB Output is correct
21 Correct 43 ms 96716 KB Output is correct
22 Correct 43 ms 96752 KB Output is correct
23 Correct 58 ms 96708 KB Output is correct
24 Correct 49 ms 96756 KB Output is correct
25 Correct 52 ms 96764 KB Output is correct
26 Correct 45 ms 96836 KB Output is correct
27 Correct 44 ms 96672 KB Output is correct
28 Correct 43 ms 96728 KB Output is correct
29 Correct 45 ms 96704 KB Output is correct
30 Correct 43 ms 96632 KB Output is correct
31 Correct 1154 ms 139464 KB Output is correct
32 Correct 171 ms 104420 KB Output is correct
33 Correct 881 ms 122400 KB Output is correct
34 Correct 1160 ms 138880 KB Output is correct
35 Correct 1093 ms 133920 KB Output is correct
36 Correct 883 ms 122592 KB Output is correct
37 Correct 659 ms 123624 KB Output is correct
38 Correct 506 ms 117332 KB Output is correct
39 Correct 445 ms 118356 KB Output is correct
40 Correct 451 ms 116976 KB Output is correct
41 Correct 796 ms 119284 KB Output is correct
42 Correct 807 ms 124248 KB Output is correct
43 Correct 121 ms 106080 KB Output is correct
44 Correct 820 ms 118984 KB Output is correct
45 Correct 778 ms 116052 KB Output is correct
46 Correct 694 ms 115120 KB Output is correct
47 Correct 314 ms 118096 KB Output is correct
48 Correct 340 ms 117500 KB Output is correct
49 Correct 399 ms 120160 KB Output is correct
50 Correct 467 ms 125416 KB Output is correct
51 Correct 430 ms 118648 KB Output is correct
52 Execution timed out 5090 ms 331892 KB Time limit exceeded
53 Halted 0 ms 0 KB -