Submission #1544139

---

Source Code Expand

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <complex>
#include <iomanip>

using namespace std;

//typedef
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long ll;

#define omajinai ios::sync_with_stdio(false);cin.tie(0)

//container util
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQUE(a)  (a).erase(unique((a).begin(),(a).end()),(a).end())
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define RFOR(i,b,a) for(int i=(b)-1;i>=(a);--i)
#define RREP(i,n) RFOR(i,n,0)

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << "[L " << __LINE__ << "] " << #x << " = " << (x) << "\n";

#define X first
#define Y second

const int _N = 2e5;
const long double PI = 3.1415926535897932;

int x1,x2,yy1,yy2;
int n;
int cnt[_N];
int ins = 0;
PII p[_N];
bool inside(int x, int y){
	return x1 <= x && x <= x2 &&
			yy1 <= y && y <= yy2;
}
int count(int i){
	if(~cnt[i])return cnt[i];
	if(!inside(p[i].X, p[i].Y)){
		return cnt[i] = 0;
	}
	ins++;
	int c = 0;

	FOR(j, i+1, n){
		if(p[j].Y > p[i].Y){ // right and top
			c = max(c,count(j));
		}
	}
	c++;
	return cnt[i] = c;
}
int main() {
	cin >> x1 >> yy1 >> x2 >> yy2 >> n;
	//init
	REP(i, n)cnt[i] = -1;
	//
	int xk = 1, yk = 1;
	if(x1>x2&&yy1>yy2){
		swap(x1,x2);
		swap(yy1,yy2);
	}else if(x1>x2){
		x1*=-1;x2*=-1;
		xk=-1;
	}else if(yy1>yy2){
		yy1*=-1;yy2*=-1;
		yk=-1;
	}
//	dump(1);
	REP(i, n){
		int xx, yy;
		cin >> xx >> yy;
		p[i] = MP(xx * xk, yy * yk);
	}
//	dump(2);
	sort(p, p+n);
	int M = 0;
//	dump(3);
	REP(i, n){ //count (right and top) s
		M = max(M,count(i));
	}
//	dump(4);
	long double ans = (ll)((x2-x1)+(yy2-yy1)) * 100;
	cout << fixed << setprecision(13);
	cerr << fixed << setprecision(13);
//	dump(M);
//	dump(((x2-x1)+(yy2-yy1)) * 100);
//	dump(ans);
//	dump(M * (5*PI - 20));

	if(M==min((x2-x1),(yy2-yy1))+1){
		ans += (M-1) * (5*PI - 20) - 20 + 10 * PI;
	}else{
		ans += M * (5*PI - 20);
	}
	cout << fixed << setprecision(13) << ans << endl;
	return 0;
}

Submission Info

Judge Result