oj.uz

답안 #1092216

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092216 2024-09-23T15:13:17 Z BLOBVISGOD 가로등 (APIO19_street_lamps) C++17
100 / 100
 1578 ms 60032 KB 
#include "bits/stdc++.h"
using namespace std;
#define rep(i,a,b) for(int i=(a); i<(b); ++i)
#define all(x) x.begin(),x.end()
#define sz(x) int(x.size())
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;

const int M = 300005; 

template<typename T>
struct fentree{
    vector<T> BIT;
    fentree(int n) : BIT(n+1) {}
    fentree(vector<T> a) : BIT(sz(a)+1){
        rep(i,0,sz(a)) BIT[i+1] = a[i]; // how better?
        rep(i,0,sz(BIT)) if (i+(i&(-i))<sz(BIT)) BIT[i+(i&(-i))] += BIT[i];
    }
    void add(int i, T v){
        for(i++; i<sz(BIT); i+=i&(-i)) BIT[i] += v;
    }
    // for halfopen interval [l,r)
    void rangeadd(int l, int r, T v){
        add(l,v);
        add(r,-v);
    }
    // halfopen query : [0,r)
    T get(int r){
        T ans = {};
        for(;r>0;r-=r&(-r)) ans += BIT[r];
        return ans;
    }
    T pointget(int i){
        T ans = {};
        for(i++;i>0;i-=i&(-i)) ans += BIT[i];
        return ans;
    }
    // returns first index r such that the sum of [0,r] is at least v, or returns n
    int lower_bound(T v){
        T sm = {};
        int at = 0;
        for(int w = 1<<__lg(sz(BIT)); w; w/=2){
            if (at+w<sz(BIT) and sm + BIT[at+w] < v){ 
                at += w;
                sm += BIT[at];
            }
        }
        return at;
    }
    // returns first index r such that the sum of [0,r] is at greater than v, or returns n
    int upper_bound(T v){
        T sm = {};
        int at = 0;
        for(int w = 1<<__lg(sz(BIT)); w; w/=2){
            if (at+w<sz(BIT) and sm + BIT[at+w] <= v){
                at += w;
                sm += BIT[at];
            }
        }
        return at;
    }
    // returns first index r such that the sum of [0,r] is at most v, or returns n
    int lower_bound_decr(T v){
        T sm = {};
        int at = 0;
        for(int w = 1<<__lg(sz(BIT)); w; w/=2){
            if (at+w<sz(BIT) and sm + BIT[at+w] > v){
                at += w;
                sm += BIT[at];
            }
        }
        return at;
    }
    // returns first index r such that the sum of [0,r] is less than v, or returns n
    int upper_bound_decr(T v){
        T sm = {};
        int at = 0;
        for(int w = 1<<__lg(sz(BIT)); w; w/=2){
            if (at+w<sz(BIT) and sm + BIT[at+w] >= v){
                at += w;
                sm += BIT[at];
            }
        }
        return at;
    }
};


const int oo = 1e9;

int main(){
    cin.tie(NULL),cin.sync_with_stdio(false);
    
    int n,q; cin >> n >> q;
    string s; cin >> s;


    vector<array<int,4>> blocks; // l,r,starttime, endtime+1;
    set<array<int,3>> segs; // l,r,starttime

    vector<array<int,4>> queries; // l,r,time

    for(int i = 0; i < n; ++i){
        if (s[i]=='0') continue;
        int l = i;
        while (i<n and s[i] == '1') i++;
        int r = i;
        segs.insert({l,r,0});
    }

    segs.insert({-oo,-oo,-oo});
    segs.insert({oo,oo,oo});

    // sweep through events;
    rep(i,0,q){
        string t; cin >> t;
        if (t[0]=='q'){
            int l,r; cin >> l >> r;
            l--,r--;
            queries.push_back({l,r,i,sz(queries)});
        }else{
            int x; cin >> x;
            x--;
            if (s[x]=='0'){
                s[x] = '1';
                auto ub = segs.upper_bound({x,x,oo});
                auto lb = ub; lb--;
                array<int,3> ls = *lb;

                int lo = x, hi = x+1;
                // create new block
                if (ls[1] == x){
                    lo = ls[0];
                    blocks.push_back({ls[0],ls[1],ls[2],i+1});
                    segs.erase(lb);
                }

                ub = segs.upper_bound({x,x,oo});
                array<int,3> us = *ub;

                if (us[0] == x+1){
                    hi = us[1];
                    blocks.push_back({us[0],us[1],us[2],i+1});
                    segs.erase(ub);
                }

                segs.insert({lo,hi,i+1});
            }else{
                s[x] = '0';
                auto ub = segs.upper_bound({x,oo,oo});
                ub--;
                // break up this segment
                array<int,3> v = *ub;
                segs.erase(ub);

                blocks.push_back({v[0],v[1],v[2],i+1});

                if (v[0] < x){
                    segs.insert({v[0],x,i+1});
                }if (v[1] > x+1){
                    segs.insert({x+1,v[1],i+1});
                }
            }
        }
    }

    for(auto [l,r,t] : segs){
        if (abs(l) < oo ) blocks.push_back({l,r,t,q});
    }

    vi ans(sz(queries));
    vi eventans;
    
    struct event{
        int t,x,y,id,v;
        bool operator<(event b){
            return t<b.t or (t==b.t and id < b.id);
        }
    };

    // handle linear events and constant events separately
    // r is inverted, so prefix query gives all nodes (l,r) with l>=L, r<=R
    vector<event> Elin, Econ;
    for (auto [l,r,t1,t2] : blocks){
        Elin.push_back({t1,l,M-r,-1,1}); // assume query is closed
        Elin.push_back({t2,l,M-r,-1,-1});
        Econ.push_back({t1,l,M-r,-1,1-t1});
        Econ.push_back({t2,l,M-r,-1,t2-1});
    }

    for (auto [l,r,t,id] : queries){
        Elin.push_back({t,l,M-r,id,0});
        Econ.push_back({t,l,M-r,id,0});
    }

    sort(all(Elin));
    sort(all(Econ));

    fentree<int> fen(M+5);


    auto rec = [&](int ql, int qr, auto&& rec, bool lin, vector<event>& src) -> void {
        if (ql+1 == qr) return;

        int mid = (ql+qr)/2;

        rec(ql,mid,rec,lin, src);
        rec(mid,qr,rec,lin, src);

        // contribute L to R || NOTE CLOSED INTERVALS
        struct ev{
            int x, y, id, v;
            bool operator<(ev b){
                return x<b.x or (x==b.x and id<b.id);
            }
        };

        vector<ev> E;
        rep(i,ql,mid){
            auto& e = src[i];
            if (e.id<0) E.push_back(ev{e.x,e.y,e.id,e.v});
        }
        rep(i,mid,qr){
            auto& e = src[i];
            if (e.id>=0) E.push_back(ev{e.x,e.y,e.id,e.t});
        }

        sort(all(E));

        for(auto& e : E){
            if (e.id<0){
                fen.add(e.y,e.v);
            }else{
                ans[e.id] += fen.get(e.y+1)*(lin?e.v:1);
            }
        }   

        // undo fenwick operations
        for(auto& e : E){
            if (e.id<0){
                fen.add(e.y,-e.v);
            }
        }
    };

    rec(0,sz(Elin),rec,1,Elin);
    rec(0,sz(Econ),rec,0,Econ);

    for(auto c : ans) cout << c << '\n';
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 733 ms 36044 KB Output is correct
2 Correct 817 ms 36404 KB Output is correct
3 Correct 840 ms 37336 KB Output is correct
4 Correct 1263 ms 55352 KB Output is correct
5 Correct 1196 ms 51360 KB Output is correct
6 Correct 1303 ms 58228 KB Output is correct
7 Correct 492 ms 33460 KB Output is correct
8 Correct 486 ms 34748 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1628 KB Output is correct
2 Correct 3 ms 1884 KB Output is correct
3 Correct 2 ms 1628 KB Output is correct
4 Correct 2 ms 1628 KB Output is correct
5 Correct 1222 ms 52964 KB Output is correct
6 Correct 1298 ms 55476 KB Output is correct
7 Correct 1180 ms 49592 KB Output is correct
8 Correct 488 ms 34740 KB Output is correct
9 Correct 255 ms 23500 KB Output is correct
10 Correct 301 ms 28580 KB Output is correct
11 Correct 312 ms 28488 KB Output is correct
12 Correct 499 ms 33460 KB Output is correct
13 Correct 509 ms 34828 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1624 KB Output is correct
2 Correct 2 ms 1628 KB Output is correct
3 Correct 4 ms 1884 KB Output is correct
4 Correct 3 ms 1884 KB Output is correct
5 Correct 761 ms 45916 KB Output is correct
6 Correct 1051 ms 55536 KB Output is correct
7 Correct 1325 ms 57820 KB Output is correct
8 Correct 1578 ms 60032 KB Output is correct
9 Correct 837 ms 43980 KB Output is correct
10 Correct 826 ms 45744 KB Output is correct
11 Correct 817 ms 43952 KB Output is correct
12 Correct 829 ms 45736 KB Output is correct
13 Correct 812 ms 43984 KB Output is correct
14 Correct 839 ms 45740 KB Output is correct
15 Correct 494 ms 33464 KB Output is correct
16 Correct 510 ms 34680 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1628 KB Output is correct
2 Correct 1 ms 1628 KB Output is correct
3 Correct 1 ms 1628 KB Output is correct
4 Correct 1 ms 1628 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 1 ms 1628 KB Output is correct
7 Correct 1 ms 1628 KB Output is correct
8 Correct 733 ms 36044 KB Output is correct
9 Correct 817 ms 36404 KB Output is correct
10 Correct 840 ms 37336 KB Output is correct
11 Correct 1263 ms 55352 KB Output is correct
12 Correct 1196 ms 51360 KB Output is correct
13 Correct 1303 ms 58228 KB Output is correct
14 Correct 492 ms 33460 KB Output is correct
15 Correct 486 ms 34748 KB Output is correct
16 Correct 3 ms 1628 KB Output is correct
17 Correct 3 ms 1884 KB Output is correct
18 Correct 2 ms 1628 KB Output is correct
19 Correct 2 ms 1628 KB Output is correct
20 Correct 1222 ms 52964 KB Output is correct
21 Correct 1298 ms 55476 KB Output is correct
22 Correct 1180 ms 49592 KB Output is correct
23 Correct 488 ms 34740 KB Output is correct
24 Correct 255 ms 23500 KB Output is correct
25 Correct 301 ms 28580 KB Output is correct
26 Correct 312 ms 28488 KB Output is correct
27 Correct 499 ms 33460 KB Output is correct
28 Correct 509 ms 34828 KB Output is correct
29 Correct 3 ms 1624 KB Output is correct
30 Correct 2 ms 1628 KB Output is correct
31 Correct 4 ms 1884 KB Output is correct
32 Correct 3 ms 1884 KB Output is correct
33 Correct 761 ms 45916 KB Output is correct
34 Correct 1051 ms 55536 KB Output is correct
35 Correct 1325 ms 57820 KB Output is correct
36 Correct 1578 ms 60032 KB Output is correct
37 Correct 837 ms 43980 KB Output is correct
38 Correct 826 ms 45744 KB Output is correct
39 Correct 817 ms 43952 KB Output is correct
40 Correct 829 ms 45736 KB Output is correct
41 Correct 812 ms 43984 KB Output is correct
42 Correct 839 ms 45740 KB Output is correct
43 Correct 494 ms 33464 KB Output is correct
44 Correct 510 ms 34680 KB Output is correct
45 Correct 435 ms 24960 KB Output is correct
46 Correct 485 ms 25712 KB Output is correct
47 Correct 690 ms 30924 KB Output is correct
48 Correct 1254 ms 54896 KB Output is correct
49 Correct 351 ms 30624 KB Output is correct
50 Correct 344 ms 30624 KB Output is correct
51 Correct 355 ms 30912 KB Output is correct
52 Correct 343 ms 31128 KB Output is correct
53 Correct 354 ms 31056 KB Output is correct
54 Correct 341 ms 31064 KB Output is correct