#861702 (C++23) No.2276 I Want AC

提出ソース

結果

問題	No.2276 I Want AC
ユーザー	👑 eoeo
提出日時	2023-04-21 22:49:47
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	11 ms / 2,000 ms
コード長	6,886 bytes
コンパイル時間	3,414 ms
コンパイル使用メモリ	252,864 KB
実行使用メモリ	11,360 KB
最終ジャッジ日時	2024-11-06 16:18:08
合計ジャッジ時間	5,167 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	2 ms 6,816 KB
testcase_03	AC	2 ms 6,816 KB
testcase_04	AC	2 ms 6,816 KB
testcase_05	AC	2 ms 6,816 KB
testcase_06	AC	2 ms 6,816 KB
testcase_07	AC	2 ms 6,816 KB
testcase_08	AC	2 ms 6,816 KB
testcase_09	AC	2 ms 6,820 KB
testcase_10	AC	2 ms 6,820 KB
testcase_11	AC	4 ms 6,820 KB
testcase_12	AC	8 ms 7,784 KB
testcase_13	AC	4 ms 6,816 KB
testcase_14	AC	3 ms 6,820 KB
testcase_15	AC	6 ms 6,816 KB
testcase_16	AC	5 ms 6,816 KB
testcase_17	AC	8 ms 8,108 KB
testcase_18	AC	6 ms 6,816 KB
testcase_19	AC	2 ms 6,820 KB
testcase_20	AC	10 ms 9,476 KB
testcase_21	AC	5 ms 6,816 KB
testcase_22	AC	3 ms 6,816 KB
testcase_23	AC	9 ms 8,208 KB
testcase_24	AC	9 ms 8,288 KB
testcase_25	AC	10 ms 8,288 KB
testcase_26	AC	10 ms 9,184 KB
testcase_27	AC	9 ms 8,932 KB
testcase_28	AC	8 ms 7,776 KB
testcase_29	AC	7 ms 7,424 KB
testcase_30	AC	9 ms 8,672 KB
testcase_31	AC	6 ms 6,820 KB
testcase_32	AC	10 ms 8,804 KB
testcase_33	AC	9 ms 8,668 KB
testcase_34	AC	10 ms 9,824 KB
testcase_35	AC	5 ms 6,816 KB
testcase_36	AC	5 ms 6,816 KB
testcase_37	AC	11 ms 11,356 KB
testcase_38	AC	5 ms 6,816 KB
testcase_39	AC	5 ms 6,816 KB
testcase_40	AC	5 ms 6,816 KB
testcase_41	AC	5 ms 6,816 KB
testcase_42	AC	11 ms 11,360 KB
testcase_43	AC	11 ms 11,360 KB
testcase_44	AC	7 ms 6,820 KB
testcase_45	AC	9 ms 8,996 KB
testcase_46	AC	9 ms 9,056 KB
testcase_47	AC	6 ms 6,820 KB
testcase_48	AC	6 ms 6,820 KB
testcase_49	AC	9 ms 9,056 KB
testcase_50	AC	9 ms 9,056 KB
testcase_51	AC	9 ms 9,056 KB
testcase_52	AC	9 ms 9,056 KB
testcase_53	AC	9 ms 9,052 KB
testcase_54	AC	7 ms 7,520 KB
testcase_55	AC	7 ms 7,168 KB
testcase_56	AC	5 ms 6,820 KB
testcase_57	AC	5 ms 6,816 KB
testcase_58	AC	6 ms 6,912 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef MY_DEBUG
#define dbg(...) debug_out(__VA_ARGS__)
#define dbgn(var) debug_out(#var, "=", var)
#else
#define dbg(...)
#define dbgn(...)
#endif
void debug_out();
template <class Head, class... Tail> void debug_out(Head, Tail...);
template <class T> bool chmax(T&, const T&);
template <class T> bool chmin(T&, const T&);
template <class T> T pwr(T, ll);
template <class T> T squ(T x) { return x * x; }
ll fact(ll);
ll comb(ll, ll);
ll ctoll(char);
char lltoc(ll);
bool flg(ll b, ll i) { return ((b) >> (i)) & 1LL; }  // flg(0b010, 1LL) -> true
const ll LINF = (ll)1e18 + 7;
const double EPS = 1e-9;
const int MAX_DUBUG_SIZE = 10;

void solve([[maybe_unused]] int test) {
    ll n;
    cin >> n;
    string s;
    cin >> s;
    vector<ll> id_htn;
    vector<ll> p_sum_A(n), p_sum_C(n);
    ll tmp_ans = 0;
    for (ll i = 0; i < (ll)s.size(); i++) {
        p_sum_A[i] = (s[i] == 'A');
        p_sum_C[i] = (s[i] == 'C');
        if (s[i] == '?') {
            id_htn.push_back(i);
        }
        if (i - 1 >= 0) {
            p_sum_A[i] += p_sum_A[i - 1];
            p_sum_C[i] += p_sum_C[i - 1];
        }

        if (s[i] == 'C') {
            tmp_ans += p_sum_A[i];
        }
    }

    dbgn(tmp_ans);
    dbgn(p_sum_A);
    dbgn(p_sum_C);

    vector<ll> choice_A(id_htn.size()), choice_C(id_htn.size());
    for (ll i = 0; i < (ll)id_htn.size(); i++) {
        choice_A[i] = p_sum_C[n - 1] - p_sum_C[id_htn[i]];
        choice_C[i] = p_sum_A[id_htn[i]];
        if (i >= 1) {
            choice_A[i] += choice_A[i - 1];
            choice_C[i] += choice_C[i - 1];
        }
    }

    dbgn(choice_A);
    dbgn(choice_C);

    ll ans = tmp_ans;
    if (id_htn.size() > 0) ans += choice_C[id_htn.size() - 1];
    for (ll i = 0; i < (ll)id_htn.size(); i++) {
        ll tmp_A = tmp_ans;
        tmp_A += choice_A[i];
        tmp_A += choice_C[id_htn.size() - 1] - choice_C[i];
        tmp_A += (i + 1) * (id_htn.size() - i - 1);

        chmax(ans, tmp_A);
    }

    cout << ans << '\n';
}

int main() {
    cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12);

    int testcase_size = 1;
    // cin >> testcase_size;

    for (int _t = 0; _t < testcase_size; _t++) {
        solve(_t);
    }
}

/*



























-----------------------------------MY_FUNCTIONS------------------------------------ */
template <class First, class Second> ostream& operator<<(ostream& os, const pair<First, Second>& pp) {
    return os << "{" << pp.first << "," << pp.second << "}";
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& V) {
    if (V.empty()) return os << "[]";
    os << "[";
    for (ll i = 0; i < (ll)V.size(); i++) {
        os << V[i] << (i == int(V.size() - 1) ? "]" : ",");
    }
    return os;
}

template <class T> ostream& operator<<(ostream& os, const vector<vector<T>>& VV) {
    if (VV.empty()) return os << "[[]]";
    os << "[\n";
    for (auto&& V : VV) {
        os << V << "\n";
    }
    os << "]";
    return os;
}

template <class T> ostream& operator<<(ostream& os, const vector<vector<vector<T>>>& VVV) {
    if (VVV.empty()) return os << "[[[]]]";
    os << "["
       << "\n";
    int cnt = 0;
    for (auto&& VV : VVV) {
        os << cnt++ << VV << "\n\n";
    }
    os << "]";
    return os;
}

template <class T> ostream& operator<<(ostream& os, const set<T>& SS) {
    if (SS.empty()) return os << "[]";
    os << "[";
    auto ii = SS.begin();
    for (; ii != SS.end(); ii++) os << *ii << (ii == prev(SS.end()) ? "]" : ",");
    return os;
}

template <class Key, class Tp> ostream& operator<<(ostream& os, const map<Key, Tp>& MM) {
    if (MM.empty()) return os << "[{:}]";
    os << "[";
    auto ii = MM.begin();
    for (; ii != MM.end(); ii++)
        os << "{" << ii->first << ":" << ii->second << "}" << (ii == prev(MM.end()) ? "]" : ",");
    return os;
}

void debug_out() { cerr << endl; }

void debug_out_vl(vector<ll> V) {
    const int MAX_SIZE = min((int)V.size(), MAX_DUBUG_SIZE);

    cerr << "\033[33m";
    if (V.empty()) {
        cerr << "[]" << endl;
        return;
    }
    cerr << "[";
    for (int i = 0; i < MAX_SIZE; i++) {
        if (V[i] == LINF)
            cerr << "INF";
        else
            cerr << V[i];

        if (i == (int)V.size() - 1)
            cerr << "]\n";
        else if (i == MAX_DUBUG_SIZE - 1)
            cerr << ",...\n";
        else
            cerr << ",";
    }
    return;
}

void debug_out_vvl(vector<vector<ll>> VV) {
    cerr << "\033[33m";
    if (VV.empty()) {
        cerr << "[[]]" << endl;
        return;
    }
    cerr << "[\n";

    int MAX_ROW = min((int)VV.size(), MAX_DUBUG_SIZE);
    for (int i = 0; i < MAX_ROW; i++) {
        const int MAX_COLUMN = min((int)VV[i].size(), MAX_DUBUG_SIZE);
        if (VV[i].empty()) {
            cerr << "[]" << endl;
            continue;
        }
        cerr << "[";
        for (int j = 0; j < MAX_COLUMN; j++) {
            if (VV[i][j] == LINF)
                cerr << "INF";
            else
                cerr << VV[i][j];

            if (j == (int)VV[i].size() - 1)
                cerr << "]\n";
            else if (j == MAX_DUBUG_SIZE - 1)
                cerr << ",...\n";
            else
                cerr << ",";
        }

        if (i != (int)VV.size() - 1 and i == MAX_DUBUG_SIZE - 1) {
            cerr << ":\n:\033[m\n";
            return;
        }
    }

    cerr << "]\033[m\n";
    return;
}

template <class Head, class... Tail> void debug_out(Head H, Tail... T) {
    if constexpr (std::is_same_v<Head, vector<ll>>) {
        debug_out_vl(H);
    }
    else if constexpr (std::is_same_v<Head, vector<vector<ll>>>) {
        debug_out_vvl(H);
    }
    else {
        cerr << "\033[33m" << H << "\033[m ";
    }

    debug_out(T...);
}

template <class T> bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template <class T> T pwr(T x, ll n) {
    T res = 1;
    for (int i = 0; i < n; i++) {
        res *= x;
    }
    return res;
}

ll fact(ll n) {
    ll res = 1;
    for (ll i = 1; i <= n; i++) res *= i;
    return res;
}

ll comb(ll n, ll r) {  // comb(60, 30)までオーバーフローなし
    ll res = 1;
    for (int i = 1; i <= r; i++) {
        res *= n--;
        res /= i;
    }
    return res;
}

ll ctoll(char c) {
    if (c < '0' or '9' < c) {
        cerr << "\n\033[33m ctoll に '0'~'9' 以外の文字が入りました．\033[m\n" << endl;
    }
    return ll(c - '0');
}

char lltoc(ll n) {
    if (n < 0 or 9 < n) {
        cerr << "\n\033[33m lltoc に 0 ~ 9 以外の数字が入りました．\033[m\n" << endl;
    }
    return char(n + '0');
}

yukicoder

結果

テストケース

ソースコード