Submission #1106239

#	Time	Username	Problem	Language	Result	Execution time	Memory
1106239		zNatsumi	Street Lamps (APIO19_street_lamps)	C++17	20 / 100	4135 ms	524288 KiB

street_lamps

#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> ii;
typedef tuple<int, int, int> Que;

const int N = 3e5 + 10,
          INF = 1e9;

int n, q;
ii range[N];
string s;
Que query[N];

struct BIT2D{
  vector<int> node[N], bit[N];

  void fake_upd(int x, int y){
    for(int i = x; i <= n; i += i & -i)
      for(int j = y; j <= n; j += j & -j)
        node[i].push_back(j);
  }
  void fake_update(int x, int y, int u, int v){
    fake_upd(x, y);
    fake_upd(x, v + 1);
    fake_upd(u + 1, y);
    fake_upd(u + 1, v + 1);
  }
  void fake_get(int x, int y){
    for(int i = x; i > 0; i -= i & -i)
      for(int j = y; j > 0; j -= j & -j)
        node[i].push_back(j);
  }

  void build(){
    for(int i = 1; i <= n; i++) if(node[i].size()){
      sort(node[i].begin(), node[i].end());
      node[i].erase(unique(node[i].begin(), node[i].end()), node[i].end());
      bit[i].assign(node[i].size() + 1, 0);
    }
  }

  void upd(int x, int y, int val){
    for(int i = x; i <= n; i += i & -i)
      for(int j = lower_bound(node[i].begin(), node[i].end(), y) - node[i].begin() + 1; j <= node[i].size(); j += j & -j)
        bit[i][j - 1] += val;
  }

  void update(int x, int y, int u, int v, int val){
    upd(x, y, val);
    upd(x, v + 1, -val);
    upd(u + 1, y, -val);
    upd(u + 1, v + 1, val);
  }
  int get(int x, int y){
    int res = 0;
    for(int i = x; i > 0; i -= i & -i)
      for(int j = lower_bound(node[i].begin(), node[i].end(), y) - node[i].begin() + 1; j > 0; j -= j & -j)
        res += bit[i][j - 1];
    return res;
  }
} bit;

struct SegTree{
  int st[N << 2], lz[N << 2];

  void build(int tl, int tr, int i){
    lz[i] = -1;
    if(tl == tr){
      st[i] = (s[tl] == '1' ? 0 : INF);
      return;
    }
    int tm = tl + tr >> 1;
    build(tl, tm, i<<1);
    build(tm + 1, tr, i<<1|1);
    st[i] = max(st[i<<1], st[i<<1|1]);
  }
  void push(int i){
    if(lz[i] == -1) return;
    st[i<<1] = st[i<<1|1] = lz[i<<1] = lz[i<<1|1] = lz[i];
    lz[i] = -1;
  }

  void update(int l, int r, int val, int tl, int tr, int i){
    if(r < tl || tr < l || l > r) return;
    if(l <= tl && tr <= r){
      st[i] = val;
      lz[i] = val;
      return;
    }
    if(tl != tr) push(i);
    int tm = tl + tr >> 1;
    update(l, r, val, tl, tm, i<<1);
    update(l, r, val, tm + 1, tr, i<<1|1);
    st[i] = max(st[i<<1], st[i<<1|1]);
  }

  int get(int l, int r, int tl, int tr, int i){
    if(r < tl || tr < l || l > r) return 0;
    if(l <= tl && tr <= r) return st[i];
    if(tl != tr) push(i);
    int tm = tl + tr >> 1;
    return max(get(l, r, tl, tm, i<<1), get(l, r, tm + 1, tr, i<<1|1));
  }
} it;

struct BIT{
  int bit[N];
  void upd(int i, int x){
    for(; i <= n + 1; i += i & -i) bit[i] += x;
  }
  int get(int i){
    int res = 0;
    for(; i > 0; i -= i & -i) res += bit[i];
    return res;
  }
} b;

int findL(int i){
  int l = 1, r = i - 1, res = 0;
  while(l <= r){
    int mid = l + r >> 1;
    if(b.get(i - 1) - b.get(mid - 1) >= 1) l = (res = mid) + 1;
    else r = mid - 1;
  }
  return res + 1;
}

int findR(int i){
  int l = i + 1, r = n, res = n + 1;
  while(l <= r){
    int mid = l + r >> 1;
    if(b.get(mid) - b.get(i) >= 1) r = (res = mid) - 1;
    else l = mid + 1;
  }
  return res - 1;
}

void init(){
  for(int i = 1; i <= n; i++) if(s[i] == '0') b.upd(i, 1);
  string tmp = s;

  for(int t = 1; t <= q; t++){
    auto [ty, x, y] = query[t];

    if(ty == 0){
      if(s[x] == '0'){
        int l = findL(x),
            r = findR(x);
        range[t] = {l, r};

        s[x] = '1';
        b.upd(x, -1);

        if(l <= x - 1) bit.fake_update(l, l, x - 1, x - 1);
        if(x + 1 <= r) bit.fake_update(x + 1, x + 1, r, r);

      }else{
        int l = findL(x),
            r = findR(x);
        range[t] = {l, r};
        s[x] = '0';
        b.upd(x, 1);

        bit.fake_update(l, l, r, r);
      }
    }else{
      bit.fake_get(x, y);
    }
  }
  bit.build();
  s = tmp;
}

void solve(){
  it.build(1, n, 1);

  for(int t = 1; t <= q; t++){
    auto [ty, x, y] = query[t];

    if(ty == 0){
      if(s[x] == '0'){
        int l, r; tie(l, r) = range[t];
        s[x] = '1';

        if(l <= x - 1) bit.update(l, l, x - 1, x - 1, t - it.get(l, x - 1, 1, n, 1));
        if(x + 1 <= r) bit.update(x + 1, x + 1, r, r, t - it.get(x + 1, r, 1, n, 1));
        it.update(l, r, t, 1, n, 1);

      }else{
        int l, r; tie(l, r) = range[t];
        s[x] = '0';

        bit.update(l, l, r, r, t - it.get(l, r, 1, n, 1));
        it.update(l, r, t, 1, n, 1);
        it.update(x, x, INF, 1, n, 1);
      }
    }else{
      auto tmp = t - it.get(x, y, 1, n, 1);
      cout << bit.get(x, y) + (tmp >= 0 ? tmp : 0) << "\n";
    }
  }
}

int32_t main(){
  cin.tie(0)->sync_with_stdio(0);
//  #define task "test"
//  if(fopen(task ".inp", "r")){
//    freopen(task ".inp", "r", stdin);
//    freopen(task ".out", "w", stdout);
//  }
  cin >> n >> q >> s;
  s = " " + s;

  for(int i = 1; i <= q; i++){
    string ty; cin >> ty;
    if(ty == "toggle"){
      int x; cin >> x;
      query[i] = Que(0, x, -1);
    }else{
      int x, y; cin >> x >> y;
      query[i] = Que(1, x, y - 1);
    }
  }
  init();
  solve();
//  cerr << "TIME 1: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";

  return 0;
}

Compilation message (stderr)

street_lamps.cpp: In member function 'void BIT2D::upd(int, int, int)':
street_lamps.cpp:46:91: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |       for(int j = lower_bound(node[i].begin(), node[i].end(), y) - node[i].begin() + 1; j <= node[i].size(); j += j & -j)
      |                                                                                         ~~^~~~~~~~~~~~~~~~~
street_lamps.cpp: In member function 'void SegTree::build(int, int, int)':
street_lamps.cpp:74:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   74 |     int tm = tl + tr >> 1;
      |              ~~~^~~~
street_lamps.cpp: In member function 'void SegTree::update(int, int, int, int, int, int)':
street_lamps.cpp:93:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   93 |     int tm = tl + tr >> 1;
      |              ~~~^~~~
street_lamps.cpp: In member function 'int SegTree::get(int, int, int, int, int)':
street_lamps.cpp:103:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  103 |     int tm = tl + tr >> 1;
      |              ~~~^~~~
street_lamps.cpp: In function 'int findL(int)':
street_lamps.cpp:123:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  123 |     int mid = l + r >> 1;
      |               ~~^~~
street_lamps.cpp: In function 'int findR(int)':
street_lamps.cpp:133:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  133 |     int mid = l + r >> 1;
      |               ~~^~~

• Subtask 1: 20 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20