oj.uz

Submission #974142

# Submission time Handle Problem Language Result Execution time Memory
974142 2024-05-02T22:47:37 Z AksLolCoding Balloons (CEOI11_bal) C++17
100 / 100
 143 ms 5596 KB 
#include <bits/stdc++.h>
using namespace std;

using ld = long double;
using ld2 = array<ld, 2>;

ld rad(ld2 prev, ld x) {
	return ((prev[0]-x)*(prev[0]-x)/(4*prev[1]));
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;

	// solve
	stack<ld2> check;
	while (n--) {
		ld x, r;
		cin >> x >> r;

		while (!check.empty()) {
			ld2 prev = check.top();
			ld to_prev = rad(prev, x);
			r = min(r, to_prev);
			if (r >= prev[1]) check.pop();
			else break;
		}

		check.push({x, r});

		printf("%.3Lf\n", r);
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB 10 numbers

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB 2 numbers

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB 505 numbers

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 856 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 1844 KB 50000 numbers
2 Correct 37 ms 1860 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 2820 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 3360 KB 115362 numbers
2 Correct 75 ms 3552 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 4176 KB 154271 numbers
2 Correct 125 ms 5596 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 4688 KB 200000 numbers
2 Correct 143 ms 5500 KB 199945 numbers