oj.uz

답안 #401549

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
401549 2021-05-10T13:24:50 Z benk Balloons (CEOI11_bal) C++14
10 / 100
 186 ms 7580 KB 
#include "bits/stdc++.h"
using namespace std;

#define all(x)      x.begin(), x.end()
#define pb          push_back
#define sz(x)       (int)(x.size())
#define ll          long long
#define fi          first
#define se          second
#define lbd         lower_bound
#define ubd         upper_bound

const int MOD = 1e9 + 7;
const double eps = 1e-10;
const long long INF = 1e18;
const int N = 2e5 + 10;


void solve() {
	int n;
	cin >> n;
	vector<int> x(n), r(n);
	for (int i = 0; i < n; i++) cin >> x[i] >> r[i];

	vector<pair<int, double>> s;
	for (int i = 0; i < n; i++) {
		ll tmp;
		while (sz(s) >= 2) {
			tmp = 1LL * (x[i] - s.back().fi) * (x[i] - s.back().fi);
			double r1 = (tmp * 4 * s[sz(s) - 2].se);
			1LL * (x[i] - s[sz(s) - 2].fi) * (x[i] - s[sz(s) - 2].fi);
			double r2 = (tmp * 4 * s.back().se);

			if (r1 >= r2) s.pop_back();
			else break;
		}
		if (!s.empty())
			tmp = 1LL * (x[i] - s.back().fi) * (x[i] - s.back().fi);

		double ans;
		if (s.empty()) ans = r[i];
		else ans = min(1.0 * r[i], tmp / (4 * s.back().se));
		cout << fixed << setprecision(10) << ans << '\n';
		s.pb({x[i], ans});
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int tt = 1;
	//cin >> tt;
	while (tt--) {
		solve();
	}
	return 0;
}

Compilation message

bal.cpp: In function 'void solve()':
bal.cpp:31:35: warning: value computed is not used [-Wunused-value]
   31 |    1LL * (x[i] - s[sz(s) - 2].fi) * (x[i] - s[sz(s) - 2].fi);
      |    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB 7th numbers differ - expected: '11.4400000000', found: '81.0000000000', error = '69.5600000000'

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 332 KB 7th numbers differ - expected: '0.0010000000', found: '9.0000000000', error = '8.9990000000'

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 372 KB 3rd numbers differ - expected: '121.0000000000', found: '123.0000000000', error = '2.0000000000'

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 936 KB 3rd numbers differ - expected: '211.0000000000', found: '213.0000000000', error = '2.0000000000'

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 47 ms 2084 KB 5th numbers differ - expected: '15395.0000000000', found: '15396.0000000000', error = '1.0000000000'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 100 ms 4064 KB 3rd numbers differ - expected: '7936.0000000000', found: '10352.0000000000', error = '2416.0000000000'

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 114 ms 4808 KB 5th numbers differ - expected: '5054.0000000000', found: '5055.0000000000', error = '1.0000000000'
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 152 ms 6248 KB 3rd numbers differ - expected: '1872.0000000000', found: '1874.0000000000', error = '2.0000000000'
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 186 ms 7580 KB 3rd numbers differ - expected: '2960.0000000000', found: '2962.0000000000', error = '2.0000000000'
2 Halted 0 ms 0 KB -