結果
問題 | No.2021 Not A but B |
ユーザー |
![]() |
提出日時 | 2022-07-30 00:31:41 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 53 ms / 2,000 ms |
コード長 | 2,155 bytes |
コンパイル時間 | 4,212 ms |
コンパイル使用メモリ | 257,028 KB |
最終ジャッジ日時 | 2025-01-30 16:23:34 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 26 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using pll = pair<ll, ll>;using tlll = tuple<ll, ll, ll>;constexpr ll INF = 1LL << 60;template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}ll pow_ll(ll A, ll B) {ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}ll arisum_ll(ll a, ll d, ll n) { return n * a + (n & 1 ? ((n - 1) >> 1) * n : (n >> 1) * (n - 1)) * d; }ll arisum2_ll(ll a, ll l, ll n) { return n & 1 ? ((a + l) >> 1) * n : (n >> 1) * (a + l); }ll arisum3_ll(ll a, ll l, ll d) { assert((l - a) % d == 0); return arisum2_ll(a, l, (l - a) / d + 1); }template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout <<'\n';}template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}//*#include <atcoder/all>using namespace atcoder;using mint = modint998244353;//using mint = modint1000000007;//using mint = modint;//*/int main(){ll N;cin >> N;string S;cin >> S;set<ll> st;ll ans = 0;for (ll i = 0; i < N - 1; i++){string s = S.substr(i, 2);if (s == "AA")ans++;else if (s == "BB")st.emplace(-1);else if (s == "AB")st.emplace(i);else if (s == "BA")st.emplace(i + 1);}ans += st.size();cout << ans << endl;}