Submission #713243


Source Code Expand

#include <iostream>
#include <vector>
#include <cmath>
#include <cstdio>

using namespace std;

double v[20000];

int main() {
	int N, Q;
	
	cin >> N >> Q;
	for (int i = 0; i < N; ++i) {
		int x, r, h;
		cin >> x >> r >> h;
		
		for (int j = 0; j < h; ++j) {
			double h1 = h - j, r1 = h1 * r / h;
			double h2 = h - j - 1, r2 = h2 * r / h;
			
			v[x + j] = M_PI * (r1 * r1 * h1 - r2 * r2 * h2) / 3.0;
		}
	}
	
	for (int i = 0; i < Q; ++i) {
		int a, b;
		cin >> a >> b;
		
		bool f = false;
		double V = 0;
		for (int j = a; j < b; ++j) {
			if (!f && v[j] > 0) {
				f = true;
				V += v[j];
			}
			else if (v[j] > 0) {
				V += v[j];
			}
			else break;
		}
		
		
		printf("%.6f\n", V);
	}
	
	return 0;
}

Submission Info

Submission Time
Task B - 円錐
User nahcnuj
Language C++14 (GCC 5.4.1)
Score 0
Code Size 756 Byte
Status WA
Exec Time 8 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 0 / 100
Status
WA × 2
WA × 41
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt
Case Name Status Exec Time Memory
sample_01.txt WA 4 ms 256 KB
sample_02.txt WA 4 ms 256 KB
subtask1_01.txt WA 7 ms 256 KB
subtask1_02.txt WA 6 ms 256 KB
subtask1_03.txt WA 7 ms 256 KB
subtask1_04.txt WA 6 ms 256 KB
subtask1_05.txt WA 4 ms 256 KB
subtask1_06.txt WA 6 ms 256 KB
subtask1_07.txt WA 5 ms 256 KB
subtask1_08.txt WA 4 ms 256 KB
subtask1_09.txt WA 5 ms 256 KB
subtask1_10.txt WA 5 ms 256 KB
subtask1_11.txt WA 6 ms 256 KB
subtask1_12.txt WA 7 ms 256 KB
subtask1_13.txt WA 6 ms 256 KB
subtask1_14.txt WA 5 ms 256 KB
subtask1_15.txt WA 7 ms 256 KB
subtask1_16.txt WA 7 ms 256 KB
subtask1_17.txt WA 8 ms 256 KB
subtask1_18.txt WA 7 ms 256 KB
subtask1_19.txt WA 7 ms 256 KB
subtask1_20.txt WA 7 ms 256 KB
subtask1_21.txt WA 7 ms 256 KB
subtask1_22.txt WA 7 ms 256 KB
subtask1_23.txt WA 7 ms 256 KB
subtask1_24.txt WA 7 ms 256 KB
subtask1_25.txt WA 7 ms 256 KB
subtask1_26.txt WA 7 ms 256 KB
subtask1_27.txt WA 7 ms 256 KB
subtask1_28.txt WA 7 ms 256 KB
subtask1_29.txt WA 7 ms 256 KB
subtask1_30.txt WA 7 ms 256 KB
subtask1_31.txt WA 7 ms 256 KB
subtask1_32.txt WA 7 ms 256 KB
subtask1_33.txt WA 7 ms 256 KB
subtask1_34.txt WA 7 ms 256 KB
subtask1_35.txt WA 7 ms 256 KB
subtask1_36.txt WA 7 ms 256 KB
subtask1_37.txt WA 7 ms 256 KB
subtask1_38.txt WA 7 ms 256 KB
subtask1_39.txt WA 7 ms 256 KB