제출 #1161048

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1161048		ElayV13	Election (BOI18_election)	C++20	28 / 100	3095 ms	680 KiB

election

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(a) a.begin() , a.end()
#define ld long double
#define ff first
#define ss second

const int inf = 1e18;
const int mod = 998244353;
const int MXN = 10005;

int N , q;
string s;

void solve()
{
        cin >> N >> s >> q;
        s = '#' + s;
        while(q--)
        {
                int l , r;
                cin >> l >> r;
                int cnt[2];
                cnt[0] = cnt[1] = 0;
                // cnt[0] -> 'C' // cnt[1] -> 'T'
                string ss = s;
                for(int i = l;i <= r;i++)
                {
                        if(ss[i] == 'T') cnt[1]++;
                        if(ss[i] == 'C') cnt[0]++;
                        if(cnt[1] > cnt[0] && ss[i] != 'C'){
                                ss[i] = 'X';
                                cnt[1]--;
                        }
                }
                cnt[0] = cnt[1] = 0;
                for(int i = r;i >= l;i--)
                {
                        if(ss[i] == 'T') cnt[1]++;
                        if(ss[i] == 'C') cnt[0]++;
                        if(cnt[1] > cnt[0] && ss[i] != 'C'){
                                ss[i] = 'X';
                                cnt[1]--;
                        }
                }
                int res = 0;
                for(int i = 1;i <= N;i++)
                {
                        res += (s[i] != ss[i]);
                }
                cout << res << endl;
        }
}
signed main(){
      ios_base::sync_with_stdio(0);cin.tie(0);
      int T = 1;//cin >> T;
      while(T--) solve();
}

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