oj.uz

답안 #61821

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61821 2018-07-26T18:33:33 Z Benq Election (BOI18_election) C++11
28 / 100
 3000 ms 1260 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

int N,Q;
string S;

string red(string s) {
    int cur = 0;
    string z;
    for (char c: s) {
        if (c == 'C') cur ++, z += c;
        else if (cur > 0) cur --, z += c;
    }
    return z;
}

int solve(string s) {
    string z = red(s);
    reverse(all(z));
    z = red(z);
    return sz(s)-sz(z);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> S >> Q;
    F0R(i,Q) {
        int L,R; cin >> L >> R; L--, R --;
        cout << solve(string(S.begin()+L,S.begin()+R+1)) << "\n";
    }
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 376 KB Output is correct
2 Correct 19 ms 376 KB Output is correct
3 Correct 20 ms 408 KB Output is correct
4 Correct 17 ms 484 KB Output is correct
5 Correct 13 ms 484 KB Output is correct

Subtask #2
0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 376 KB Output is correct
2 Correct 19 ms 376 KB Output is correct
3 Correct 20 ms 408 KB Output is correct
4 Correct 17 ms 484 KB Output is correct
5 Correct 13 ms 484 KB Output is correct
6 Execution timed out 3014 ms 1260 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 376 KB Output is correct
2 Correct 19 ms 376 KB Output is correct
3 Correct 20 ms 408 KB Output is correct
4 Correct 17 ms 484 KB Output is correct
5 Correct 13 ms 484 KB Output is correct
6 Execution timed out 3014 ms 1260 KB Time limit exceeded
7 Halted 0 ms 0 KB -