Submission #6346268

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using ld = long double;
using pii = pair<int,int>;
#define f(i,a,b) for (int i = a; i < b; i++)
#define fr(i,a,b) for (int i = b-1; i >= a; i--)
#define Max(a,b) a=max(a,b)
#define IN(i,a,b) (a<=i&&i<=b)
#define pb push_back

const int mxn = 3e5;

struct BIT {
	int tree[mxn];
	BIT() { f(i,0,mxn) tree[i] = 0; }
	void add(int i, int v) {
		for (; i<mxn; i|=i+1)
			Max(tree[i],v);
	}
	int sum(int i) {
		int ans = 0;
		for (; i >= 0; i = (i&(i+1))-1) {
			Max(ans,tree[i]);
		}
		return ans;
	}
		
};

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
#ifdef LOCAL
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	clock_t start = clock();
#endif

	int x1,x2,y1,y2,n;
	cin>>x1>>y1>>x2>>y2>>n;
	vector<pii> points;
	f(i,0,n) {
		int x,y; cin>>x>>y;
		if ((IN(x,x1,x2)||IN(x,x2,x1))&&
			(IN(y,y1,y2)||IN(y,y2,y1)))
				points.pb({x,y});
	}
	n = points.size();
	if (x1>x2) {
		x1 *= -1; x2 *= -1;
		f(i,0,n) points[i].first *= -1;
	}
	if (y1>y2) {
		y1 *= -1; y2 *= -1;
		f(i,0,n) points[i].second *= -1;
	}
	sort(begin(points),end(points));
	map<int,int> fi;
	f(i,0,n) fi[points[i].second] = 0;
	int t = 0;
	for (pii pp : fi)
		fi[pp.first] = t++;

	bool inc = 1;
	f(i,1,n) if (points[i].second < points[i-1].second)
		inc = 0;

	ld ans = 100LL*(abs(x1-x2)+abs(y1-y2));
	if (inc && n && points[0].first + n - 1 ==points[n-1].first)
		ans += M_PI * 5;
	else if (inc && n && points[0].second + n - 1 == points[n-1].second)
		ans += M_PI * 5;
	int num = 0;
	BIT ds;
	f(i,0,n) {
		int z = ds.sum(fi[points[i].second])+1;
		ds.add(fi[points[i].second],z);
		Max(num,z);
	}
	ans += 1LL*num*(M_PI*5-20);
	cout << setprecision(30) << ans << endl;


#ifdef LOCAL
	cout << setprecision(12) << (long double)(clock()-start) / CLOCKS_PER_SEC << endl;
#endif
	
	return 0;
}

Submission Info

Judge Result