oj.uz

Submission #790145

# Submission time Handle Problem Language Result Execution time Memory
790145 2023-07-22T11:06:42 Z GrindMachine Street Lamps (APIO19_street_lamps) C++17
100 / 100
 3413 ms 216584 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 3e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

struct compressed_fenwick{
    unordered_map<int,int> tr;

    int lsb(int x) {
        return x & -x;
    }

    void pupd(int i, int v){
        for(; i < N; i += lsb(i)){
            tr[i] += v; 
        }
    }

    int sum(int i){
        int res = 0;
        for(; i; i -= lsb(i)){
            if(tr.count(i)){
                res += tr[i];
            }
        }
        return res;
    }

    int query(int l, int r){
        if(l > r) return 0;
        return sum(r) - sum(l-1);
    }
};

template<typename T>
struct fenwick {
    int siz;
    vector<compressed_fenwick> tree;

    fenwick(int n) {
        siz = n;
        tree = vector<compressed_fenwick>(n + 1);
    }

    int lsb(int x) {
        return x & -x;
    }

    void pupd(int i, int pos, T v) {
        while (i <= siz) {
            tree[i].pupd(pos,v);
            i += lsb(i);
        }
    }

    T sum(int i, int pos) {
        T res = 0;

        while (i) {
            res += tree[i].query(pos,N-1);
            i -= lsb(i);
        }

        return res;
    }

    T query(int l, int r, int pos) {
        if (l > r) return 0;
        T res = sum(r,pos) - sum(l-1,pos);
        return res;
    }
};

void solve(int test_case)
{
    int n,q; cin >> n >> q;
    vector<int> a(n+5);
    rep1(i,n){
        char ch; cin >> ch;
        a[i] = ch-'0';
    }

    set<array<int,3>> active;
    vector<array<int,3>> segs;

    {
        int l = -1;
        rep1(i,n){
            if(!a[i]){
                if(l != -1){
                    active.insert({l,i-1,0});
                }

                l = -1;
            }
            else{
                if(l == -1){
                    l = i;
                }
            }
        }

        if(l != -1){
            active.insert({l,n,0});
        }
    }

    auto get_seg = [&](int i){
        auto it = active.upper_bound({i+1,-1,-1});
        if(it == active.begin()) return active.end();
        else{
            it--;
            auto [l,r,t] = *it;
            if(l <= i and r >= i){
                return it;
            }
            else{
                return active.end();
            }
        }
    };

    fenwick<int> fenw(n+5);

    auto insert_seg = [&](set<array<int,3>>::iterator it, int id){
        auto [l,r,t] = *it;
        segs.pb({l,r,id-t});
        fenw.pupd(l,r,id-t);
    };

    rep1(id,q){
        string t; cin >> t;
        if(t == "toggle"){
            int i; cin >> i;
            a[i] ^= 1;

            if(!a[i]){
                // unset
                auto it = get_seg(i);
                assert(it != active.end());
                auto [l,r,t] = *it;
                insert_seg(it,id);
                active.erase(it);

                if(l <= i-1){
                    active.insert({l,i-1,id});
                }
                if(i+1 <= r){
                    active.insert({i+1,r,id});
                }
            }
            else{
                // set
                auto it1 = get_seg(i-1);
                auto it2 = get_seg(i+1);
                
                int l = -1, r = -1;

                if(it1 != active.end()){
                    auto curr = *it1;
                    l = curr[0];                    
                    insert_seg(it1,id);
                    active.erase(it1);
                }

                if(it2 != active.end()){
                    auto curr = *it2;
                    r = curr[1];
                    insert_seg(it2,id);
                    active.erase(it2);
                }

                if(l != -1 and r != -1){
                    active.insert({l,r,id});
                }
                else if(l != -1){
                    active.insert({l,i,id});
                }
                else if(r != -1){
                    active.insert({i,r,id});
                }
                else{
                    active.insert({i,i,id});
                }
            }
        }
        else{
            int l,r; cin >> l >> r;
            r--;
            
            auto it = get_seg(l);
            int ans = 0;

            {
                auto [lx,rx,t] = *it;
                if(lx <= l and rx >= r){
                    ans += id-t;
                }
            }

            ans += fenw.query(1,l,r);

            /*

            for(auto [lx,rx,wx] : segs){
                if(lx <= l and rx >= r){
                    ans += wx;
                }
            }
    
            */

            cout << ans << endl;
        }
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 309 ms 4396 KB Output is correct
2 Correct 337 ms 8032 KB Output is correct
3 Correct 562 ms 13472 KB Output is correct
4 Correct 2633 ms 156024 KB Output is correct
5 Correct 3413 ms 172132 KB Output is correct
6 Correct 2806 ms 167604 KB Output is correct
7 Correct 463 ms 24404 KB Output is correct
8 Correct 469 ms 25868 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 980 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2654 ms 216584 KB Output is correct
6 Correct 3275 ms 208980 KB Output is correct
7 Correct 3167 ms 171632 KB Output is correct
8 Correct 484 ms 25784 KB Output is correct
9 Correct 139 ms 3944 KB Output is correct
10 Correct 146 ms 4264 KB Output is correct
11 Correct 158 ms 4476 KB Output is correct
12 Correct 475 ms 24416 KB Output is correct
13 Correct 446 ms 25960 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 1127 ms 30528 KB Output is correct
6 Correct 2594 ms 120304 KB Output is correct
7 Correct 2718 ms 162616 KB Output is correct
8 Correct 2856 ms 199744 KB Output is correct
9 Correct 369 ms 3984 KB Output is correct
10 Correct 273 ms 6704 KB Output is correct
11 Correct 340 ms 3872 KB Output is correct
12 Correct 292 ms 6652 KB Output is correct
13 Correct 380 ms 3856 KB Output is correct
14 Correct 280 ms 6628 KB Output is correct
15 Correct 522 ms 18460 KB Output is correct
16 Correct 469 ms 19844 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 309 ms 4396 KB Output is correct
9 Correct 337 ms 8032 KB Output is correct
10 Correct 562 ms 13472 KB Output is correct
11 Correct 2633 ms 156024 KB Output is correct
12 Correct 3413 ms 172132 KB Output is correct
13 Correct 2806 ms 167604 KB Output is correct
14 Correct 463 ms 24404 KB Output is correct
15 Correct 469 ms 25868 KB Output is correct
16 Correct 3 ms 980 KB Output is correct
17 Correct 3 ms 980 KB Output is correct
18 Correct 3 ms 852 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2654 ms 216584 KB Output is correct
21 Correct 3275 ms 208980 KB Output is correct
22 Correct 3167 ms 171632 KB Output is correct
23 Correct 484 ms 25784 KB Output is correct
24 Correct 139 ms 3944 KB Output is correct
25 Correct 146 ms 4264 KB Output is correct
26 Correct 158 ms 4476 KB Output is correct
27 Correct 475 ms 24416 KB Output is correct
28 Correct 446 ms 25960 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 724 KB Output is correct
31 Correct 3 ms 852 KB Output is correct
32 Correct 3 ms 980 KB Output is correct
33 Correct 1127 ms 30528 KB Output is correct
34 Correct 2594 ms 120304 KB Output is correct
35 Correct 2718 ms 162616 KB Output is correct
36 Correct 2856 ms 199744 KB Output is correct
37 Correct 369 ms 3984 KB Output is correct
38 Correct 273 ms 6704 KB Output is correct
39 Correct 340 ms 3872 KB Output is correct
40 Correct 292 ms 6652 KB Output is correct
41 Correct 380 ms 3856 KB Output is correct
42 Correct 280 ms 6628 KB Output is correct
43 Correct 522 ms 18460 KB Output is correct
44 Correct 469 ms 19844 KB Output is correct
45 Correct 99 ms 3908 KB Output is correct
46 Correct 178 ms 4140 KB Output is correct
47 Correct 1314 ms 70192 KB Output is correct
48 Correct 2646 ms 155488 KB Output is correct
49 Correct 175 ms 4384 KB Output is correct
50 Correct 170 ms 4420 KB Output is correct
51 Correct 182 ms 4556 KB Output is correct
52 Correct 190 ms 5020 KB Output is correct
53 Correct 193 ms 4832 KB Output is correct
54 Correct 181 ms 4872 KB Output is correct