結果
問題 | No.2373 wa, wo, n |
ユーザー |
![]() |
提出日時 | 2023-07-07 23:15:26 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 26 ms / 2,000 ms |
コード長 | 1,860 bytes |
コンパイル時間 | 4,038 ms |
コンパイル使用メモリ | 255,600 KB |
最終ジャッジ日時 | 2025-02-15 08:27:35 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 39 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace atcoder;//using mint = modint1000000007;using mint = modint998244353;//g++ -I/opt/ac-library ./**.cppusing namespace std;using ll = long long;using ull = unsigned long long;//const long long MOD = 1000000007;const long long MOD = 998244353;const long double PI = 3.14159265358979;const long long INF = 1LL<<60;template <typename T> bool chmax(T &a, const T& b){if(a < b){a = b;return true;}return false;}template <typename T> bool chmin(T &a, const T& b){if(a > b){a = b;return true;}return false;}#define deb(var) do{cout << #var << " : "; view(var);}while(0)template<typename T> void view(T e){cout << e << endl;}void view(vector<string>& v){cout << endl;for(auto& s :v){view(s);}cout << endl;}template<typename T> void view(vector<T>& v){for(auto& e :v){cout << e << " ";}cout << endl;}template<typename T> void view(vector<vector<T>>& vv){cout << endl;for(auto& v:vv){view(v);}}ll gcd(ll a, ll b){if (b == 0) return a;else return gcd(b, a % b);}ll lcm(ll x,ll y){return ll(x/gcd(x,y))*y;}template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define int long longint32_t main() {int n;string s;cin >> n >> s;vector<vector<bool>> dp(n + 1, vector<bool>(2, false));dp[0][0] = true;for (int i=0; i<n; i++) {if (s[i] == 'n') {dp[i + 1][0] = dp[i][0];} else if (s[i] == 'a' || s[i] == 'o') {dp[i + 1][0] = dp[i][1];} else if (s[i] == 'w') {dp[i + 1][1] = dp[i][0];} else if (s[i] == '?') {dp[i + 1][0] = dp[i][0] | dp[i][1];dp[i + 1][1] = dp[i][0];}}if (dp[n][0]) cout << "Yes" << "\n";else cout << "No" << "\n";}