Accepted
Code
#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n; cin >> n;
string s, t; cin >> s >> t;
bool ok = 1;
char pre = min(s[0], t[0]);
// cerr << pre << '\n';
for (int i = 1; i < n; i++) {
char curMin= min(s[i], t[i]);
char curMax = max(s[i], t[i]);
// cerr << curMax << ' ' << curMin << ' ' << pre << '\n';
if (curMin >= pre) {
pre = curMin;
continue;
}else if (curMax >= pre) {
pre = curMax;
continue;
}
ok = 0;
}
cout << ((ok) ? "Yes\n" : "No\n");
}
signed main() {
int tt; cin >> tt;
while (tt--)
solve();
}
Information
- Submit By
- Type
- Submission
- Problem
- P1117 String Sorted
- Contest
- LU IUJPC : Sylhet Division 2024, Mock Round
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2024-12-07 10:25:41
- Judged At
- 2024-12-07 10:25:41
- Judged By
- Score
- 100
- Total Time
- 20ms
- Peak Memory
- 932.0 KiB