oj.uz

답안 #413148

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
413148 2021-05-28T09:39:39 Z Theo830 Election (BOI18_election) C++17
28 / 100
 3000 ms 1092 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF = 1e9+7;
ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,q;
    cin>>n;
    string s;
    cin>>s;
    cin>>q;
    while(q--){
        ll l,r;
        cin>>l>>r;
        l--;
        r--;
        ll ans = 0;
        ll cur = 0;
        bool allaxa[n] = {0};
        f(j,l,r+1){
            if(s[j] == 'T'){
                cur++;
            }
            else{
                cur--;
            }
            if(cur == 1){
                ans++;
                allaxa[j] = 1;
                cur--;
            }
        }
        cur = 0;
        for(ll j = r;j >= l;j--){
            if(allaxa[j]){
                continue;
            }
            if(s[j] == 'T'){
                cur++;
            }
            else{
                cur--;
            }
            if(cur == 1){
                ans++;
                cur--;
            }
        }
        cout<<ans<<"\n";
    }
}
/*
11
CCCTTTTTTCC
3
1 11
4 9
1 6
*/

Subtask #1
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 332 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 6 ms 332 KB Output is correct
5 Correct 5 ms 332 KB Output is correct

Subtask #2
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 332 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 6 ms 332 KB Output is correct
5 Correct 5 ms 332 KB Output is correct
6 Execution timed out 3077 ms 1092 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 332 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 6 ms 332 KB Output is correct
4 Correct 6 ms 332 KB Output is correct
5 Correct 5 ms 332 KB Output is correct
6 Execution timed out 3077 ms 1092 KB Time limit exceeded
7 Halted 0 ms 0 KB -