oj.uz

답안 #203131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
203131 2020-02-19T13:00:27 Z Neklixx Balloons (CEOI11_bal) C++14
70 / 100
 1547 ms 8980 KB 
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define sh cin.tie(0); cin.sync_with_stdio(0); cout.tie(0);
#define FILE freopen("test.in", "r", stdin);
#define vprint(v) for (int ii = 0; ii < v.size(); ii++){cout << v[ii] << " ";}
#define debugv(v) if (v.size() != 0) {cout << "[ "; for (int __ = 0; __ < (int)(v.size()) - 1; __++){cout << v[__] << ", ";} cout << v[(int)(v.size()) - 1] << " ]" << endl;} else {cout << "[]" << endl;}
#define debug cout << "-----------------------------------------------" << endl;
#define print1(a) cout << "{ " << a << " }" << endl;
#define print2(a, b) cout << "{ " << a << ", " << b << " }" << endl;
#define print3(a, b, c) cout << "{ " << a << ", " << b << ", " << c << " }" << endl;
#define print4(a, b, c, d) cout << "{ " << a << ", " << b << ", " << c << ", " << d << " }" << endl;
using namespace std;
#define int long long
#define double long double
const double INF = 1e11 + 228;
const int MAXN = 2e5 + 228;
double ans[MAXN];
const double eps = 1e-15;
const double eps2 = 0;
double intersect1(double x1, double x2, double t1, double t2) {
	//print4(x1, x2, t1, (((x2 / (2 * t2)) - (x1 / (2 * t1))) * 2 * t1 * t2) / (t1 - t2));
	return ((((x2 / (2 * t2)) - (x1 / (2 * t1))) * 2 * t1 * t2) / (t1 - t2));
} 

double get(pair<double, double> to, double h) {
	return (to.S * to.S + h * h - 2.0 * h * to.S) / (4 * to.F);// + (h * h) / (4 * to.F) - (2 * h * to.S) / (4 * to.F);
}

double sqr(double x) {
	double l = 0, r = 1e9 + 1;
	while (r - l > eps) {
		double mid = (l + r) / 2;
		if (mid * mid > x) {
			r = mid;
		} else {
			l = mid;
		}
	}
	return l;
}

signed main()
{
#ifdef LOCAL
    FILE;
#endif
    sh;
	int n;
	cin >> n;
	vector<pair<int, int>> v;
	for (int i = 0; i < n; i++) {
		int aa, bb;
		cin >> aa >> bb;
		v.pb({aa, bb});
	}    

	vector<pair<double, double>> s;
	vector<double> x1;
	for (int i = 0; i < n; i++) {
		double now = v[i].S;
		//print1(i);
		while (x1.size() > 0 && x1.back() < (double)v[i].F) {
			x1.pop_back();
			s.pop_back();
		}
		int id = x1.size();//upper_bound(all(x1), (double)v[i].F) - x1.begin();
		//print2(i, id);
		/*for (auto oo : s) {
			cout << oo.S << ' ';
		}
		cout << endl;*/
		if (s.size() > 0) {
			assert((int)(s.size()) - id - 1 >= 0);
			//print4("t", s.size(), id, x1.size());
			pair<double, double> to = s[id];
			double cl = get(to, v[i].F);
			now = min(now, cl);
		}
		while (s.size() > 0 && s.back().F <= now) {
			s.pop_back();
		}
		while (x1.size() + 1 > s.size() && s.size() != 0) {
			x1.pop_back();
		}
		if (s.size() == 0) {
			x1.clear();
		}
		while (s.size() >= 2 && get(s.back(), intersect1(s.back().S, (double)v[i].F, sqr(s.back().F), sqr(now))) >= get(s[s.size() - 2], intersect1(s.back().S, (double)v[i].F, sqr(s.back().F), sqr(now))) /*intersect1(s[s.size() - 2].S, s.back().S, sqr(s[s.size() - 2].F), sqr(s.back().F))*/) {
			s.pop_back();
			x1.pop_back();
		}
		ans[i] = now;
		//print1(now);
		if (s.size() > 0) {
			x1.pb(intersect1(s.back().S, (double)v[i].F, sqr(s.back().F), sqr(now)));
		}
		//print1("ok");
		s.pb({now, (double)v[i].F});
	}

	for (int i = 0; i < n; i++) {
		cout << fixed << setprecision(5) << ans[i] << '\n';
	}
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB 10 numbers

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB 2 numbers

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 376 KB 505 numbers

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 508 KB 2000 numbers

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 1268 KB 20000 numbers

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 372 ms 2672 KB 39228th numbers differ - expected: '2.9510000000', found: '10.0000000000', error = '7.0490000000'
2 Halted 0 ms 0 KB -

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 870 ms 4688 KB 100000 numbers

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1030 ms 5328 KB 98002nd numbers differ - expected: '2.4520000000', found: '5.0000000000', error = '2.5480000000'
2 Halted 0 ms 0 KB -

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1480 ms 7056 KB 154271 numbers
2 Correct 1369 ms 8672 KB 200000 numbers

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1547 ms 8980 KB 14611th numbers differ - expected: '3.3740000000', found: '9.0000000000', error = '5.6260000000'
2 Halted 0 ms 0 KB -