oj.uz

답안 #203065

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
203065 2020-02-19T07:41:13 Z Neklixx Balloons (CEOI11_bal) C++14
0 / 100
 2000 ms 35180 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
const double INF = 1e11 + 228;
const int MAXN = 2e5 + 228;
double ans[MAXN];

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));
} 

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;
		int id = 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[s.size() - id - 1];
			double cl = (to.S * to.S) / (4 * to.F) + (v[i].F * v[i].F) / (4 * to.F) - (2 * v[i].F * to.S) / (4 * to.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 && intersect1(s[s.size() - 2].S, (double)v[i].F, sqrt(s[s.size() - 2].F), sqrt(now)) <= intersect1(s.back().S, (double)v[i].F, sqrt(s.back().F), sqrt(now))) {
			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, sqrt(s.back().F), sqrt(now)));
		}
		//print1("ok");
		s.pb({now, (double)v[i].F});
	}

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

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 376 KB Expected double, but "{" found

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 376 KB Expected double, but "{" found

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 376 KB Expected double, but "{" found

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 41 ms 760 KB Expected double, but "{" found

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 396 ms 6644 KB Expected double, but "{" found

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1402 ms 21688 KB Expected double, but "{" found
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1910 ms 31944 KB Expected double, but "{" found

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2101 ms 35180 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2069 ms 35060 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2063 ms 33120 KB Time limit exceeded
2 Halted 0 ms 0 KB -