oj.uz

Submission #205181

# Submission time Handle Problem Language Result Execution time Memory
205181 2020-02-28T09:03:48 Z ruler Balloons (CEOI11_bal) C++14
100 / 100
 218 ms 9988 KB 
// IOI 2021
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;

////////////////////////////////////////////////////////////////////

const int N = 2e5 + 3;

typedef long double ld;
int X[N];
ld R[N];
stack<int> S;

ld GetRad(int dis, ld r) { return 1LL * dis * dis / r / 4; }

int main() {

	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);	
	
	int n; cin >> n;
	for (int i = 0; i < n; i++) cin >> X[i] >> R[i];
	for (int i = 0; i < n; i++) {
		while (!S.empty()) {
			int l = S.top();
			ld r = GetRad(X[i] - X[l], R[l]);
			if (r < R[i]) R[i] = r;
			if (R[i] > R[l]) S.pop(); else break;
		}
		S.push(i);
		cout << fixed << setprecision(3) << R[i] << endl;
	}

	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 376 KB 2000 numbers

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 888 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 1784 KB 50000 numbers
2 Correct 56 ms 1784 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 3180 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 3704 KB 115362 numbers
2 Correct 122 ms 6008 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 5368 KB 154271 numbers
2 Correct 210 ms 9988 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 218 ms 7032 KB 200000 numbers
2 Correct 213 ms 9844 KB 199945 numbers