Submission #73724631


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

// --- Type Definitions ---
using ll = long long;
using db = long double; // Crucial for those "Lantern" precision problems
using str = string;

// --- Vectors & Pairs ---
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;

// --- Shortcuts ---
#define mp make_pair
#define f first
#define pb push_back
#define eb emplace_back // Slightly faster than pb
#define all(x) begin(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define sz(x) int((x).size())

// --- Loops ---
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define each(a,x) for (auto& a: x)

// --- Input/Output Optimization ---
void setIO(string name = "") {
    cin.tie(0)->sync_with_stdio(0); // Fast I/O
    if (sz(name)) {
        freopen((name + ".in").c_str(), "r", stdin); 
        freopen((name + ".out").c_str(), "w", stdout);
    }
    // Auto-fix precision for doubles (stops 2.5 becoming 2.5e+00)
    cout << fixed << setprecision(15);
}

// --- Constant ---
const ll MOD = 1e9+7; // For those "modulo 10^9+7" problems
const ll INF = 1e18;  // Huge number for infinity

int main() {
    setIO(); 
    str s; cin >> s;
 
    int a = 0, ab = 0, res = 0;

    each(c, s) {
        if (c== 'A') {
            a++;
        } else if (c== 'B') {
            if (a > 0) {
              a--;
                ab++;
            }
        } else if (c =='C') {
          if (ab>0) {
              ab--;
              res++;
          }
        }
    }

  cout<<res;
}

Submission Info

Submission Time
Task D - Take ABC 2
User wrapper
Language C++23 (GCC 15.2.0)
Score 400
Code Size 1717 Byte
Status AC
Exec Time 9 ms
Memory 4600 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 35
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 02_corner_00.txt, 02_corner_01.txt, 02_corner_02.txt, 02_corner_03.txt, 02_corner_04.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3636 KiB
00_sample_01.txt AC 1 ms 3632 KiB
00_sample_02.txt AC 1 ms 3472 KiB
01_test_00.txt AC 1 ms 3476 KiB
01_test_01.txt AC 1 ms 3632 KiB
01_test_02.txt AC 1 ms 3632 KiB
01_test_03.txt AC 8 ms 4540 KiB
01_test_04.txt AC 6 ms 4548 KiB
01_test_05.txt AC 8 ms 4600 KiB
01_test_06.txt AC 8 ms 4440 KiB
01_test_07.txt AC 8 ms 4544 KiB
01_test_08.txt AC 9 ms 4424 KiB
01_test_09.txt AC 9 ms 4420 KiB
01_test_10.txt AC 9 ms 4600 KiB
01_test_11.txt AC 8 ms 4564 KiB
01_test_12.txt AC 8 ms 4448 KiB
01_test_13.txt AC 9 ms 4560 KiB
01_test_14.txt AC 7 ms 4548 KiB
01_test_15.txt AC 7 ms 4448 KiB
01_test_16.txt AC 7 ms 4420 KiB
01_test_17.txt AC 8 ms 4484 KiB
01_test_18.txt AC 8 ms 4564 KiB
01_test_19.txt AC 8 ms 4416 KiB
01_test_20.txt AC 8 ms 4476 KiB
01_test_21.txt AC 8 ms 4508 KiB
01_test_22.txt AC 8 ms 4444 KiB
01_test_23.txt AC 8 ms 4488 KiB
01_test_24.txt AC 8 ms 4508 KiB
01_test_25.txt AC 8 ms 4488 KiB
01_test_26.txt AC 8 ms 4496 KiB
02_corner_00.txt AC 4 ms 4560 KiB
02_corner_01.txt AC 4 ms 4548 KiB
02_corner_02.txt AC 3 ms 4540 KiB
02_corner_03.txt AC 4 ms 4524 KiB
02_corner_04.txt AC 4 ms 4600 KiB