oj.uz

답안 #1040339

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1040339 2024-08-01T01:37:24 Z hotboy2703 청소 (JOI20_sweeping) C++17
100 / 100
 2436 ms 387452 KB 
    #include<bits/stdc++.h>
    using ll = int;
    using namespace std;
    #define pll pair <ll,ll>
    #define fi first
    #define se second
    #define MP make_pair
    #define sz(a) (ll((a).size()))
    #define BIT(mask,i) (((mask) >> (i))&1)
    #define MASK(i) (1LL << (i))
    const ll INF = 1e9;
    const ll MAXN = 1.5e6+100;
    struct query{
        ll t,p,x,y;
    };
    pll ans[MAXN];
    ll val[MAXN*2];
    ll dsu[MAXN*2];
    ll side[MAXN*2];
    vector <ll> comp[MAXN*2];

    ll n,m,q;
    ll join(ll x,ll y){
        if (sz(comp[x]) < sz(comp[y]))swap(x,y);
        for (auto z:comp[y]){comp[x].push_back(z);dsu[z] = x;}
        return x;
    }
    void dnc(ll l,ll r,vector <query> &all){
        ll mid = (l + r) >> 1;
        vector <query> L,R;
        if (sz(all)==0)return;
        for (auto x:all){
            if (x.t == 4){
                dsu[x.p<<1] = x.p<<1;
                dsu[x.p<<1|1] = x.p<<1|1;
                comp[x.p<<1] = {x.p<<1};
                comp[x.p<<1|1] = {x.p<<1|1};
                val[x.p<<1] = x.x;
                val[x.p<<1|1] = x.y;
                side[x.p] = 0;
            }
        }
        if (l==r){
            for (auto [t,p,x,y]:all){
                if (t==1){
                    ans[x] = MP(val[p<<1],val[p<<1|1]);  
                }
            }
            return;
        }
        priority_queue <pll,vector <pll>, greater <> > px,py;
        for (auto cur:all){
            auto [t,p,x,y] = cur;
            if (t==1){
                if (side[p] == 0){
                    // cout<<l<<' '<<r<<' '<<x<<' '<<p<<endl;
                    ans[x] = MP(val[dsu[p<<1]],val[dsu[p<<1|1]]); 
                }
                else if (side[p] == 1)L.push_back(cur);
                else if (side[p] == 2){R.push_back(cur);}
            }
            if (t==2){
                if (n-x>=mid+1){
                    R.push_back(cur);
                    while (!py.empty() && py.top().fi <= x){
                        ll u = py.top().se;
                        py.pop();
                        for (auto z:comp[u]){
                            if (side[z>>1]==0){
                                // cout<<l<<' '<<r<<' '<<(z>>1)<<' '<<val[dsu[16]]<<' '<<val[dsu[17]]<<endl;
                                side[z>>1] = 2;
                                z = z>>1;
                                // if (z==8)cout<<"SUS "<<l<<' '<<r<<' '<<side[z]<<' '<<val[z<<1]<<' '<<val[z<<1|1]<<'\n';
                                R.push_back({4,z,n-x,val[u]});
                            }
                        }
                    }
                    
                }
                else{
                    ll r = 0;
                    while (!px.empty() && px.top().fi <= n-x){
                        ll u = px.top().se;
                        px.pop();
                        // cout<<l<<' '<<r<<' '<<u<<endl;
                        r = r?join(r,u):u;
                    }
                    if (r){
                        val[r] = n-x;
                        // cout<<val[dsu[16]]<<endl;
                        px.push(MP(val[r],r));
                    }
                    L.push_back(cur);
                }
            }
            if (t==3){
                if (x <= mid){
                    L.push_back(cur);
                    while (!px.empty() && px.top().fi <= x){
                        ll u = px.top().se;
                        px.pop();
                        for (auto z:comp[u]){
                            if (side[z>>1]==0){
                                side[z>>1] = 1;
                                // val[z] = val[u];
                                // val[z^1] = n-x;
                                z=z>>1;
                                L.push_back({4,z,val[u],n-x});
                            }
                        }
                    }
                    
                }
                else{
                    
                    ll r = 0;
                    while (!py.empty() && py.top().fi <= n-x){
                        ll u = py.top().se;
                        py.pop();
                        r = r?join(r,u):u;
                    }
                    if (r){
                        val[r] = n-x;
                        py.push(MP(val[r],r));
                    }
                    R.push_back(cur);
                }
            }
            if (t==4){
                if (x >= mid + 1){
                    R.push_back(cur);
                    side[p] = 2;
                }
                else if (y >= n-mid){
                    L.push_back(cur);
                    side[p] = 1;
                }
                else{
                    px.push(MP(val[p<<1],p<<1));
                    py.push(MP(val[p<<1|1],p<<1|1));
                }
            }
        }
        
        dnc(l,mid,L);
        dnc(mid+1,r,R);
    }
    int main(){
        ios_base::sync_with_stdio(0);cin.tie(nullptr);
        // freopen("1.inp","r",stdin);
        // freopen("1.out","w",stdout);
        cin>>n>>m>>q;
        vector <query> all;
        ll ptr = 0;
        for (ll i = 1;i <= m;i ++){
            ll x,y;
            cin>>x>>y;
            all.push_back({4,++ptr,x,y});
        }
        ll cnt=0;
        for (ll i = 1;i <= q;i ++){
            ll t;
            cin>>t;
            if (t==1){
                ll p;
                cin>>p;
                all.push_back({1,p,++cnt,-1});
            }
            if (t==2){
                ll x;
                cin>>x;
                all.push_back({2,-1,x,-1});
            }
            if (t==3){
                ll x;
                cin>>x;
                all.push_back({3,-1,x,-1});
            }
            if (t==4){
                ll x,y;
                cin>>x>>y;
                all.push_back({4,++ptr,x,y});
            }
        }
        dnc(0,n,all);
        for (ll i = 1;i <= cnt;i ++)cout<<ans[i].fi<<' '<<ans[i].se<<'\n';
        return 0;
    }

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 71772 KB Output is correct
2 Correct 23 ms 71308 KB Output is correct
3 Correct 21 ms 71516 KB Output is correct
4 Correct 23 ms 71704 KB Output is correct
5 Correct 23 ms 71772 KB Output is correct
6 Correct 21 ms 71516 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1634 ms 250160 KB Output is correct
2 Correct 1654 ms 247072 KB Output is correct
3 Correct 1600 ms 248560 KB Output is correct
4 Correct 1526 ms 267284 KB Output is correct
5 Correct 2345 ms 264648 KB Output is correct
6 Correct 2126 ms 280088 KB Output is correct
7 Correct 1577 ms 234300 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1201 ms 259180 KB Output is correct
2 Correct 1202 ms 273388 KB Output is correct
3 Correct 1024 ms 250220 KB Output is correct
4 Correct 1317 ms 337844 KB Output is correct
5 Correct 1387 ms 296728 KB Output is correct
6 Correct 1159 ms 259792 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1201 ms 259180 KB Output is correct
2 Correct 1202 ms 273388 KB Output is correct
3 Correct 1024 ms 250220 KB Output is correct
4 Correct 1317 ms 337844 KB Output is correct
5 Correct 1387 ms 296728 KB Output is correct
6 Correct 1159 ms 259792 KB Output is correct
7 Correct 1565 ms 238716 KB Output is correct
8 Correct 1515 ms 252860 KB Output is correct
9 Correct 1594 ms 244468 KB Output is correct
10 Correct 1511 ms 254232 KB Output is correct
11 Correct 1975 ms 294192 KB Output is correct
12 Correct 2133 ms 276920 KB Output is correct
13 Correct 1959 ms 376300 KB Output is correct
14 Correct 101 ms 116996 KB Output is correct
15 Correct 416 ms 201852 KB Output is correct
16 Correct 1499 ms 228892 KB Output is correct
17 Correct 1491 ms 241272 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 71772 KB Output is correct
2 Correct 23 ms 71308 KB Output is correct
3 Correct 21 ms 71516 KB Output is correct
4 Correct 23 ms 71704 KB Output is correct
5 Correct 23 ms 71772 KB Output is correct
6 Correct 21 ms 71516 KB Output is correct
7 Correct 1634 ms 250160 KB Output is correct
8 Correct 1654 ms 247072 KB Output is correct
9 Correct 1600 ms 248560 KB Output is correct
10 Correct 1526 ms 267284 KB Output is correct
11 Correct 2345 ms 264648 KB Output is correct
12 Correct 2126 ms 280088 KB Output is correct
13 Correct 1577 ms 234300 KB Output is correct
14 Correct 1201 ms 259180 KB Output is correct
15 Correct 1202 ms 273388 KB Output is correct
16 Correct 1024 ms 250220 KB Output is correct
17 Correct 1317 ms 337844 KB Output is correct
18 Correct 1387 ms 296728 KB Output is correct
19 Correct 1159 ms 259792 KB Output is correct
20 Correct 1565 ms 238716 KB Output is correct
21 Correct 1515 ms 252860 KB Output is correct
22 Correct 1594 ms 244468 KB Output is correct
23 Correct 1511 ms 254232 KB Output is correct
24 Correct 1975 ms 294192 KB Output is correct
25 Correct 2133 ms 276920 KB Output is correct
26 Correct 1959 ms 376300 KB Output is correct
27 Correct 101 ms 116996 KB Output is correct
28 Correct 416 ms 201852 KB Output is correct
29 Correct 1499 ms 228892 KB Output is correct
30 Correct 1491 ms 241272 KB Output is correct
31 Correct 1580 ms 265424 KB Output is correct
32 Correct 1609 ms 245840 KB Output is correct
33 Correct 1622 ms 224944 KB Output is correct
34 Correct 1854 ms 275188 KB Output is correct
35 Correct 1865 ms 263988 KB Output is correct
36 Correct 1663 ms 266292 KB Output is correct
37 Correct 2436 ms 372376 KB Output is correct
38 Correct 2168 ms 387452 KB Output is correct
39 Correct 2051 ms 347236 KB Output is correct
40 Correct 1580 ms 244860 KB Output is correct