Submission #3419172


Source Code Expand

     #include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
 #define int long long
 #define inf  1000000007
 #define pa pair<int,int>
 #define ll long long
 #define pal pair<double,double>
 #define ppap pair<pa,int>
//  #define PI 3.14159265358979323846
  #define paa pair<int,char>
  #define  mp make_pair
  #define  pb push_back
  #define EPS (1e-10)
                                          
    int dx[8]={0,1,0,-1,1,1,-1,-1};
    int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            using namespace std;
                                   			class pa3{
                                            	public:
                                            	int x,y,z;
                                            	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                            	bool operator < (const pa3 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		 return z<p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                   				bool operator > (const pa3 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		 return z>p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa3 &p) const{
                                            		return x==p.x && y==p.y && z==p.z;
                                            	}
                                            		bool operator != (const pa3 &p) const{
                                            			return !( x==p.x && y==p.y && z==p.z);
                                            	}
                                            
                                            };
                                            
                                            class pa4{
                                            	public:
                                            	double x;
                                            	int y,z,w;
                                            	pa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                            	bool operator < (const pa4 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		if(z!=p.z)return z<p.z;
                                            		return w<p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator > (const pa4 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		if(z!=p.z)return z>p.z;
                                            		return w>p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa4 &p) const{
                                            		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                            	}
                                            		
                                            
                                            };
                                            class pa2{
                                            	public:
                                            	int x,y;
                                            	pa2(int x=0,int y=0):x(x),y(y) {}
                                            	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                            	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                            	bool operator < (const pa2 &p) const{
                                            		return y != p.y ? y<p.y: x<p.x;
                                            	}
                                            	bool operator > (const pa2 &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa2 &p) const{
                                            		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                            	}
                                            	bool operator != (const pa2 &p) const{
                                            		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                            	}
                                            		
                                            
                                            };
                                            
/*
                                            class Point{
                                            	public:
                                            	double x,y;
                                            	Point(double x=0,double y=0):x(x),y(y) {}
                                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                                            	Point operator * (double a) {return Point(x*a,y*a);}
                                            	Point operator / (double a) {return Point(x/a,y/a);}
                                            	double absv() {return sqrt(norm());}
                                            	double norm() {return x*x+y*y;}
                                            	bool operator < (const Point &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const Point &p) const{
                                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                                            	}
                                            };
                                            typedef Point Vector;
                                     #define pl pair<int,pas>
                                            struct Segment{
                                            Point p1,p2;
                                            };
                                             double dot(Vector a,Vector b){
                                            	return a.x*b.x+a.y*b.y;
                                            }
                                            double cross(Vector a,Vector b){
                                            	return a.x*b.y-a.y*b.x;
                                            }
                                        
                bool parareru(Point a,Point b,Point c,Point d){
                //	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
                	return abs(cross(a-b,d-c))<EPS;
                }
                double distance_ls_p(Point a, Point b, Point c) {
                  if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
                  if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
                  return abs(cross(b-a, c-a)) / (b-a).absv();
                }
                bool is_intersected_ls(Segment a,Segment b) {
                	if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
                	if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){
                //		cout<<"sss"<<endl;
                		if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
                		if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
                		if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
                		if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
                		return false;
                	}
                  else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
                }
                 
                double segment_dis(Segment a,Segment b){
                	if(is_intersected_ls(a,b))return 0;
                	double r=distance_ls_p(a.p1, a.p2, b.p1);
                	r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
                	return r;
                }
                Point intersection_ls(Segment a, Segment b) {
                  Point ba = b.p2-b.p1;
                  double d1 = abs(cross(ba, a.p1-b.p1));
                  double d2 = abs(cross(ba, a.p2-b.p1));
                  double t = d1 / (d1 + d2);
                 
                  return a.p1 + (a.p2-a.p1) * t;
                }
 */                
                                string itos( int i ) {
                                ostringstream s ;
                                s << i ;
                                return s.str() ;
                                }
                                 
                                int gcd(int v,int b){
                                	if(v>b) return gcd(b,v);
                                	if(v==b) return b;
                                	if(b%v==0) return v;
                                	return gcd(v,b%v);
                                }
                 
                                double distans(double x1,double y1,double x2,double y2){
                                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                                	return sqrt(rr);
                                	
                                }
                                int mod;
                                
                int pr[500010];
                int inv[500010];
                
                int beki(int wa,int rr,int warukazu){
                	if(rr==0) return 1%warukazu;
                	if(rr==1) return wa%warukazu;
                	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
                	ll zx=beki(wa,rr/2,warukazu);
                	return (zx*zx)%warukazu;
                }
    double bekid(double w,int r){
    	if(r==0) return 1.0;
    	if(r==1) return w;
    	if(r%2) return bekid(w,r-1)*w;
    	double f=bekid(w,r/2);
    	return f*f;
    }
                
    			int comb(int nn,int rr){
    				int r=pr[nn]*inv[rr];
    				r%=mod;
    				r*=inv[nn-rr];
    				r%=mod;
    				return r;
    			}
                
                void gya(int ert){
                	pr[0]=1;
                	for(int i=1;i<ert;i++){
                		pr[i]=(pr[i-1]*i)%mod;
                	}
                	for(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);
                	
                }
                
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
                                         //----------------kokomade tenpure------------
                //vector<double> ans(100000000),ans2(100000000)

set<int> sex,sey;
map<int,int>mx,my;
struct Segmax{
	//       1
	//   2        3
	// 4   5   6    7
	
	
	private:
	public:
	
	// (1<<15)=32768
	// 1<<16 = 65536
	// 1<<17 = 131072
	// 1<<18 = 262144
	
	int cor=(1<<18);
	
	vector<pa> vec;
	
	void shoki1(){
		
		vec.resize(2*cor+3, mp(0,0));
		for(int i=cor;i<2*cor;i++)vec[i].second=i-cor;
	}
		void shoki2(){
			for(int i=cor-1;i>0;i--) {
				if(vec[2*i].first>=vec[2*i+1].first) vec[i]=vec[2*i];
				else vec[i]=vec[2*i+1];
			}
		}
		
	void updadd(int x,int w){
		//x 項目に w加算
		x+=cor;
		vec[x].first+=w;
		while(1){
			x/=2;
			if(x==0) break;
			if(vec[2*x].first>=vec[2*x+1].first) vec[x]=vec[2*x];
			else vec[x]=vec[2*x+1];
		}
		
	}
	
	void updchan(int x,int w){
		//x項目をwに変更
		
		x+=cor;
		vec[x].first=w;
		
		while(1){
			x/=2;
			if(x==0) break;
			if(vec[2*x].first>=vec[2*x+1].first) vec[x]=vec[2*x];
			else vec[x]=vec[2*x+1];
		}
		
	}
	// [a,b)
	// k-th node
	// k no kukanha [l,r)
	pa segmax(int a,int b,int k=1,int l=0,int r=-10){
		if(r<0)r=cor;
		
	//	cout<<a<<" "<<b<<" "<<k<<" "<<l<<" "<<r<<endl;
		
		if(a<=l && r<=b){
			return vec[k];
		}
		if(r<=a || b<=l){
			return mp(-(1ll<<31),-1);
		}
		
		pa v1=segmax(a,b,k*2,l,(l+r)/2),v2=segmax(a,b,k*2+1,(l+r)/2,r);
		
		if(v1.first>=v2.first)return v1;
		else return v2;
	}
	

	
};
Segmax ss;
int xx[220020],yy[220002];
vector<pa>ve;
  signed main(){
    	       cin.tie(0);
    			ios::sync_with_stdio(false);
int sx,sy,gx,gy;
  	cin>>sx>>sy>>gx>>gy;
  	int n;
  	cin>>n;
  	sex.insert(sx);
  	sex.insert(gx);
  	sey.insert(sy);
  	sey.insert(gy);
  	for(int i=0;i<n;i++){
  		cin>>xx[i]>>yy[i];
  		sex.insert(xx[i]);
  		sey.insert(yy[i]);
  	}
  	double pi=4*atan(1);
 
  	if(sx==gx){
  		bool bo=false;
  		for(int i=0;i<n;i++)if(xx[i]==sx && min(sy,gy)<yy[i] && yy[i]<max(sy,gy))bo=1;
  		
  		double dis= (double) abs(sy-gy);
  		if(!bo) printf("%.10lf\n",dis*100);
  		else{
  			printf("%.20lf\n",dis*100.0+10.0*pi-20.0);
  		}
  		return 0;
  	}
  	if(sy==gy){
  		bool bo=false;
  		for(int i=0;i<n;i++)if(yy[i]==sy && min(sx,gx)<xx[i] && xx[i]<max(sx,gx))bo=1;
  		
  		double dis= (double) abs(sx-gx);
  		if(!bo) printf("%.10lf\n",dis*100);
  		else{
  			printf("%.20lf\n",dis*100.0+10.0*pi-20.0);
  		}
  		return 0;
  	}
  	
  	int cnt=0;
  	for(auto it=sex.begin();it!=sex.end();it++){
  		mx[*it]=cnt;
  		cnt++;
  	}
  	 cnt=0;
  	for(auto it=sey.begin();it!=sey.end();it++){
  		my[*it]=cnt;
  		cnt++;
  	}
  		
  	for(int i=0;i<n;i++)xx[i]=mx[xx[i]],yy[i]=my[yy[i]];
  	
  	
  	
  	
  
  	double od=(double)abs(sx-gx)+(double)abs(gy-sy);
  	sx=mx[sx];
  	sy=my[sy];
  	
  	gx=mx[gx];
  	gy=my[gy];
  	
  	for(int i=0;i<n;i++)if(min(sx,gx)<= xx[i] && xx[i]<= max(sx,gx) &&min(sy,gy)<= yy[i] && yy[i]<= max(sy,gy))ve.pb(mp(xx[i],yy[i]));
  	int l=ve.size();
  	
  	if( sy>gy){
  		int h=sy-gy;
  		for(int i=0;i<l;i++){
  			int t=sy-ve[i].second;
  			ve[i].second=sy+t;
  		}
  		gy=sy+h;
  	}
  	
  	if( sx>gx){
  		int h=sx-gx;
  		for(int i=0;i<l;i++){
  			int t=sx-ve[i].first;
  			ve[i].first=sx+t;
  		}
  		gx=sx+h;
  	}
  	
  	sort(ve.begin(),ve.end());
  	int f=inf;
  	for(int i=0;i<l;i++)f=min(f,ve[i].second);
  	f-=2;
  	for(int i=0;i<l;i++){
  		ve[i].second-=f;
  	
  //	cout<<ve[i].second<<endl;
  	}
  	ss.shoki1();
  	ss.shoki2();
  	ss.updchan(0,0);
  	int ans=0;
  	for(int i=0;i<l;i++){
  		int y=ss.segmax(0ll,ve[i].second).first;
  		ss.updchan(ve[i].second,y+1);
  		ans=max(ans,y+1);
  	}
  //	cout<<ans<<endl;
  	
  //	cout<<od<<endl;
  	od*=100;
  	od-= ans*(20.0-5.0*pi);
  	
  	printf("%.10lf\n",od);
  	return 0;
    }

Submission Info

Submission Time
Task C - Fountain Walk
User smiken
Language C++14 (GCC 5.4.1)
Score 0
Code Size 15747 Byte
Status WA
Exec Time 625 ms
Memory 60272 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
AC × 3
AC × 41
WA × 6
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt, subtask_1_39.txt, subtask_1_40.txt, subtask_1_41.txt
Case Name Status Exec Time Memory
sample_01.txt AC 5 ms 10496 KB
sample_02.txt AC 5 ms 10496 KB
sample_03.txt AC 2 ms 2304 KB
subtask_1_01.txt AC 4 ms 10496 KB
subtask_1_02.txt AC 4 ms 10496 KB
subtask_1_03.txt AC 4 ms 10496 KB
subtask_1_04.txt AC 5 ms 10496 KB
subtask_1_05.txt AC 4 ms 10496 KB
subtask_1_06.txt AC 4 ms 10496 KB
subtask_1_07.txt AC 4 ms 10496 KB
subtask_1_08.txt AC 5 ms 10496 KB
subtask_1_09.txt AC 61 ms 9728 KB
subtask_1_10.txt WA 370 ms 43776 KB
subtask_1_11.txt WA 70 ms 19200 KB
subtask_1_12.txt WA 592 ms 59376 KB
subtask_1_13.txt AC 152 ms 18432 KB
subtask_1_14.txt WA 153 ms 27008 KB
subtask_1_15.txt WA 63 ms 18432 KB
subtask_1_16.txt WA 585 ms 59376 KB
subtask_1_17.txt AC 313 ms 39808 KB
subtask_1_18.txt AC 231 ms 33536 KB
subtask_1_19.txt AC 226 ms 32896 KB
subtask_1_20.txt AC 586 ms 60272 KB
subtask_1_21.txt AC 584 ms 59376 KB
subtask_1_22.txt AC 584 ms 59376 KB
subtask_1_23.txt AC 596 ms 59376 KB
subtask_1_24.txt AC 1 ms 2304 KB
subtask_1_25.txt AC 1 ms 2304 KB
subtask_1_26.txt AC 1 ms 2304 KB
subtask_1_27.txt AC 2 ms 2304 KB
subtask_1_28.txt AC 567 ms 56320 KB
subtask_1_29.txt AC 560 ms 56320 KB
subtask_1_30.txt AC 625 ms 60016 KB
subtask_1_31.txt AC 388 ms 59632 KB
subtask_1_32.txt AC 394 ms 59760 KB
subtask_1_33.txt AC 409 ms 59632 KB
subtask_1_34.txt AC 373 ms 59504 KB
subtask_1_35.txt AC 380 ms 59376 KB
subtask_1_36.txt AC 511 ms 59504 KB
subtask_1_37.txt AC 391 ms 59376 KB
subtask_1_38.txt AC 392 ms 59888 KB
subtask_1_39.txt AC 397 ms 59376 KB
subtask_1_40.txt AC 394 ms 59376 KB
subtask_1_41.txt AC 391 ms 59632 KB