結果
問題 | No.2373 wa, wo, n |
ユーザー | *yudai25n |
提出日時 | 2023-12-03 17:20:10 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 41 ms / 2,000 ms |
コード長 | 1,895 bytes |
コンパイル時間 | 4,420 ms |
コンパイル使用メモリ | 266,124 KB |
実行使用メモリ | 17,560 KB |
最終ジャッジ日時 | 2023-12-03 17:20:18 |
合計ジャッジ時間 | 7,623 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 2 ms
6,676 KB |
testcase_03 | AC | 2 ms
6,676 KB |
testcase_04 | AC | 2 ms
6,676 KB |
testcase_05 | AC | 2 ms
6,676 KB |
testcase_06 | AC | 2 ms
6,676 KB |
testcase_07 | AC | 1 ms
6,676 KB |
testcase_08 | AC | 2 ms
6,676 KB |
testcase_09 | AC | 2 ms
6,676 KB |
testcase_10 | AC | 2 ms
6,676 KB |
testcase_11 | AC | 1 ms
6,676 KB |
testcase_12 | AC | 2 ms
6,676 KB |
testcase_13 | AC | 2 ms
6,676 KB |
testcase_14 | AC | 34 ms
14,880 KB |
testcase_15 | AC | 7 ms
6,676 KB |
testcase_16 | AC | 37 ms
15,960 KB |
testcase_17 | AC | 12 ms
6,784 KB |
testcase_18 | AC | 3 ms
6,676 KB |
testcase_19 | AC | 16 ms
8,064 KB |
testcase_20 | AC | 31 ms
14,496 KB |
testcase_21 | AC | 15 ms
7,808 KB |
testcase_22 | AC | 22 ms
10,712 KB |
testcase_23 | AC | 36 ms
16,428 KB |
testcase_24 | AC | 2 ms
6,676 KB |
testcase_25 | AC | 2 ms
6,676 KB |
testcase_26 | AC | 2 ms
6,676 KB |
testcase_27 | AC | 2 ms
6,676 KB |
testcase_28 | AC | 2 ms
6,676 KB |
testcase_29 | AC | 2 ms
6,676 KB |
testcase_30 | AC | 2 ms
6,676 KB |
testcase_31 | AC | 2 ms
6,676 KB |
testcase_32 | AC | 41 ms
17,560 KB |
testcase_33 | AC | 38 ms
17,560 KB |
testcase_34 | AC | 40 ms
17,560 KB |
testcase_35 | AC | 39 ms
17,560 KB |
testcase_36 | AC | 40 ms
17,528 KB |
testcase_37 | AC | 39 ms
17,560 KB |
testcase_38 | AC | 39 ms
17,552 KB |
testcase_39 | AC | 38 ms
17,488 KB |
testcase_40 | AC | 39 ms
17,528 KB |
testcase_41 | AC | 38 ms
17,508 KB |
testcase_42 | AC | 39 ms
17,560 KB |
ソースコード
#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; }