Submission #405152

#	Time	Username	Problem	Language	Result	Execution time	Memory
405152		tsaraf	Election (BOI18_election)	C++17	0 / 100	3002 ms	1184 KiB

election

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()

const int N = 500 + 3;

int res[N][N];
int n, Q;
string s;

void solve(){
    
    cin >> n >> s >> Q;
    for(int L = 0; L < n; ++L){
        for(int R = L; R < n; ++R){
            bool vis[n]; memset(vis, false, sizeof(vis));
            int sum = 0, &ans = res[L][R]; ans = 0;
            for(int i = L; i <= R; ++i){
                int vote = (s[i] == 'C' ? +1 : -1);
                if(sum + vote < 0){
                    vis[i] = true;
                    ++ans;
                } else {
                    sum += vote;
                }
            }
            sum = 0;
            for(int i = R; i >= L; --i){
                if(!vis[i]){
                    int vote = (s[i] == 'C' ? +1 : -1);
                    if(sum + vote < 0){
                        vis[i] = true;
                        ++ans;
                    } else {
                        sum += vote;
                    }
                }
            }
        }
    }
    while(Q--){
        int L, R; cin >> L >> R; --L; --R;
        cout << res[L][R] << '\n';
    }
    
}


int main(){
    // #ifndef ONLINE_JUDGE
    //     freopen("input.txt", "r", stdin);
    //     freopen("output.txt", "w", stdout);
    // #endif

    ios_base::sync_with_stdio(false); cin.tie(0);

    int t = 1;
    // cin >> t;


    for(int i = 1; i <= t; i++){
        // cout << "Case #" << i << ": ";

        solve();

    }
    return 0;
}

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