oj.uz

Submission #865249

# Submission time Handle Problem Language Result Execution time Memory
865249 2023-10-24T06:49:42 Z farica Election (BOI18_election) C++14
0 / 100
 10 ms 348 KB 
#include <bits/stdc++.h>
#define long long ll

using namespace std;

const int MAX_N=1e6;


void solve() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    int q;
    cin >> q;
    while(q--) {
        int l,r;
        cin >> l >> r;
        --l;
        int cnt=0, ans=0;
        string tmp=s;
        for(int i=l; i<r; ++i) {
            if(s[i]=='C') ++cnt;
            else if(s[i]=='T') --cnt;
            if(cnt<0) {
                cnt+=2;
                ++ans;
                tmp[i]='X';
            }
        }
        cnt=0;
        for(int i=r-1; i>=l; --i) {
            if(tmp[i]=='C') ++cnt;
            else if(tmp[i]=='T') --cnt;
            if(cnt<0) {
                ++cnt;
                ++ans;
            }
        }
        cout << ans << endl;
    }
}

int main()
{
    int T=1;
    while(T--) solve();

    return 0;
}

Subtask #1
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 54.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -