#include #define int long long #define all(v) v.begin(),v.end() #define rall(v) v.rbegin(),v.rend() bool st; using namespace std; templateistream&operator>>(istream&I,vector&v){for(auto&i:v)I>>i;return I;} templateostream&operator<<(ostream&O,vector v){for(auto i:v)O<v[3]; int ret; void solve(){ string s; cin>>n; for(int i=0;i>p[i]>>a[i]>>b[i]; v[p[i]].push_back((long double)1.0*a[i]/(a[i]+b[i])); } for(int i=0;i<3;i++)sort(all(v[i])); int ret=n+1; for(auto&r:v[0]){ for(auto&r2:v[1])if(r+r2>1+eps)ret++; for(auto&r2:v[2])if(r+r2>1+eps)ret++; } for(auto&r:v[1])for(auto&r2:v[2])if(r+r2>1+eps)ret++; for(auto&r:v[0])for(auto&r2:v[1]){ if(r+r2<1-eps)continue; long double hoge=1-min(r,r2); ret+=v[2].end()-lower_bound(all(v[2]),hoge-eps); hoge=2-(r+r2); ret-=lower_bound(all(v[2]),hoge+eps)-lower_bound(all(v[2]),hoge-eps); } cout<>t; while(t--)AC::solve(); chrono::steady_clock::time_point ED=chrono::steady_clock::now(); cerr<(ED-St).count()<<" \tms\n"<<"Real Time : "<(ED-ST).count()<<" \tms\n"<<" : "<(ED-ST).count()<<" \t?s\n\n"<<"Total Memory : "<