제출 #309749

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
309749		MarcoMeijer	Election (BOI18_election)	C++14	100 / 100	402 ms	44472 KiB

election

#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int N = (1<<20);

int n, q;
string s;

struct T {
    int sm, mxpre, mxsuf, ans;
    T(char c='-') {
        sm = mxpre = mxsuf = ans = 0;
        if(c == 'C')
            sm = -1;
        if(c == 'T')
            sm = mxpre = mxsuf = ans = 1;
        if(c == '-')
            mxpre = -1;
    }
    T(T L, T R) {
        if(L.mxpre == -1) {
            *this = R;
            return;
        }
        if(R.mxpre == -1) {
            *this = L;
            return;
        }
        mxpre = max(L.mxpre, L.sm + R.mxpre);
        mxsuf = max(R.mxsuf, R.sm + L.mxsuf);
        sm = L.sm + R.sm;
        ans = max({L.sm + R.ans, R.sm + L.ans, L.mxpre + R.mxsuf});
    }
};

T seg[N*2];

int ask(int l, int r) {
    T lres, rres;
    for(l+=N, r+=N; l<r; l/=2, r/=2) {
        if(l&1) lres = T(lres, seg[l++]);
        if(r&1) rres = T(seg[--r], rres);
    }
    T res = T(lres, rres);
    return res.ans;
}

void program() {
    IN(n,s,q);
    RE(i,n) seg[i+N] = T(s[i]);
    REV(i,1,N) seg[i] = T(seg[i*2], seg[i*2+1]);
    RE(i,q) {
        int l, r; IN(l, r); l--;
        OUTL(ask(l,r));
    }
}

• Subtask 1: 28 / 28
• Subtask 2: 54 / 54
• Subtask 3: 18 / 18