Submission #713567

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>

using namespace std;

typedef long long int lli;

//例を手動で解いてみるとかパターンを列挙してみるとか重要

int N,Q;
double r[100], h[100], s[100];
int x[100],a,b;

int main(int argc, char const *argv[])
{
	scanf("%d %d ",&N,&Q);
	for (int i = 0; i < N; i++)
	{
		scanf("%d %lf %lf ",&x[i],&r[i],&h[i]);
		s[i]=(r[i]*r[i]*3.14159265359)*(h[i]/3.0);
	}

	for (int i = 0; i < Q; i++)
	{
		//printf("\n");
		scanf("%d %d ",&a,&b);
		double res=0.0;
		for (int t = 0; t < N; t++)
		{
			if(b<x[t]||x[t]+h[t]<a) continue;
			if(a<=x[t]&&x[t]+h[t]<=b){ res+=s[t]; }
			else if(x[t]<=a&&x[t]+h[t]<=b)
			{
				double ratio=(h[t]-(a-x[t]))/h[t];
				ratio=ratio*ratio*ratio;
				res+=ratio*s[t];
			}
			else if(a<=x[t]&&b<=x[t]+h[t])
			{
				double ratio=(h[t]-(b-x[t]))/h[t];
				ratio=ratio*ratio*ratio;
				res+=s[t]-ratio*s[t];
			}
			else
			{
				double ratio=(h[t]-(a-x[t]))/h[t];
				ratio=ratio*ratio*ratio;
				//printf("%lfaa\n", ratio);
				res+=ratio*s[t];
				ratio=(h[t]-(b-x[t]))/h[t];
				ratio=ratio*ratio*ratio;
				res-=ratio*s[t];
			}
		}
		printf("%.9lf\n", res);
	}
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main(int, const char**)’:
./Main.cpp:23:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d ",&N,&Q);
                       ^
./Main.cpp:26:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %lf %lf ",&x[i],&r[i],&h[i]);
                                         ^
./Main.cpp:33:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d ",&a,&b);
                        ^

Judge Result