Advertisement
Guest User

Untitled

a guest
May 21st, 2019
94
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.06 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. struct dd
  4. {
  5. int x;
  6. double viteza;
  7. };
  8. dd v[10005];
  9. const double eps=1.e-14;
  10. bool cmp(double a ,double b)
  11. {
  12. if(a-b<=eps)return 1;
  13. return 0;
  14. }
  15. double timp[10005];
  16. double r;
  17. double sol(dd a,dd b)
  18. {
  19. if(fabs(a.x-b.x)<=2*r)
  20. {
  21. return 0;
  22. }
  23. if(b.x-a.x<=-eps)
  24. {
  25. dd m;
  26. m=a;
  27. a=b;
  28. b=m;
  29. }
  30. if(b.x-a.x>=eps)
  31. {
  32. if(b.viteza>0&&a.viteza<0)return 0;
  33. if(b.viteza>0&&b.viteza-a.viteza>0)return 0;
  34. if(b.viteza<0&&a.viteza<0&&b.viteza-a.viteza<0)return 0;
  35. return 1.0*(b.x-a.x-2*r)/(a.viteza-b.viteza);
  36.  
  37. }
  38. }
  39. int main()
  40. {
  41. freopen("bomba.in","r",stdin);
  42. freopen("bomba.out","w",stdout);
  43. int n;
  44. int i,j;
  45. scanf("%d%lf",&n,&r);
  46. for(i=1;i<=n;i++)
  47. scanf("%d%lf",&v[i].x,&v[i].viteza);
  48. int cnt=0;
  49. for(i=1;i<=n;i++)
  50. for(j=i+1;j<=n;j++)
  51. timp[++cnt]=sol(v[i],v[j]);
  52. for(i=1;i<=cnt;i++)
  53. printf("%lf\n",timp[i]);
  54. return 0;
  55. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement