結果

問題 No.2373 wa, wo, n
ユーザー *yudai25n
提出日時 2023-12-03 17:20:10
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 40 ms / 2,000 ms
コード長 1,895 bytes
コンパイル時間 4,341 ms
コンパイル使用メモリ 253,264 KB
最終ジャッジ日時 2025-02-18 06:46:16
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 39
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i,n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i,l,r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using LP = pair<long long,long long>;
using SP = pair<string,string>;
using vi = vector<int>;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using mint1 = modint1000000007;
using mint9 = modint998244353;
const int INF = 2e9;
const long long LINF = 4e18;
const int di[] = {0,1,0,-1,-1,1,-1,1};
const int dj[] = {1,0,-1,0,1,1,-1,-1};
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
void YesNo (bool ok , const string &s , const string &t) {if(ok) cout << s << endl; else cout << t << endl;} 
//-----def end-----//
int main () {
    int n;
    string s;
    cin >> n >> s;
    vector dp(n+1 , vector<bool>(26));
    if(s[0] == '?' || s[0] == 'n') dp[0]['n'-'a'] = true;
    if(s[0] == '?' || s[0] == 'w') dp[0]['w'-'a'] = true;
    rep(i , n-1) rep(j , 26) {
        if(!dp[i][j]) continue;
        if(j == 'w'-'a') {
            if(s[i+1] == 'a' || s[i+1] == '?') dp[i+1]['a'-'a'] = true;
            if(s[i+1] == 'o' || s[i+1] == '?') dp[i+1]['o'-'a'] = true;
        } else {
            if(s[i+1] == 'w' || s[i+1] == '?') dp[i+1]['w'-'a'] = true;
            if(s[i+1] == 'n' || s[i+1] == '?') dp[i+1]['n'-'a'] = true;
        }
    }
    YesNo(dp[n-1]['a'-'a']||dp[n-1]['o'-'a']||dp[n-1]['n'-'a'],"Yes","No");
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0