oj.uz

Submission #399541

# Submission time Handle Problem Language Result Execution time Memory
399541 2021-05-06T02:57:58 Z Trunkty Balloons (CEOI11_bal) C++14
100 / 100
 739 ms 5476 KB 
#include <iostream>
#include <stack>
#include <utility>
#include <iomanip>
using namespace std;
int n;
stack<pair<double,double>> stk;

int main(){
	cin >> n;
	cout << fixed << setprecision(3);
	for(int i=1;i<=n;i++){
		double x,r;
		cin >> x >> r;
		while(stk.size()>0){
			double x2=stk.top().first,r2=stk.top().second;
			r = min(r,(x2-x)*(x2-x)/4/r2);
			if(r<r2){
				break;
			}
			else{
				stk.pop();
			}
		}
		stk.push({x,r});
		cout << r << "\n";
	}
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 340 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 588 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 1508 KB 50000 numbers
2 Correct 192 ms 1604 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 374 ms 2704 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 428 ms 3132 KB 115362 numbers
2 Correct 444 ms 3384 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 582 ms 3960 KB 154271 numbers
2 Correct 739 ms 5440 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 709 ms 4524 KB 200000 numbers
2 Correct 737 ms 5476 KB 199945 numbers