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

提出ソース

結果

問題	No.2276 I Want AC
ユーザー	T101010101
提出日時	2023-06-23 20:25:17
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	10,617 bytes
コンパイル時間	4,068 ms
コンパイル使用メモリ	272,740 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-06-30 23:58:57
合計ジャッジ時間	9,997 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	38 ms 6,944 KB
testcase_12	AC	116 ms 6,940 KB
testcase_13	AC	35 ms 6,944 KB
testcase_14	AC	16 ms 6,944 KB
testcase_15	AC	61 ms 6,944 KB
testcase_16	AC	53 ms 6,944 KB
testcase_17	AC	106 ms 6,944 KB
testcase_18	AC	84 ms 6,944 KB
testcase_19	AC	4 ms 6,944 KB
testcase_20	AC	112 ms 6,940 KB
testcase_21	AC	46 ms 6,940 KB
testcase_22	AC	21 ms 6,944 KB
testcase_23	AC	131 ms 6,944 KB
testcase_24	AC	131 ms 6,944 KB
testcase_25	AC	129 ms 6,940 KB
testcase_26	AC	122 ms 6,940 KB
testcase_27	AC	135 ms 6,940 KB
testcase_28	AC	102 ms 6,940 KB
testcase_29	AC	83 ms 6,940 KB
testcase_30	AC	131 ms 6,944 KB
testcase_31	AC	59 ms 6,940 KB
testcase_32	AC	132 ms 6,940 KB
testcase_33	AC	131 ms 6,940 KB
testcase_34	AC	104 ms 6,940 KB
testcase_35	AC	25 ms 6,940 KB
testcase_36	AC	26 ms 6,940 KB
testcase_37	AC	28 ms 6,944 KB
testcase_38	WA	-
testcase_39	AC	23 ms 6,944 KB
testcase_40	AC	26 ms 6,940 KB
testcase_41	AC	24 ms 6,944 KB
testcase_42	AC	29 ms 6,940 KB
testcase_43	AC	29 ms 6,940 KB
testcase_44	AC	81 ms 6,944 KB
testcase_45	AC	129 ms 6,940 KB
testcase_46	AC	129 ms 6,940 KB
testcase_47	AC	87 ms 6,940 KB
testcase_48	WA	-
testcase_49	AC	134 ms 6,940 KB
testcase_50	AC	133 ms 6,940 KB
testcase_51	AC	134 ms 6,944 KB
testcase_52	AC	135 ms 6,940 KB
testcase_53	AC	123 ms 6,940 KB
testcase_54	AC	63 ms 6,944 KB
testcase_55	AC	59 ms 6,944 KB
testcase_56	AC	41 ms 6,940 KB
testcase_57	AC	30 ms 6,940 KB
testcase_58	AC	34 ms 6,944 KB

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

ソースコード

raw source code

#pragma region Macros

// #pragma GCC target("avx, avx2, fma")
// #pragma GCC optimize("O3,unroll-loops")

#include <bits/extc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using namespace __gnu_pbds;

// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// using Bint = mp::cpp_int;
// using Bdouble = mp::number<mp::cpp_dec_float<128>>;

#define TO_STRING(var) # var
#define pb emplace_back
#define int ll
#define endl '\n'
#define sqrt __builtin_sqrtl

using ll = long long;
using ld = long double;
const ld PI = acos(-1);
const ld EPS = 1e-10;
const int INF = 1 << 30;
const ll INFL = 1LL << 61;
const int MOD = 998244353;
// const int MOD = 1000000007;

const vector<int> dx = {0, 1, -1, 0, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗
const vector<int> dy = {1, 0, 0, -1, 1, -1, -1, 1};

struct Edge {
    int from, to;
    int cost;
    Edge(int to, int cost) : from(-1), to(to), cost(cost) {}
    Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {}
    Edge &operator=(const int &x) {
        to = x;
        return *this;
    }
};

__attribute__((constructor))
void constructor() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(12);
}

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

int POW(int x, int n) {
    __int128_t ret = 1;
    // if (ret >= INFL) return INFL;
    if (n < 0) { cout << "error" << endl; return 0; }
    else if (x == 1 or n == 0) ret = 1;
    else if (x == -1 && n % 2 == 0) ret = 1; 
    else if (x == -1) ret = -1; 
    else if (n % 2 == 0) ret = POW(x * x, n / 2);
    else ret = x * POW(x, n - 1);

    if (ret > 8e18) ret = 0;
    return ret;
}

int floor(int x, int y) { return (x > 0 ? x / y : (x - y + 1) / y); }
int ceil(int x, int y) { return (x > 0 ? (x + y - 1) / y : x / y); }
ll per(int x, int y) {
    if (y == 0) {
        cout << "error" << endl;
        return INFL;
    }
    if (x >= 0 && y > 0) return x / y;
    if (x >= 0 && y < 0) return x / y - (x % y < 0);
    if (x < 0 && y < 0) return x / y + (x % y < 0);
    // if (x < 0 && y > 0) 
    return x / y - (x % y < 0);
}
ll mod(int x, int y) {
    if (y == 0) {
        cout << "error" << endl;
        return INFL;
    }
    if (x >= 0 && y > 0) return x % y;
    if (x >= 0 && y < 0) return x % y;
    if (x < 0 && y < 0) {
        __int128_t ret = x % y;
        ret += (__int128_t)abs(y) * INFL;
        ret %= abs(y);
        return ret;
    }
    // if (x < 0 && y > 0) {
        __int128_t ret = x % y;
        ret += (__int128_t)abs(y) * INFL;
        ret %= abs(y);
        return ret;
    // }
}

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 (a > b) { a = b; return true; }
    return false;
}

int countl_zero(int N) { return __builtin_clzll(N); }
int countl_one(int N) {
    int ret = 0; while (N % 2) { N /= 2; ret++; }
    return ret;
}
int countr_zero(int N) { return __builtin_ctzll(N); }
int countr_one(int N) {
    int ret = 0, k = 63 - __builtin_clzll(N);
    while (k != -1 && (N & (1LL << k))) { k--; ret++; }
    return ret;
}
int popcount(int N) { return __builtin_popcountll(N); }
int unpopcount(int N) { return 64 - __builtin_clzll(N) - __builtin_popcountll(N); }

int top_bit(int N) { return 63 - __builtin_clzll(N);} // 2^kの位
int bot_bit(int N) { return __builtin_ctz(N);} // 2^kの位
int MSB(int N) { return 1 << (63 - __builtin_clzll(N)); } // mask

int bit_width(int N) { return 64 - __builtin_clzll(N); } // 桁数
int ceil_log2(int N) { return 63 - __builtin_clzll(N); }
int bit_floor(int N) { return 1 << (63 - __builtin_clzll(N)); }
int floor_log2(int N) { return 64 - __builtin_clzll(N-1); }
int bit_ceil(int N) { return 1 << (64 - __builtin_clzll(N-1)) - (N==1); }

class UnionFind {
public:
	UnionFind() = default;
    UnionFind(int N) : par(N), sz(N, 1) {
        iota(par.begin(), par.end(), 0);
    }

	int root(int x) {
		if (par[x] == x) return x;
		return (par[x] = root(par[x]));
	}

	bool unite(int x, int y) {
		int rx = root(x);
		int ry = root(y);

        if (rx == ry) return false;
		if (sz[rx] < sz[ry]) swap(rx, ry);

		sz[rx] += sz[ry];
		par[ry] = rx;

        return true;
	}

	bool issame(int x, int y) { return (root(x) == root(y)); }
	int size(int x) { return sz[root(x)]; }

    vector<vector<int>> groups(int N) {
        vector<vector<int>> G(N);
        for (int x = 0; x < N; x++) {
            G[root(x)].push_back(x);
        }
		G.erase(
            remove_if(G.begin(), G.end(),
                [&](const vector<int>& V) { return V.empty(); }),
                    G.end());
        return G;
    }

private:
	vector<int> par;
	vector<int> sz;
};

template<int mod> class Modint{
public:
    int val = 0;
    Modint(int x = 0) { while (x < 0) x += mod; val = x % mod; }
    Modint(const Modint &r) { val = r.val; }

    Modint operator -() { return Modint(-val); } // 単項
    Modint operator +(const Modint &r) { return Modint(*this) += r; }
    Modint operator +(const int &q) { Modint r(q); return Modint(*this) += r; }
    Modint operator -(const Modint &r) { return Modint(*this) -= r; }
    Modint operator -(const int &q) { Modint r(q); return Modint(*this) -= r; }
    Modint operator *(const Modint &r) { return Modint(*this) *= r; }
    Modint operator *(const int &q) { Modint r(q); return Modint(*this) *= r; }
    Modint operator /(const Modint &r) { return Modint(*this) /= r; }
    Modint operator /(const int &q) { Modint r(q); return Modint(*this) /= r; }
    
    Modint& operator ++() { val++; if (val >= mod) val -= mod; return *this; } // 前置
    Modint operator ++(signed) { ++*this; return *this; } // 後置
    Modint& operator --() { val--; if (val < 0) val += mod; return *this; }
    Modint operator --(signed) { --*this; return *this; }
    Modint &operator +=(const Modint &r) { val += r.val; if (val >= mod) val -= mod; return *this; }
    Modint &operator +=(const int &q) { Modint r(q); val += r.val; if (val >= mod) val -= mod; return *this; }
    Modint &operator -=(const Modint &r) { if (val < r.val) val += mod; val -= r.val; return *this; }
    Modint &operator -=(const int &q) { Modint r(q);  if (val < r.val) val += mod; val -= r.val; return *this; }
    Modint &operator *=(const Modint &r) { val = val * r.val % mod; return *this; }
    Modint &operator *=(const int &q) { Modint r(q); val = val * r.val % mod; return *this; }
    Modint &operator /=(const Modint &r) {
        int a = r.val, b = mod, u = 1, v = 0;
        while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}
        val = val * u % mod; if (val < 0) val += mod;
        return *this;
    }
    Modint &operator /=(const int &q) {
        Modint r(q); int a = r.val, b = mod, u = 1, v = 0;
        while (b) {int t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v);}
        val = val * u % mod; if (val < 0) val += mod;
        return *this;
    }

    bool operator ==(const Modint& r) { return this -> val == r.val; }
    bool operator <(const Modint& r) { return this -> val < r.val; }
    bool operator !=(const Modint& r) { return this -> val != r.val; }
};

using mint = Modint<MOD>;

istream &operator >>(istream &is, mint& x) {
    int t; is >> t;
    x = t;
    return (is);
}
ostream &operator <<(ostream &os, const mint& x) {
    return os << x.val;
}
mint modpow(const mint &x, int n) {
    if (n == 0) return 1;
    mint t = modpow(x, n / 2);
    t = t * t;
    if (n & 1) t = t * x;
    return t;
}

int modpow(__int128_t x, int n, int mod) {
    __int128_t ret = 1;
    while (n > 0) {
        if (n % 2 == 1) ret = ret * x % mod;
        x = x * x % mod;
        n /= 2;
    }
    return ret;
}

int modinv(__int128_t x, int mod) {
    if (x == 1) return 1;
    return mod - modinv(mod % x, mod) * (mod / x) % mod;
}

vector<mint> fac, finv, Inv;
void COMinit(int N) {
    fac.resize(N + 1);
    finv.resize(N + 1);
    Inv.resize(N + 1);
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    Inv[1] = 1;
    for (int i = 2; i <= N; i++) {
        fac[i] = fac[i-1] * mint(i);
        Inv[i] = -Inv[MOD % i] * mint(MOD / i);
        finv[i] = finv[i - 1] * Inv[i];
    }
}

mint COM(int N, int K) {
    if (N < K) return 0;
    if (N < 0 or K < 0) return 0;
    return fac[N] * finv[K] * finv[N - K];
}

#pragma endregion

int ternary_search(int l, int r, const function<int(int)> solve, const bool is_downward_convex = false) {
    if (is_downward_convex) { // 下に凸
        while (r - l > 2) {
            auto mid_l = (l * 2 + r) / 3, mid_r = (l + 2 * r) / 3;
            if (solve(mid_l) >= solve(mid_r)) l = mid_l;
            else r = mid_r;
        }
    } else { // 上に凸
        while (r - l > 2) {
            auto mid_l = (l * 2 + r) / 3, mid_r = (l + 2 * r) / 3;
            if (solve(mid_l) <= solve(mid_r)) l = mid_l;
            else r = mid_r;
        }
    }
    return l;
}

signed main() {
    int N;
    cin >> N;
    string S;
    cin >> S;

    vector<int> pos;
    for (int i = 0; i < N; i++) if (S[i] == '?') pos.pb(i);

    int ngl = -1, ngr = N + 1;
    auto solve = [&](int x) {
        string S2 = S;
        for (int i = 0; i < N; i++) {
            if (i < x && S2[i] == '?') S2[i] = 'A';
            else if (S2[i] == '?') S2[i] = 'C';
        }

        int ret = 0; // "AC"の個数
        int cntA = 0;
        for (int i = 0; i < N; i++) {
            if (S2[i] == 'A') cntA++;
            else ret += cntA;
        }           
        return ret;
    };

    int ok = ternary_search(ngl, ngr, solve);

    int ans = 0;
    for (int i = -5; i <= 5; i++) {
        int OK = ok + i;
        if (OK < 0 or OK >= N) continue;

        string S2 = S;
        for (int i = 0; i < N; i++) {
            if (i < OK && S[i] == '?') S2[i] = 'A';
            else if (S2[i] == '?') S2[i] = 'C';
        }

        int ret = 0; // "AC"の個数
        int cntA = 0;
        for (int i = 0; i < N; i++) {
            if (S2[i] == 'A') cntA++;
            else ret += cntA;
        }
        ans = max(ans, ret);
    }
    cout << ans << endl;
}

yukicoder

結果

テストケース

ソースコード