結果
問題 | No.2629 A replace B replace C |
ユーザー |
|
提出日時 | 2024-02-16 23:27:07 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 2,675 bytes |
コンパイル時間 | 1,795 ms |
コンパイル使用メモリ | 168,756 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-09-28 22:16:52 |
合計ジャッジ時間 | 3,786 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 61 |
ソースコード
#include<bits/stdc++.h> using namespace std; using ll = long long; using pll = pair<ll, ll>; #define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i) #define rep(i, n) drep(i, 0, n - 1) #define all(a) (a).begin(), (a).end() #define pb push_back #define fi first #define se second mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); const ll MOD1000000007 = 1000000007; const ll MOD998244353 = 998244353; const ll MOD[3] = {999727999, 1070777777, 1000000007}; const ll LINF = 1LL << 60LL; const int IINF = (1 << 30) - 1; template<typename T> struct edge{ int from, to; T cost; int id; edge(){} edge(int to, T cost=1) : from(-1), to(to), cost(cost){} edge(int to, T cost, int id) : from(-1), to(to), cost(cost), id(id){} edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id){} }; template<typename T> struct redge{ int from, to; T cap, cost; int rev; redge(int to, T cap, T cost=(T)(1)) : from(-1), to(to), cap(cap), cost(cost){} redge(int to, T cap, T cost, int rev) : from(-1), to(to), cap(cap), cost(cost), rev(rev){} }; template<typename T> using Edges = vector<edge<T>>; template<typename T> using weighted_graph = vector<Edges<T>>; template<typename T> using tree = vector<Edges<T>>; using unweighted_graph = vector<vector<int>>; template<typename T> using residual_graph = vector<vector<redge<T>>>; struct union_find{ vector<int> par; vector<int> siz; union_find(int n) : par(n), siz(n, 1){ for(int i=0; i<n; i++) par[i] = i; } int root(int x){ if (par[x] == x) return x; return par[x] = root(par[x]); } void unite(int x, int y){ int rx = root(x); int ry = root(y); if (rx == ry) return; if (siz[rx] < siz[ry]) swap(rx, ry); siz[rx] += siz[ry]; par[ry] = rx; } bool same(int x, int y){ int rx = root(x); int ry = root(y); return rx == ry; } int size(int x){ return siz[root(x)]; } }; void solve(){ int n; cin >> n; string s, t; cin >> s >> t; int ac=0, ab=0, bc=0; for(int i=0; i<n; i++){ if(s[i]>t[i]){ cout << "No\n"; return; } if(s[i]=='A'&&t[i]=='C'){ ac++; } if(s[i]=='A'&&t[i]=='B'){ ab++; } if(s[i]=='B'&&t[i]=='C'){ bc++; } } while(ac){ if(bc==0){ cout << "No\n"; return; } ac--; } while(ab){ if(bc==0){ cout << "No\n"; return; } ab--; bc--; } if(bc>0){ cout << "No\n"; return; } cout << "Yes\n"; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int T=1; //cin >> T; while(T--) solve(); }