Submission #1159489

#	Time	Username	Problem	Language	Result	Execution time	Memory
1159489		akamizane	Election (BOI18_election)	C++20	Compilation error	0 ms	0 KiB

election

#include<bits/stdc++.h>

using namespace std;
 
#ifdef ONLINE_JUDGE
#define debug(...) ((void)0)
#define debugArr(...) ((void)0)
#else
#include <debug.hpp>
#endif

using ll = long long;
using pii = pair<long long, long long>;
using db = long double;

// #define int long long
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
template <class T1, class T2>bool chmax(T1 &a, T2 b){return a < b ? a = b, 1 : 0;}
template <class T1, class T2>bool chmin(T1 &a, T2 b){return a > b ? a = b, 1 : 0;}

const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
const ll inf = 1e18;

namespace internal {
 
// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}
 
// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}
 
}  // namespace internal
template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }
 
    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }
 
    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }
 
    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;
 
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }
 
    S all_prod() { return d[1]; }
 
    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }
 
    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }
 
  private:
    int _n, size, log;
    std::vector<S> d;
 
    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

struct S{
   array<int, 4> d;
   S(){}
   S(int a, int b, int c, int e){
      d[0] = a, d[1] = b, d[2] = c, d[3] = e;
   }
};

S op(S a, S b){
   S ans;
   ans.d[0] = max(a.d[0], a.d[2] + b.d[0]);
   ans.d[1] = max(b.d[1], b.d[2] + a.d[1]);
   ans.d[2] = a.d[2] + b.d[2];
   ans.d[3] = max({a.d[3] + b.d[2], b.d[3] + a.d[2], a.d[0] + b.d[1]});
   return ans;
}

S e(){
   return S(0, 0, 0, 0);
}

void solve(){
   int n;
   cin >> n;
   string s;
   cin >> s;
   segtree<S, op, e> seg(n);
   for (int i = 0; i < n; i++){
      if (s[i] == 'T') seg.set(i, S(1, 1, 1, 1));
      else seg.set(i, S(0, 0, -1, 0));
   }
   int q;
   cin >> q;
   while(q--){
      int l, r;
      cin >> l >> r;
      l--;
      cout << seg.prod(l, r).d[3] << "\n";
   }
}

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tests = 1;
  // cin >> tests;
  for (int _ = 1; _ <= tests; _++){
    cerr << "- Case #" << _ << ": \n";
    solve();
    // cout << "\n";
  }
  return 0;
}

Compilation message (stderr)

election.cpp:9:10: fatal error: debug.hpp: No such file or directory
    9 | #include <debug.hpp>
      |          ^~~~~~~~~~~
compilation terminated.