oj.uz

Submission #735771

# Submission time Handle Problem Language Result Execution time Memory
735771 2023-05-04T15:43:13 Z GrindMachine Election (BOI18_election) C++17
28 / 100
 3000 ms 2828 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
edi

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n; cin >> n;
    vector<ll> a(n + 5);
    rep1(i, n) {
        char ch; cin >> ch;
        if (ch == 'C') a[i] = 1;
        else a[i] = -1;
    }

    ll q; cin >> q;

    while (q--) {
        ll l, r; cin >> l >> r;
        auto b = a;

        ll sum = 0;
        ll ans = 0;

        for (int i = l; i <= r; ++i) {
            sum += b[i];
            if (sum < 0) {
                ans++;
                sum = 0;
                b[i] = 0;
            }
        }

        sum = 0;

        rev(i, r, l) {
            sum += b[i];
            if (sum < 0) {
                ans++;
                sum = 0;
                b[i] = 0;
            }
        }

        cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 436 KB Output is correct
2 Correct 5 ms 328 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 4 ms 340 KB Output is correct

Subtask #2
0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 436 KB Output is correct
2 Correct 5 ms 328 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Execution timed out 3025 ms 2828 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 436 KB Output is correct
2 Correct 5 ms 328 KB Output is correct
3 Correct 4 ms 340 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Execution timed out 3025 ms 2828 KB Time limit exceeded
7 Halted 0 ms 0 KB -