Submission #714176

---

Source Code Expand

 #include <string>
 #include <vector>
 #include <algorithm>
 #include <numeric>
 #include <set>
 #include <map>
 #include <queue>
 #include <iostream>
 #include <sstream>
 #include <cstdio>
 #include <cstdlib>
 #include <cmath>
 #include <ctime>
 #include <cstring>
 #include <cctype>
 #include <cassert>
 #include <limits>
#define rep(i,n) for(long long (i)=0;(i)<(long long)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define PB push_back
using namespace std;
typedef vector<long long> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll; typedef map<int, int> mii;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }
double volume(double r, double h) {
  return r*r*h*M_PI/3.0;
}

double cut(double x, double r, double h, double a, double b){
  if (x+h <= a || x >= b) {
    return 0;
  }
  if (x >= a&&x+h<=b) {
    return volume(r,h);
  }
  double vol = 0;
  if (x>=a) {
    vol += volume(r,h);
  } else {
    vol += volume(r*(x+h-a)/h,x+h-a);
  }
  if (x+h >= b) {
    vol -= volume(r*(x+h-b)/h,x+h-b);
  }
  return vol;
}
int main(){
  int n,q;
  cin >> n >> q;
  double x[n];
  double r[n];
  double h[n];
  rep (i,n) {
    cin >> x[i] >> r[i] >> h[i];
    }
  rep (i, q) {
    double a,b,ans=0.0;
    cin >> a >> b;
    rep(j,n) {
      ans+=cut(x[j],r[j],h[j],a,b);
    }
    printf("%.6f\n", ans);
  }
  return 0;
}

Submission Info

Judge Result