#861574 (C++17) No.2276 I Want AC

提出ソース

結果

問題	No.2276 I Want AC
ユーザー	dyktr_06
提出日時	2023-04-21 22:24:58
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,590 ms / 2,000 ms
コード長	5,417 bytes
コンパイル時間	4,248 ms
コンパイル使用メモリ	263,424 KB
実行使用メモリ	7,040 KB
最終ジャッジ日時	2024-11-06 15:56:30
合計ジャッジ時間	55,839 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	2 ms 6,820 KB
testcase_03	AC	2 ms 6,816 KB
testcase_04	AC	2 ms 6,820 KB
testcase_05	AC	2 ms 6,820 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,816 KB
testcase_10	AC	2 ms 6,820 KB
testcase_11	AC	408 ms 6,816 KB
testcase_12	AC	1,283 ms 6,820 KB
testcase_13	AC	393 ms 6,820 KB
testcase_14	AC	172 ms 6,816 KB
testcase_15	AC	689 ms 6,816 KB
testcase_16	AC	605 ms 6,820 KB
testcase_17	AC	1,195 ms 6,816 KB
testcase_18	AC	904 ms 6,816 KB
testcase_19	AC	23 ms 6,816 KB
testcase_20	AC	1,250 ms 6,820 KB
testcase_21	AC	511 ms 6,820 KB
testcase_22	AC	222 ms 6,816 KB
testcase_23	AC	1,461 ms 6,816 KB
testcase_24	AC	1,501 ms 6,912 KB
testcase_25	AC	1,453 ms 6,820 KB
testcase_26	AC	1,413 ms 6,824 KB
testcase_27	AC	1,521 ms 7,040 KB
testcase_28	AC	1,227 ms 6,824 KB
testcase_29	AC	1,130 ms 6,912 KB
testcase_30	AC	1,461 ms 6,820 KB
testcase_31	AC	950 ms 6,912 KB
testcase_32	AC	1,473 ms 6,912 KB
testcase_33	AC	1,473 ms 6,820 KB
testcase_34	AC	1,216 ms 6,820 KB
testcase_35	AC	752 ms 6,912 KB
testcase_36	AC	791 ms 6,816 KB
testcase_37	AC	805 ms 6,912 KB
testcase_38	AC	752 ms 6,912 KB
testcase_39	AC	750 ms 6,820 KB
testcase_40	AC	794 ms 6,912 KB
testcase_41	AC	790 ms 6,912 KB
testcase_42	AC	829 ms 6,912 KB
testcase_43	AC	825 ms 6,912 KB
testcase_44	AC	1,268 ms 6,912 KB
testcase_45	AC	1,488 ms 6,912 KB
testcase_46	AC	1,478 ms 6,912 KB
testcase_47	AC	1,254 ms 6,912 KB
testcase_48	AC	1,258 ms 6,912 KB
testcase_49	AC	1,492 ms 6,912 KB
testcase_50	AC	1,475 ms 6,912 KB
testcase_51	AC	1,516 ms 6,912 KB
testcase_52	AC	1,590 ms 6,912 KB
testcase_53	AC	1,404 ms 6,912 KB
testcase_54	AC	969 ms 6,820 KB
testcase_55	AC	943 ms 6,912 KB
testcase_56	AC	861 ms 6,820 KB
testcase_57	AC	803 ms 6,912 KB
testcase_58	AC	839 ms 6,816 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll n;
string s;

ll f(ll c){

    string t = s;
    rep(j, n){
        if(s[j] == '?'){
            if(j < c){
                t[j] = 'A';
            }else{
                t[j] = 'C';
            }
        }
    }

    vll sa(n + 1), sc(n + 1);
    rep(i, n){
        sa[i + 1] = sa[i];
        sc[i + 1] = sc[i];
        if(t[i] == 'A'){
            sa[i + 1]++;
        }else{
            sc[i + 1]++;
        }
    }
    ll res = 0;
    rep(i, n){
        if(t[i] == 'A')
        res += (sc[n] - sc[i + 1]);
    }
    return res;
}

void input(){
    in(n, s);
}
 
void solve(){
    ll low = 0, high = n;
    ll ans = 0;
    rep(i, 50){
        ll c1 = (low * 2 + high) / 3;
        ll c2 = (low + high * 2) / 3;
        ll res1 = f(c1), res2 = f(c2);
        chmax(ans, res1);
        chmax(ans, res2);
        if(res1 < res2){
            low = c1;
        }else{
            high = c2;
        }
    }
    low = 0, high = n;
    rep(i, 50){
        ll c1 = (low * 2 + high) / 3;
        ll c2 = (low + high * 2) / 3;
        ll res1 = f(c1), res2 = f(c2);
        chmax(ans, res1);
        chmax(ans, res2);
        if(res1 <= res2){
            low = c1;
        }else{
            high = c2;
        }
    }
    rep(i, low - 50, low + 50){
        chmax(ans, f(i));
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード