/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 580.0 KiB
#2 Accepted 1ms 384.0 KiB
#3 Accepted 2ms 532.0 KiB
#4 Accepted 2ms 532.0 KiB
#5 Accepted 2ms 532.0 KiB

Code

#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 1000005;

int z, i, n, ok, tab[N], bat[N], diff;
string s1, s2;

int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);

cin >> z;
while(z--) {
	cin >> n >> s1 >> s2;
	for (i=0;i<n;i++) tab[i] = (s1[i] == '1');
	for (i=0;i<n;i++) bat[i] = (s2[i] == '1');
	ok = 0;
	for (i=1;i<n;i++) if (bat[i] != bat[i - 1]) ok = 1;
	diff = 0;
	for (i=0;i<n;i++) if (tab[i] != bat[i]) diff = 1;
	if (ok || !diff) cout << "YES\n"; else cout << "NO\n";
}
return 0;
}

Information

Submit By
Type
Submission
Problem
P1233 B. Make Binary Strings Equal
Contest
Happy New Year 2026
Language
C++17 (G++ 13.2.0)
Submit At
2026-01-06 14:59:04
Judged At
2026-01-06 14:59:05
Judged By
Score
100
Total Time
2ms
Peak Memory
580.0 KiB