結果
問題 | No.2240 WAC |
ユーザー |
![]() |
提出日時 | 2023-03-10 21:35:40 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 23 ms / 2,000 ms |
コード長 | 2,828 bytes |
コンパイル時間 | 1,619 ms |
コンパイル使用メモリ | 198,084 KB |
最終ジャッジ日時 | 2025-02-11 07:52:33 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 43 |
ソースコード
#include <bits/stdc++.h>using namespace std;typedef long long ll;#define ALL(x) (x).begin(), (x).end()#ifdef LOCAL#include "debug.hpp"#else#define debug(...) void(0)#endiftemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {for (T& x : v) is >> x;return is;}template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {for (size_t i = 0; i < v.size(); i++) {os << v[i] << (i + 1 == v.size() ? "" : " ");}return os;}template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }int popcount(signed t) { return __builtin_popcount(t); }int popcount(long long t) { return __builtin_popcountll(t); }bool ispow2(int i) { return i && (i & -i) == i; }long long MSK(int n) { return (1LL << n) - 1; }template <class T> T ceil(T x, T y) {assert(y >= 1);return (x > 0 ? (x + y - 1) / y : x / y);}template <class T> T floor(T x, T y) {assert(y >= 1);return (x > 0 ? x / y : (x - y + 1) / y);}template <class T1, class T2> inline bool chmin(T1& a, T2 b) {if (a > b) {a = b;return true;}return false;}template <class T1, class T2> inline bool chmax(T1& a, T2 b) {if (a < b) {a = b;return true;}return false;}template <typename T> void mkuni(vector<T>& v) {sort(v.begin(), v.end());v.erase(unique(v.begin(), v.end()), v.end());}template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }const int INF = (1 << 30) - 1;const long long IINF = (1LL << 60) - 1;const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};const int MOD = 998244353;// const int MOD = 1000000007;int main() {cin.tie(0);ios::sync_with_stdio(false);int N, M;string S;cin >> N >> M >> S;vector<vector<int>> pos(3);for (int i = 0; i < int(S.size()); i++) pos[S[i] == 'W' ? 0 : S[i] == 'A' ? 1 : 2].emplace_back(i);while (not pos[0].empty()) {if (pos[0].back() > pos[1].back()) {cout << "No" << '\n';return 0;}pos[0].pop_back();pos[1].pop_back();}reverse(ALL(pos[1]));reverse(ALL(pos[2]));while (not pos[2].empty()) {if (pos[1].back() > pos[2].back()) {cout << "No" << '\n';return 0;}pos[1].pop_back();pos[2].pop_back();}cout << "Yes" << '\n';return 0;}