-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathBinary Removals.cpp
66 lines (59 loc) · 1.69 KB
/
Binary Removals.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
// https://codeforces.com/contest/1499/problem/B
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ll long long
#define pll pair<long, long>
#define vll vector<long long>
#define inf 1e18
#define range(a,b) substr(a,b-a+1)
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
using namespace std;
int main()
{
FIO;
#ifndef ONLINE_JUDGE
//remove this piece of code when this has to be submitted in kickstart
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
//freopen is used to associate a file with stdin or stdout stream in C++
#endif
ll t;
cin >> t;
while (t--) {
string s;
cin >> s;
ll i = 0;
while (i < s.size() && s[i] == '0') {
i++;
}
if (i == s.size())
cout << "YES\n";
else {
ll co1 = 0;
bool flag = true;
while ((i + 1) < s.size()) {
flag = true;
if (s[i] == '1' && s[i + 1] == '1') {
co1++;
ll j = i;
while ((j + 1) < s.size()) {
if (s[j] == '0' && s[j + 1] == '0')
flag = false;
j++;
}
}
if (!flag)
break;
i++;
}
if (flag)
cout << "YES\n";
else
cout << "NO\n";
}
}
return 0;
}