oj.uz

Submission #863099

# Submission time Handle Problem Language Result Execution time Memory
863099 2023-10-19T15:22:01 Z ador Election (BOI18_election) C++17
0 / 100
 12 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, Q;
    string V;
    vector<vector<int>> vp;
    cin >> N >> V >> Q;
    
    for(int i=0;i<Q;i++) {
        int L, R;
        cin >> L >> R;
        vp.push_back({L, R});
    }
    
    for(int i=0; i<(int)vp.size(); i++) {
        string subV = V.substr(vp[i][0]-1, vp[i][1]-vp[i][0]+1);
        int cv = 0, cvd = 0, tv = 0, tvd = 0, nulled = 0, nulledd = 0;
        for(int j=0;j<(int)subV.size();j++) {
            if(subV[j] == 'T' && cv == tv) nulled++;
            else if (subV[j] == 'C') cv++;
            else tv++;
            
            if(subV[subV.size()-j-1] == 'T' && cvd == tvd) nulledd++;
            else if (subV[subV.size()-j-1] == 'C') cvd++;
            else tvd++;
        }
        cout << max(nulled, nulledd) << "\n";
    }
}

Subtask #1
0 / 28.0

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

Subtask #2
0 / 54.0

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

Subtask #3
0 / 18.0

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