oj.uz

Submission #1106126

# Submission time Handle Problem Language Result Execution time Memory
1106126 2024-10-29T10:21:40 Z zNatsumi Street Lamps (APIO19_street_lamps) C++17
0 / 100
 5000 ms 592 KB 
#include <bits/stdc++.h>

using namespace std;

typedef tuple<string, int, int> Que;

const int N = 100 + 5,
          INF = 1e9;

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

struct BIT2D{
  int bit[N][N];

  void upd(int x, int y, int val){
    for(int i = x; i <= n; i += i & -i)
      for(int j = y; j <= n; j += j & -j)
        bit[i][j] += 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(x + 1, y + 1, val);
  }
  int get(int x, int y){
    int res = 0;
    for(int i = x; i; i -= i & -i)
      for(int j = y; j; j -= j & -j)
        res += bit[i][j];
    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;
    }
    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];
    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;

void solve(){
  set<int> pos0;
  for(int i = 1; i <= n; i++) if(s[i] == '0') pos0.insert(i);
  pos0.insert(0); pos0.insert(n + 1);

  it.build(1, n, 1);

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

    if(ty == "toggle"){
      if(s[x] == '0'){
        auto i = pos0.find(x);
        int l = *prev(i) + 1, r = *next(i) - 1;

        s[x] = '1';
        pos0.erase(x);

        bit.update(l, *i - 1, l, *i - 1, t - it.get(l, *i - 1, 1, n, 1));
        bit.update(*i + 1, r, *i + 1, r, t - it.get(*i + 1, r, 1, n, 1));
        it.update(l, r, t, 1, n, 1);
      }else{
        s[x] = '0';
        pos0.insert(x);

        auto i = pos0.find(x);
        int l = *prev(i) + 1, r = *next(i) - 1;

        bit.update(l, r, l, r, t - it.get(l, r, 1, n, 1));
        it.update(l, r, t, 1, n, 1);
        it.update(*i, *i, 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(ty, x, -1);
    }else{
      int x, y; cin >> x >> y;
      query[i] = Que(ty, x, y - 1);
    }
  }

  solve();

  return 0;
}

Compilation message

street_lamps.cpp: In member function 'void SegTree::build(int, int, int)':
street_lamps.cpp:47:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   47 |     int tm = tl + tr >> 1;
      |              ~~~^~~~
street_lamps.cpp: In member function 'void SegTree::update(int, int, int, int, int, int)':
street_lamps.cpp:66:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   66 |     int tm = tl + tr >> 1;
      |              ~~~^~~~
street_lamps.cpp: In member function 'int SegTree::get(int, int, int, int, int)':
street_lamps.cpp:76:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   76 |     int tm = tl + tr >> 1;
      |              ~~~^~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5066 ms 336 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 592 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 592 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 592 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5066 ms 336 KB Time limit exceeded
2 Halted 0 ms 0 KB -