-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2233.cpp
58 lines (43 loc) · 867 Bytes
/
2233.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
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
int xxxx[]={-1,0,1,0};
int yyyy[]={0,1,0,-1};
int N;
string str;
int a,b;
int x;
int l,r;
int dfs() {
int s = x++;
int check = 0;
if (s == a) check++;
if (s == b) check++;
while (str[x] != '1') check += dfs();
check += (x==a) + (x==b);
x++;
int e = x;
if (check == 2) {
if (l == 0 && r == 0) {
l = s+1;
r = e;
}
}
return check;
}
void solve(){
cin >> N >> str >> a >> b;
a--,b--;
dfs();
cout << l << ' ' << r;
}
int main()
{
cin.tie(0)->sync_with_stdio(false);
solve();
return 0;
}