結果
問題 | No.2021 Not A but B |
ユーザー |
![]() |
提出日時 | 2022-08-01 21:56:30 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 42 ms / 2,000 ms |
コード長 | 4,009 bytes |
コンパイル時間 | 11,051 ms |
コンパイル使用メモリ | 290,560 KB |
最終ジャッジ日時 | 2025-01-30 17:08:29 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 26 |
ソースコード
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <iostream>#include <iomanip>#include <string>#include <cmath>#include <algorithm>#include <vector>#include <set>#include <map>#include <unordered_map>#include <unordered_set>#include <list>#include <stack>#include <queue>#include <bitset>#include <numeric>#include <cassert>#include <memory>#include <random>#include <functional>#include <complex>#include <immintrin.h>#include <stdexcept>#ifdef DEBUG#include "./CompetitiveProgrammingCpp/debug.hpp"#include "./CompetitiveProgrammingCpp/Timer.hpp"#include "./CompetitiveProgrammingCpp/sample.hpp"#else#define dump(...)template<class T>constexpr inline auto d_val(T a, T b) { return a; }#endif/* macro */#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)#define RFOR(i, b, e) for(ll i = (ll)((e)-1); i >= (ll)(b); --i)#define REP(i, n) FOR(i, 0, (n))#define RREP(i, n) RFOR(i, 0, (n))#define REPC(x,c) for(const auto& x:(c))#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)#define REPI(it,c) REPI2(it, (c).begin(), (c).end())#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())#define ALL(x) (x).begin(),(x).end()#define cauto const auto&/* macro func */template<class T>inline auto sort(T& t) { std::sort(ALL(t)); }template<class T>inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }template<class T>inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }template<class T, class S>inline auto chmax(T& t, const S& s) { if(s > t) { t = s; return true; } return false; }template<class T, class S>inline auto chmin(T& t, const S& s) { if(s < t) { t = s; return true; } return false; }inline auto BR() { std::cout << "\n"; }/* type define */using ll = long long;using VS = std::vector<std::string>;using VL = std::vector<long long>;using VVL = std::vector<VL>;using VVVL = std::vector<VVL>;using VVVVL = std::vector<VVVL>;using VVVVVL = std::vector<VVVVL>;using VD = std::vector<double>;template<class T>using V = std::vector<T>;template<class T = ll, class U = T>using P = std::pair<T, U>;using PAIR = P<ll>;/* using std */using std::cout;constexpr char endl = '\n';using std::cin;using std::pair;using std::string;using std::stack;using std::queue;using std::deque;using std::vector;using std::list;using std::map;using std::unordered_map;using std::multimap;using std::unordered_multimap;using std::set;using std::unordered_set;using std::unordered_multiset;using std::multiset;using std::bitset;using std::priority_queue;/* Initial processing */struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;/* Remove the source of the bug */auto pow(signed, signed) { assert(false); }/* define hash */namespace std {template <> class hash<std::pair<ll, ll>> { public: size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };}/* input */template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for(T& x : vec) is >> x; return is; }/* constant value */// constexpr ll MOD = 1000000007;constexpr ll MOD = 998244353;//=============================================================================================signed main() {ll n;string s;cin >> n >> s;unordered_set<PAIR> st;REP(i, n - 1) {bool i1 = (s[i] == 'A');bool i2 = (s[i + 1] == 'A');if(i1 && i2) { st.emplace(i, i + 1); }if(i1 && !i2) { st.emplace(i, -1); }if(!i1 && i2) { st.emplace(i + 1, -1); }if(!i1 && !i2) { st.emplace(-1, -1); }}cout << st.size() << endl;}