oj.uz

Submission #287449

# Submission time Handle Problem Language Result Execution time Memory
287449 2020-08-31T17:07:00 Z Namnamseo Balloons (CEOI11_bal) C++17
100 / 100
 201 ms 5880 KB 
#include <bits/stdc++.h>
using namespace std;
#define sz(v) ((int)((v).size()))
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define coord_comp(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define v_index(v, x) (lower_bound(all(v),x)-(v).begin())
typedef pair<int,int> pp;
typedef long long ll;
void read(int& x){ scanf("%d",&x); }
void read(ll& x){ scanf("%lld",&x); }
template<typename T1,typename T2>
void read(pair<T1,T2>& p){ read(p.first); read(p.second); }
template<typename T,typename... Args>
void read(T&a,Args&...b){ read(a); read(b...); }

#define double long double

typedef pair<double, double> line;

double cross(line a,line b){
	return (a.second-b.second) / (b.first-a.first);
}

line l[200010];
int top;

bool parallel(line& a,line& b){
	return abs(a.first - b.first) < 1e-14;
}

void addLine(double grad,double yint){
	line c(grad, yint);
	while(top>=1){
		if(parallel(l[top-1], c)){
			if(l[top-1].second < yint) return;
			--top;
			continue;
		}
		if(l[top-1].first > grad){
			--top;
			continue;
		}
		if(top == 1) break;
		double a=cross(l[top-2], l[top-1]);
		double b=cross(l[top-1], c);
		if(b<a) break;
		--top;
	}
	l[top++]=c;
}

double fx(line a,double x){
	return a.first*x+a.second;
}

double findY(double x){
	if(top<=2){
		double ret=1e300;
		for(int i=0; i<top; ++i){
			ret=min(ret, fx(l[i], x));
		}
		return ret;
	}
	int lf=0, r=top-2, mid;
	if(x >= cross(l[lf], l[lf+1])){
		return fx(l[lf],x);
	}
	if(cross(l[r], l[r+1])>=x){
		return fx(l[r+1], x);
	}
	while(lf+1 < r){
		mid=(lf+r)/2;
		if(cross(l[mid], l[mid+1]) >= x) lf=mid;
		else r=mid;
	}
	return min(fx(l[lf],x), fx(l[r],x));
}

double square(double x){ return x*x; }

int main(){
	int n;
	read(n);

	for(int i=1; i<=n; ++i){
		int x, r;
		read(x, r);
		double myr = min((double)r, square(findY(x)));
		addLine(sqrt(1.0 / myr)/2.0, -x*sqrt(1.0 / myr)/2.0);
		printf("%.5Lf\n" ,myr);
	}
	
	return 0;
}

Compilation message

bal.cpp: In function 'void read(int&)':
bal.cpp:10:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 | void read(int& x){ scanf("%d",&x); }
      |                    ~~~~~^~~~~~~~~
bal.cpp: In function 'void read(ll&)':
bal.cpp:11:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 | void read(ll& x){ scanf("%lld",&x); }
      |                   ~~~~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 768 KB 20000 numbers

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 1528 KB 50000 numbers
2 Correct 59 ms 1656 KB 49912 numbers

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 2808 KB 100000 numbers

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 3320 KB 115362 numbers
2 Correct 123 ms 3708 KB 119971 numbers

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 4344 KB 154271 numbers
2 Correct 167 ms 5880 KB 200000 numbers

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 5116 KB 200000 numbers
2 Correct 174 ms 5880 KB 199945 numbers