結果
問題 | No.559 swapAB列 |
ユーザー | naimonon77 |
提出日時 | 2017-12-03 20:52:21 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,271 bytes |
コンパイル時間 | 1,822 ms |
コンパイル使用メモリ | 174,540 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-05-06 09:11:17 |
合計ジャッジ時間 | 2,454 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
ソースコード
#define TEST_MODE true #define _CRT_SECURE_NO_WARNINGS #define _USE_MATH_DEFINES #include "bits/stdc++.h" using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); ++i) #define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i) #define rrep(i, n) for (int i = (n)-1; i >= 0; --i) #define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i) #define range(i, a, b, c) for (int i = a; \ c > 0 ? i < b : i > b; \ i += c) #define chmax(a, b) (a = (a) < (b) ? (b) : (a)) #define chmin(a, b) (a = (a) > (b) ? (b) : (a)) using ll = long long; using ull = unsigned long long; using ld = long double; #define all(a) begin(a), end(a) #define ifnot(a) if (not(a)) #define int long long #ifdef LOCAL_ENV #if TEST_MODE == true const bool test = true; #define dump(x) cerr << #x << " = " << (x) << endl #else const bool test = false; #define dump(x) #endif #else const bool test = false; #define dump(x) #endif int dx[] = { 1, 0, -1, 0 }; int dy[] = { 0, 1, 0, -1 }; const int INF = (int)1 << 60; const ll INFL = (ll)1 << 60; ll mod_n = (int)1e9 + 7; const double eps = 1e-10; typedef long double Real; // return -1, 0, 1 int sgn(const Real &r) { return (r > eps) - (r < -eps); } int sgn(const Real &a, const Real &b) { return sgn(a - b); } //..................... const int MAX = (int)2e5 + 5; vector<string> split(const string &str, char sep) { vector<string> v; stringstream ss(str); string buffer; while (getline(ss, buffer, sep)) { v.push_back(buffer); } return v; } template <class InputIterator> int sum(InputIterator begin, InputIterator end) { return accumulate(begin, end, 0ll); } template<typename T> T gcd(T a, T b) { T c; while (a != 0) { c = a; a = b%a; b = c; } return b; } class Solver { public: string s; void solve() { cin >> s; int n = s.size(); int res = 0; while (true) { int id_left = n - 1; rep(i, n) { if (s[i] == 'B') { id_left = i - 1; break; } } int id_right = id_left; rep2(i, id_left + 1, n) { if (s[i] == 'A') { id_right = i; break; } } if (id_left == id_right) break; res += id_right - id_left - 1; for (int i = id_right; i - 1 > id_left; i--) { swap(s[i], s[i - 1]); } } cout << res << endl; } }; signed main() { srand((unsigned int)time(NULL)); cout << fixed << setprecision(20); auto ptr = new Solver(); ptr->solve(); delete ptr; //while (true) { // if (cin.eof() == true) break; // auto ptr = new Solver(); // ptr->solve(); // delete ptr; //} return 0; } // class Mycin { // bool flag = true; // public: // Mycin& operator >> (int& a) {flag = scanf("%lld", &a) != EOF; return *this;} // Mycin& operator >> (char& a) {flag = scanf("%c", &a) != EOF; return *this;} // Mycin& operator >> (string& s) {flag = (bool)(cin >> s); return *this;} // operator bool() {return flag;} // } mycin; // class Mycout { // public: // Mycout& operator << (const int& a) {printf("%lld", a); return *this;} // Mycout& operator << (const char c) {printf("%c", c); return *this;} // Mycout& operator << (const string& s) {printf("%s", s.c_str()); return *this;} // } mycout; // #define cin mycin // #define cout mycout // #define endl '\n'