結果
問題 | No.1951 消えたAGCT(2) |
ユーザー |
![]() |
提出日時 | 2022-05-21 00:00:04 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 531 ms / 3,000 ms |
コード長 | 4,533 bytes |
コンパイル時間 | 10,597 ms |
コンパイル使用メモリ | 276,748 KB |
最終ジャッジ日時 | 2025-01-29 12:09:14 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 28 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>using namespace std;using ll = long long;const int INF = 1e9;const ll inf = 1LL<<60;using S = int;S op(S a, S b) {return a+b;}S e() {return 0;}namespace internal {// @param n `0 <= n`// @return minimum non-negative `x` s.t. `n <= 2**x`int ceil_pow2(int n) {int x = 0;while ((1U << x) < (unsigned int)(n)) x++;return x;}// @param n `1 <= n`// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`int bsf(unsigned int n) {#ifdef _MSC_VERunsigned long index;_BitScanForward(&index, n);return index;#elsereturn __builtin_ctz(n);#endif}}template <class S, S (*op)(S, S), S (*e)()> struct segtree {public:segtree() : segtree(0) {}segtree(int n) : segtree(std::vector<S>(n, e())) {}segtree(const std::vector<S>& v) : _n(int(v.size())) {log = internal::ceil_pow2(_n);size = 1 << log;d = std::vector<S>(2 * size, e());for (int i = 0; i < _n; i++) d[size + i] = v[i];for (int i = size - 1; i >= 1; i--) {update(i);}}void set(int p, S x) {assert(0 <= p && p < _n);p += size;d[p] = x;for (int i = 1; i <= log; i++) update(p >> i);}S get(int p) {assert(0 <= p && p < _n);return d[p + size];}void add(int p, S x = 1) {assert(0 <= p && p < _n);ll val = get(p) + x;p += size;d[p] = val;for (int i = 1; i <= log; i++) update(p >> i);}S prod(int l, int r) {assert(0 <= l && l <= r && r <= _n);S sml = e(), smr = e();l += size;r += size;while (l < r) {if (l & 1) sml = op(sml, d[l++]);if (r & 1) smr = op(d[--r], smr);l >>= 1;r >>= 1;}return op(sml, smr);}S all_prod() { return d[1]; }template <bool (*f)(S)> int max_right(int l) {return max_right(l, [](S x) { return f(x); });}template <class F> int max_right(int l, F f) {assert(0 <= l && l <= _n);assert(f(e()));if (l == _n) return _n;l += size;S sm = e();do {while (l % 2 == 0) l >>= 1;if (!f(op(sm, d[l]))) {while (l < size) {l = (2 * l);if (f(op(sm, d[l]))) {sm = op(sm, d[l]);l++;}}return l - size;}sm = op(sm, d[l]);l++;} while ((l & -l) != l);return _n;}template <bool (*f)(S)> int min_left(int r) {return min_left(r, [](S x) { return f(x); });}template <class F> int min_left(int r, F f) {assert(0 <= r && r <= _n);assert(f(e()));if (r == 0) return 0;r += size;S sm = e();do {r--;while (r > 1 && (r % 2)) r >>= 1;if (!f(op(d[r], sm))) {while (r < size) {r = (2 * r + 1);if (f(op(d[r], sm))) {sm = op(d[r], sm);r--;}}return r + 1 - size;}sm = op(d[r], sm);} while ((r & -r) != r);return 0;}private:int _n, size, log;std::vector<S> d;void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }};void solve() {int n; cin >> n;string s; cin >> s;vector<int> alp(26);for (int i=0; i<n; i++) alp[s[i] - 'A']++;segtree<S, op, e> seg(n);for (int i=0; i<n; i++) seg.set(i, 1);int p = 0;int ans = 0;while (1) {int cnt = alp[(-p+26)%26]+alp[(2-p+26)%26]+alp[(6-p+26)%26]+alp[(19-p+26)%26];// cout << (6-p+26)%26 << " " << alp[(6-p+26)%26] << endl;// cout << alp[2] << endl;if (cnt == 0) break;ans++;int ng = 0, ok = n;while (ok - ng > 1) {int mid = (ok + ng) / 2;(seg.prod(0, mid) >= cnt ? ok : ng) = mid;}seg.set(ok-1, 0);alp[s[ok-1] - 'A']--;p += alp[s[ok-1] - 'A'];p %= 26;// cout << cnt << " " << ok-1 << " " << p << endl;}cout << ans << '\n';}int main() {ios::sync_with_stdio(false);std::cin.tie(nullptr);// int t; cin >> t;/*while (t--)*/ solve();}