oj.uz

Submission #649976

# Submission time Handle Problem Language Result Execution time Memory
649976 2022-10-11T19:13:46 Z ymm Balloons (CEOI11_bal) C++17
100 / 100
 417 ms 2320 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;

typedef long double ld;
typedef pair<ld, ld> pdd;

pdd in()
{
	ll x, y;
	cin >> x >> y;
	return {x, y};
}

const int N = 200'010;
const int S = 8192;

double a[N], b[N];
ld x[N], r[N];
ld x_off = 0;
pdd f[N];
int len = 0;

void insert(pdd f)
{
	::f[len] = f;
	a[len] = f.first;
	b[len] = f.second;
	++len;
}

__attribute__((optimize("Ofast,unroll-loops"),target("avx2")))
double get(double x)
{
	#define MIN(x, y) ((x)>(y)?(y):(x))
	double ans = 1e30;
	Loop (i,0,len) {
		double tmp = a[i]*x + b[i];
		ans = MIN(ans, tmp);
	}
	return ans;
	#undef MIN
}

ld eval(pdd f, ld x)
{
	return f.first * x + f.second;
}

void trim(ld x)
{
	sort(f, f+len);
	reverse(f, f+len);
	int j = 0;
	Loop (i,0,len) {
		while (j && eval(f[j-1], x) >= eval(f[i], x))
			--j;
		f[j++] = f[i];
	}
	len = j;
	Loop (i,0,len) {
		f[i].second = eval(f[i], x);
		a[i] = f[i].first;
		b[i] = f[i].second;
	}
	x_off += x;
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	cout << fixed << setprecision(3);
	int n;
	cin >> n;
	for (int s = 0; s < n; s += S) {
		int f = min(s+S, n);
		Loop (i,s,f) {
			auto [x, r] = in();
			x -= x_off;
			if (i == s || x > 1e7) {
				trim(x);
				x = 0;
			}
			r = sqrt(r);
			r = min(r, (ld)get(x));
			cout << r*r << '\n';
			insert({0.5/r, -x*0.5/r});
		}
	}
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 856 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 132 ms 1364 KB 50000 numbers
2 Correct 107 ms 1028 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 221 ms 1616 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 1928 KB 115362 numbers
2 Correct 240 ms 1448 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 1988 KB 154271 numbers
2 Correct 417 ms 1892 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 2320 KB 200000 numbers
2 Correct 373 ms 1996 KB 199945 numbers