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
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
#include<bits/stdc++.h>

using namespace std;

//bool P[(int)2e5+5],D[(int)2e5+5],T[(int)2e5+5];

vector < pair< int,pair< long long,long long> > > P,D,T;
long double dou;
int main(){
ios_base::sync_with_stdio(false);
cin.tie();
cout.tie();

	long long L,v0,v1,v2,v3;cin>>L>>v0>>v1>>v2>>v3;
	v0-=v3;v1-=v3;v2-=v3;
	long long Dr=v2*(v0-v2)*(v1-v2)*(v0-v1)*v0;//nowa jednostka drogi równowazna starej
	long long wyp1=2*Dr/(v0-v2);//czas na wyprzedzanie
	
	
	
	
	//wzgledna odl po czasie
	
	//odl=odl_p-()
	char x='.';cin>>x;
	for(int i=0;i<L;){
		int I=i;
		
		do{
			i++;
			if(i<L)cin>>x;
			else break;
		}while(x=='.');
		P.push_back({1,{I,i-I}});
		//cout<<I<<" "<<i-I<<"\n";
		I=i;if(I==L)break;
		do{
			i++;
			if(i<L)cin>>x;
			else break;
		}while(x=='#');
		P.push_back({2,{I,i-I}});
		//cout<<I<<" "<<i-I<<"n\n";
	}
	cin>>x;
	for(int i=0;i<L;){
		long long I=i;
		
		do{
			i++;
			if(i<L)cin>>x;
			else break;
		}while(x=='.');
		D.push_back({1,{I,i-I}});
		//cout<<I<<" "<<i-I<<"\n";
		I=i;if(I==L)break;
		do{
			i++;
			if(i<L)cin>>x;
			else break;
		}while(x=='#');
		D.push_back({2,{I,i-I}});
	///	cout<<I<<" "<<i-I<<"n\n";
	}
	cin>>x;cin>>x;
	for(int i=1;i<L;){
		int I=i;
		if(x=='.')
		do{
			i++;
			if(i<L)cin>>x;
			else break;
		}while(x=='.');
		T.push_back({1,{I,i-I}});
			//cout<<I<<" "<<i-I<<"\n";
		//cout<<i<<" "<<L<<"\n";
		if(i<L){
			I=i;
			do{
				i++;
				if(i<L)cin>>x;
				else break;
			}while(x=='#');
			T.push_back({2,{I,i-I}});
			//cout<<I<<" "<<i-I<<"n\n";
		}
	}
	if(T[T.size()-1].first==2)T.push_back({1,{L,0}});
	if(D[D.size()-1].first==2)D.push_back({1,{L,0}});
	bool wyl=1;
	int p=1,d=0,t=1;long long CZ=0;
	for(d=0;d<D.size() and wyl;d++){
//		cout<<d<<" "<<D.size()<<" "<<(long double)CZ/Dr<<"\n";
		pair<long long,long long> ds=D[d].second;
		if(d==D.size()-1){//cout<<"czytotu\n";
			int tdf,ddf,pdf;
			if(T[T.size()-1].first==1)tdf=T[T.size()-1].second.first;
			else tdf=L;
			if(D[D.size()-1].first==1)ddf=D[D.size()-1].second.first;
			else ddf=L;
			if(P[P.size()-1].first==1)pdf=P[P.size()-1].second.first;
			else pdf=L;
			
			long double ADD=0;
			
			ADD=max((long double)0,max((long double)((pdf-ddf)*Dr+CZ*(v1-v2))/(v0-v1),(long double)((tdf-ddf)*Dr-CZ*v2)/v0));
			ADD+=CZ;ADD/=Dr;dou=ADD;
			break;
		}
//		cout<<(long double)CZ/Dr<<" pierw "<<ds.second<<"\n";
		CZ+=(ds.second-1)*(Dr/(v0-v2));//cout<<(long double)CZ/Dr<<"\n";
		d++;ds=D[d].second;
		//cout<<P.size()<<"\n";
		while(p<P.size() and ((ds.first-2)-(P[p].second.first+P[p].second.second-1))
			*Dr/(v1-v2)>=CZ){/*cout<<CZ<<" "<<((ds.first-2)-(P[p].second.first+P[p].second.second-1))
			*Dr/(v1-v2);*/
				p+=2;
			}
		long long alt=0;
		if(p<P.size())
		alt=((ds.first+ds.second-1+2)-(P[p].second.first))*Dr/(v1-v2);
		else{
			int tdf,ddf,pdf;
			if(T[T.size()-1].first==1)tdf=T[T.size()-1].second.first;
			else tdf=L;
			
			if(D[D.size()-1].first==1)ddf=D[D.size()-1].second.first;
			else ddf=L;
			/*if(P[P.size()-1].first==1)pdf=P[P.size()-1].second.first;
			else pdf=L-1;*/
			pdf=D[d].second.first-1;
			
			long double ADD=0;
			
			ADD=max((long long)0,max(((ddf-pdf)*Dr)/(v0-v2),((tdf-pdf)*Dr-CZ*v2)/v0));
			
			ADD+=CZ;ADD/=Dr;dou=ADD;
			break;
		}
		
		alt=max(alt,CZ+(ds.second-1+2)*Dr/(v0-v2));
		
//		cout<<(long double)alt/Dr<<"\n";
		
		long long bas=0;
		while(t<T.size() and ((T[t].second.first+T[t].second.second-1)-(ds.first-2))
			*Dr/v2<=CZ)t+=2;
		if(t>=T.size()){
			int tdf,ddf,pdf;
			tdf=D[d].second.first-1;
			/*if(T[T.size()-1].first==1)tdf=T[T.size()-1].second.first;
			else tdf=L;*/
//			cout<<tdf<<"\n";
			if(D[D.size()-1].first==1)ddf=D[D.size()-1].second.first;
			else ddf=L;
//			cout<<ddf<<"\n";
			if(P[P.size()-1].first==1)pdf=P[P.size()-1].second.first;
			else pdf=L;
//			cout<<pdf<<"\n";
			
			long double ADD=0;
			//cout<<"jestestu"<<(long double)CZ/Dr<<"\n";
//			cout<<(long double)((pdf-tdf)*Dr+CZ*v1)/Dr<<"\n";
//			cout<<((long double)((pdf-tdf)*Dr+CZ*(v1-v2))/(v0-v1))/Dr<<"\n";
			ADD=max((long double)0,max((long double)((pdf-tdf)*Dr+CZ*(v1-v2))/(v0-v1),(long double)(long double)((ddf-tdf)*Dr)/(v0-v2)));
			ADD+=CZ;ADD/=Dr;dou=ADD;
			break;
		}
		
		long long odlod=(ds.second+2)*Dr+v2*(ds.second-1+2)*Dr/(v0-v2);
		long long codl=(ds.second-1+2)*Dr/(v0-v2);
		long long cz=CZ;
		
		bas=((T[t].second.first)-(ds.first+ds.second-1+2))*Dr/v2;
		bool udalo=0;
		if(bas>=cz+codl)CZ=cz+codl;
		else{
			//cout<<"halon\n";
			cz=((T[t].second.first+T[t].second.second-1)-(ds.first-2))*Dr/v2;
			//cout<<(long double)cz/Dr<<" "<<(long double)codl/Dr<<"nh\n";
			while(cz+codl<alt){
				t++;
				if(t>=T.size()-1 or T[t].second.second*Dr>=odlod){
					CZ=cz+codl;udalo=1;t++;
					if(t==T.size()-1){CZ-=codl;
						int tdf,ddf,pdf;
						//cout<<"holo";
						tdf=D[d].second.first-1;
						/*if(T[T.size()-1].first==1)tdf=T[T.size()-1].second.first;
						else tdf=L;*/
			//			cout<<tdf<<"\n";
						if(D[D.size()-1].first==1)ddf=D[D.size()-1].second.first;
						else ddf=L;
			//			cout<<ddf<<"\n";
						if(P[P.size()-1].first==1)pdf=P[P.size()-1].second.first;
						else pdf=L;
			//			cout<<pdf<<"\n";
						
						long double ADD=0;
						//cout<<"jestestu"<<(long double)CZ/Dr<<"\n";
			//			cout<<(long double)((pdf-tdf)*Dr+CZ*v1)/Dr<<"\n";
			//			cout<<((long double)((pdf-tdf)*Dr+CZ*(v1-v2))/(v0-v1))/Dr<<"\n";
						ADD=max((long double)0,max((long double)((pdf-tdf)*Dr+CZ*(v1-v2))/(v0-v1),(long double)(long double)((ddf-tdf)*Dr)/(v0-v2)));
						ADD+=CZ;ADD/=Dr;dou=ADD;
						wyl=0;
						break;
					}
					break;
				}
				else{
					t++;
					cz=((T[t].second.first+T[t].second.second-1)-(ds.first-2))*Dr/v2;
				}
			}
			if(!udalo){
				CZ=alt;//cout<<"ejo\n";
			}
		}
	}
	cout<<setprecision(10)<<dou;
return 0;
}