結果
問題 |
No.3234 Infinite Propagation
|
ユーザー |
![]() |
提出日時 | 2025-08-15 22:10:40 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 15 ms / 2,000 ms |
コード長 | 3,108 bytes |
コンパイル時間 | 3,141 ms |
コンパイル使用メモリ | 282,112 KB |
実行使用メモリ | 9,436 KB |
最終ジャッジ日時 | 2025-08-15 22:11:02 |
合計ジャッジ時間 | 3,849 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 18 |
ソースコード
#include <bits/stdc++.h> #include <cassert> using namespace std; using ll = long long int; using u64 = unsigned long long; using pll = pair<ll, ll>; // #include <atcoder/all> // using namespace atcoder; #define REP(i, a, b) for (ll i = (a); i < (b); i++) #define REPrev(i, a, b) for (ll i = (a); i >= (b); i--) #define ALL(coll) (coll).begin(), (coll).end() #define SIZE(v) ((ll)((v).size())) #define REPOUT(i, a, b, exp, sep) REP(i, (a), (b)) cout << (exp) << (i + 1 == (b) ? "" : (sep)); cout << "\n" // @@ !! LIM(forall) // ---- inserted library file forall.cc #define EX_REP_LL(i, from, to) for (ll i = (from); i < (to); i++) #define EX_REP_RB(x, coll) for (auto x : coll) #define EXGEN(rep_part, cond, yes, no_behaviour) ([&]() { rep_part if (cond) return (yes); no_behaviour; }()) #define EXISTS_BASE(rep_part, cond) EXGEN(rep_part, cond, true, return false) #define EXFIND_BASE(rep_part, cond, t) EXGEN(rep_part, cond, t, assert(0)) #define EXFIND_D_BASE(rep_part, cond, t, def) EXGEN(rep_part, cond, t, return def) #define EXISTS(i, from, to, cond) EXISTS_BASE(EX_REP_LL(i, from, to), cond) #define FORALL(i, from, to, cond) (not EXISTS(i, from, to, not (cond))) #define EXFIND(i, from, to, cond) EXFIND_BASE(EX_REP_LL(i, from, to), cond, i) #define EXFIND_D(i, from, to, cond, def) EXFIND_D_BASE(EX_REP_LL(i, from, to), cond, i, def) #define EXISTS_C(x, coll, cond) EXISTS_BASE(EX_REP_RB(x, coll), cond) #define FORALL_C(x, coll, cond) (not EXISTS_C(x, coll, not (cond))) #define EXFIND_C(x, coll, cond) EXFIND_BASE(EX_REP_RB(x, coll), cond, x) #define EXFIND_D_C(x, coll, cond, def) EXFIND_D_BASE(EX_REP_RB(x, coll), cond, x, def) #define COUNT_BASE(rep_part, cond) ([&](){ ll ret = 0; rep_part if (cond) ret++; return ret; }()) #define COUNT(i, from, to, cond) COUNT_BASE(EX_REP_LL(i, from, to), cond) #define COUNT_C(x, coll, cond) COUNT_BASE(EX_REP_RB(x, coll), cond) #define IMPLIES(a, b) (not (a) or (b)) // ---- end forall.cc // @@ !! LIM -- end mark -- int main(/* int argc, char *argv[] */) { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << setprecision(20); auto solve = [&]() -> bool { ll N; cin >> N; // @InpMVec(N, ((X, type=string), (Y, type=string))) [x0DV6tlY] auto X = vector(N, string()); auto Y = vector(N, string()); for (int i = 0; i < N; i++) { string v1; cin >> v1; X[i] = v1; string v2; cin >> v2; Y[i] = v2; } // @End [x0DV6tlY] ll big = 1e18; ll len_b_1 = 0; ll len_b_a = big; ll stretch_b = big; REP(i, 0, N) { ll szx = ssize(X[i]); ll szy = ssize(Y[i]); if (X[i] == "a") { if (EXISTS(j, 0, szy, Y[i][j] == 'a')) return true; len_b_1 = max(len_b_1, szy); } else if (FORALL(j, 0, szx, X[i][j] == 'b')) { if (EXISTS(j, 0, szy, Y[i][j] == 'a')) len_b_a = min(len_b_a, szx); else stretch_b = min(stretch_b, szx); } } if (len_b_a <= len_b_1) return true; if (stretch_b <= len_b_1) return true; return false; }; ll T; cin >> T; REP(t, 0, T) cout << (solve() ? "Yes\n" : "No\n"); return 0; }