Pagini recente » Cod sursa (job #788432) | Cod sursa (job #792323) | Cod sursa (job #1669219) | Cod sursa (job #1418769) | Cod sursa (job #1867494)
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
using namespace std;
#define x first
#define y second
#define NMAX 2005
int t1,t2,x1,x2,p,d,s,ok;
inline int modul(int val){
return (val < 0 ? -val : val);
}
int main (){
scanf("%d%d%d",&s,&x1,&x2);
scanf("%d%d%d%d",&t1,&t2,&p,&d);
int ans1 = t2 * modul(x1 - x2), ans2 = 0;
if(p == x1)
ok = 1;
if(p == s)
d = -1;
else if(p == 0)
d = 1;
for(int i = 1; i <= 4 * s; i++){
p += d;
if(p == s)
d = -1;
else if(p == 0)
d = 1;
ans2 += t1;
if(p == x1)
ok = 1;
if(p == x2 && ok)
break;
}
printf("%d\n", min(ans1, ans2));
return 0;
}