oj.uz

Submission #309749

# Submission time Handle Problem Language Result Execution time Memory
309749 2020-10-04T13:01:49 Z MarcoMeijer Election (BOI18_election) C++14
100 / 100
 402 ms 44472 KB 
#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.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 33144 KB Output is correct
2 Correct 27 ms 33280 KB Output is correct
3 Correct 28 ms 33152 KB Output is correct
4 Correct 27 ms 33272 KB Output is correct
5 Correct 27 ms 33272 KB Output is correct

Subtask #2
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 33144 KB Output is correct
2 Correct 27 ms 33280 KB Output is correct
3 Correct 28 ms 33152 KB Output is correct
4 Correct 27 ms 33272 KB Output is correct
5 Correct 27 ms 33272 KB Output is correct
6 Correct 62 ms 34552 KB Output is correct
7 Correct 59 ms 34552 KB Output is correct
8 Correct 64 ms 34680 KB Output is correct
9 Correct 54 ms 34552 KB Output is correct
10 Correct 60 ms 34424 KB Output is correct
11 Correct 64 ms 34680 KB Output is correct
12 Correct 65 ms 34684 KB Output is correct
13 Correct 62 ms 34632 KB Output is correct
14 Correct 61 ms 34616 KB Output is correct
15 Correct 61 ms 34552 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 33144 KB Output is correct
2 Correct 27 ms 33280 KB Output is correct
3 Correct 28 ms 33152 KB Output is correct
4 Correct 27 ms 33272 KB Output is correct
5 Correct 27 ms 33272 KB Output is correct
6 Correct 62 ms 34552 KB Output is correct
7 Correct 59 ms 34552 KB Output is correct
8 Correct 64 ms 34680 KB Output is correct
9 Correct 54 ms 34552 KB Output is correct
10 Correct 60 ms 34424 KB Output is correct
11 Correct 64 ms 34680 KB Output is correct
12 Correct 65 ms 34684 KB Output is correct
13 Correct 62 ms 34632 KB Output is correct
14 Correct 61 ms 34616 KB Output is correct
15 Correct 61 ms 34552 KB Output is correct
16 Correct 362 ms 43660 KB Output is correct
17 Correct 321 ms 43148 KB Output is correct
18 Correct 370 ms 43276 KB Output is correct
19 Correct 288 ms 42764 KB Output is correct
20 Correct 369 ms 42504 KB Output is correct
21 Correct 374 ms 44300 KB Output is correct
22 Correct 363 ms 44168 KB Output is correct
23 Correct 375 ms 44472 KB Output is correct
24 Correct 402 ms 44176 KB Output is correct
25 Correct 389 ms 43660 KB Output is correct