Sunlight

#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;

ll x[201010];
ll h[201010];
int pred[201010],foll[201010];
const ld PI=atan2(0,-1);

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin>>n;
	for (int i=0;i<n;i++) cin>>x[i]>>h[i];
	pred[0]=-1;
	for (int i=1;i<n;i++) {
		pred[i]=i-1;
		while (pred[pred[i]]!=-1 && 
			(h[i]-h[pred[i]])*(x[pred[i]]-x[pred[pred[i]]]) - (x[i]-x[pred[i]])*(h[pred[i]]-h[pred[pred[i]]]) >= 0) {
			pred[i]=pred[pred[i]];
		}
		if (h[i]>=h[pred[i]]) pred[i]=-1;
	}
	foll[n-1]=-1;
	for (int i=n-2;i>=0;i--) {
		foll[i]=i+1;
		while (foll[foll[i]]!=-1 && 
			(h[i]-h[foll[i]])*(x[foll[i]]-x[foll[foll[i]]]) - (x[i]-x[foll[i]])*(h[foll[i]]-h[foll[foll[i]]]) <= 0) {
			foll[i]=foll[foll[i]];
		}
		if (h[i]>=h[foll[i]]) foll[i]=-1;
	}
	cout<<setprecision(15);
	for (int i=0;i<n;i++) {
		ld res=0;
		res+=6;
		if (pred[i]!=-1) {
			res-=(atan((ld)(h[pred[i]]-h[i])/(ld)(x[i]-x[pred[i]]))*12)/PI;
		}
		res+=6;
		if (foll[i]!=-1) {
			res-=(atan((ld)(h[foll[i]]-h[i])/(ld)(x[foll[i]]-x[i]))*12)/PI;
		}
		cout<<res<<"\n";
	}
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED