Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int n,i,j,k,t,cas,cnt=0,a,b,c,d,e;
- cin>>t;
- for(cas=0;cas<t;cas++)
- {
- if(cas)
- cout<<endl;
- cin>>n;
- double x1[n+5],x2[n+5],y1,y2,co[n+5],mx,mn,save[2*n+5];
- int ind=0;
- for(i=0;i<n;i++)
- {
- cin>>x1[i]>>y1>>x2[i]>>y2>>co[i];
- mx=max(x1[i],x2[i]);
- mn=min(x1[i],x2[i]);
- x1[i]=mn,x2[i]=mx;
- save[ind++]=mx;
- save[ind++]=mn;
- }
- sort(save,save+ind);
- cout<<ind+1<<endl;
- printf("-inf %.3lf 1.000\n",save[0]);
- double coefficient=1.0;
- for(i=1;i<ind;i++)
- {
- coefficient=1.0;
- printf("%.3lf %.3lf ",save[i-1],save[i]);
- for(j=0;j<n;j++)
- {
- if(x1[j]<=save[i-1] && save[i]<=x2[j])
- coefficient*=co[j];
- }
- printf("%.3lf\n",coefficient);
- }
- printf("%.3lf +inf 1.000\n",save[ind-1]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement