Advertisement
Farjana_akter

Untitled

Apr 1st, 2020
147
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.09 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3.  
  4.  
  5. int main()
  6. {
  7. int n,i,j,k,t,cas,cnt=0,a,b,c,d,e;
  8. cin>>t;
  9. for(cas=0;cas<t;cas++)
  10. {
  11. if(cas)
  12. cout<<endl;
  13. cin>>n;
  14. double x1[n+5],x2[n+5],y1,y2,co[n+5],mx,mn,save[2*n+5];
  15. int ind=0;
  16. for(i=0;i<n;i++)
  17. {
  18. cin>>x1[i]>>y1>>x2[i]>>y2>>co[i];
  19. mx=max(x1[i],x2[i]);
  20. mn=min(x1[i],x2[i]);
  21. x1[i]=mn,x2[i]=mx;
  22. save[ind++]=mx;
  23. save[ind++]=mn;
  24. }
  25. sort(save,save+ind);
  26.  
  27. cout<<ind+1<<endl;
  28. printf("-inf %.3lf 1.000\n",save[0]);
  29. double coefficient=1.0;
  30. for(i=1;i<ind;i++)
  31. {
  32. coefficient=1.0;
  33. printf("%.3lf %.3lf ",save[i-1],save[i]);
  34. for(j=0;j<n;j++)
  35. {
  36. if(x1[j]<=save[i-1] && save[i]<=x2[j])
  37. coefficient*=co[j];
  38. }
  39. printf("%.3lf\n",coefficient);
  40. }
  41. printf("%.3lf +inf 1.000\n",save[ind-1]);
  42. }
  43. return 0;
  44. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement