Submission #3500601


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:
                                            	int x;
                                            	int y,z,w;
                                            	pa4(int 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;
                	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)




int kosuu(int a,int b,int c){
	if(a==0 && b==0) return c;
	if(c==0 && b==0) return a;
	if(a==0 && c==0) return b;
	
	if(a==0){
		if(b!=c) return min(b,c);
		return b;
	}
	
	if(b==0){
		if(a!=c) return min(a,c);
		return a;
	}
	
	if(c==0){
		if(b!=a) return min(b,a);
		return b;
	}
	
		int mi=min({a,b,c});
	int g=0;
	if(a==mi)g++;
	if(b==mi)g++;
	if(c==mi)g++;
	
	if(g==3) return a+b+c;
	if(g==1) return mi;
	return mi;
	
}
double rui[200];
double prr(int a,int b,int c){
	int n=a+b+c;
	
	double ans=rui[n]-rui[a]-rui[b]-rui[c];
	ans-=(n+0.0)*log(3);
	
	return exp(ans);
}


  signed main(){
    	       cin.tie(0);
    			ios::sync_with_stdio(false);
rui[0]=0;
  	double ans[110];
  	ans[1]=0;
  	for(int i=1;i<=199;i++){
  		rui[i]=rui[i-1]+log(i);
  	}
  	for(int i=2;i<=100;i++){
  		double memo[110]={0};
  		for(int a=0;a<=i;a++)for(int b=a;b<=i;b++){
  			int p0=a;
  			int p1=b-a;
  			int p2=i-b;
  			
  			memo[kosuu(p0,p1,p2)]+=prr(p0,p1,p2);
  			
  		}
  		double g=1;
  		for(int j=1;j<i;j++)g+=memo[j]*ans[j];
  		g/=(1.0-memo[i]);
  		ans[i]=g;
  		
  	}
  	
  	int n;
  	cin>>n;
  	printf("%.10lf\n",ans[n]);
  	return 0;
    }
    

Submission Info

Submission Time
Task C - ゲーマーじゃんけん
User smiken
Language C++14 (GCC 5.4.1)
Score 100
Code Size 13192 Byte
Status AC
Exec Time 13 ms
Memory 896 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 99
Set Name Test Cases
All input-002.txt, input-003.txt, input-004.txt, input-005.txt, input-006.txt, input-007.txt, input-008.txt, input-009.txt, input-010.txt, input-011.txt, input-012.txt, input-013.txt, input-014.txt, input-015.txt, input-016.txt, input-017.txt, input-018.txt, input-019.txt, input-020.txt, input-021.txt, input-022.txt, input-023.txt, input-024.txt, input-025.txt, input-026.txt, input-027.txt, input-028.txt, input-029.txt, input-030.txt, input-031.txt, input-032.txt, input-033.txt, input-034.txt, input-035.txt, input-036.txt, input-037.txt, input-038.txt, input-039.txt, input-040.txt, input-041.txt, input-042.txt, input-043.txt, input-044.txt, input-045.txt, input-046.txt, input-047.txt, input-048.txt, input-049.txt, input-050.txt, input-051.txt, input-052.txt, input-053.txt, input-054.txt, input-055.txt, input-056.txt, input-057.txt, input-058.txt, input-059.txt, input-060.txt, input-061.txt, input-062.txt, input-063.txt, input-064.txt, input-065.txt, input-066.txt, input-067.txt, input-068.txt, input-069.txt, input-070.txt, input-071.txt, input-072.txt, input-073.txt, input-074.txt, input-075.txt, input-076.txt, input-077.txt, input-078.txt, input-079.txt, input-080.txt, input-081.txt, input-082.txt, input-083.txt, input-084.txt, input-085.txt, input-086.txt, input-087.txt, input-088.txt, input-089.txt, input-090.txt, input-091.txt, input-092.txt, input-093.txt, input-094.txt, input-095.txt, input-096.txt, input-097.txt, input-098.txt, input-099.txt, input-100.txt
Case Name Status Exec Time Memory
input-002.txt AC 13 ms 896 KB
input-003.txt AC 6 ms 256 KB
input-004.txt AC 6 ms 256 KB
input-005.txt AC 6 ms 256 KB
input-006.txt AC 6 ms 256 KB
input-007.txt AC 6 ms 256 KB
input-008.txt AC 6 ms 256 KB
input-009.txt AC 6 ms 256 KB
input-010.txt AC 6 ms 256 KB
input-011.txt AC 6 ms 256 KB
input-012.txt AC 6 ms 256 KB
input-013.txt AC 6 ms 256 KB
input-014.txt AC 6 ms 256 KB
input-015.txt AC 6 ms 256 KB
input-016.txt AC 6 ms 256 KB
input-017.txt AC 6 ms 256 KB
input-018.txt AC 6 ms 256 KB
input-019.txt AC 6 ms 256 KB
input-020.txt AC 6 ms 256 KB
input-021.txt AC 6 ms 256 KB
input-022.txt AC 6 ms 256 KB
input-023.txt AC 6 ms 256 KB
input-024.txt AC 6 ms 256 KB
input-025.txt AC 6 ms 256 KB
input-026.txt AC 6 ms 256 KB
input-027.txt AC 6 ms 256 KB
input-028.txt AC 6 ms 256 KB
input-029.txt AC 6 ms 256 KB
input-030.txt AC 6 ms 256 KB
input-031.txt AC 6 ms 256 KB
input-032.txt AC 6 ms 256 KB
input-033.txt AC 6 ms 256 KB
input-034.txt AC 6 ms 256 KB
input-035.txt AC 6 ms 256 KB
input-036.txt AC 6 ms 256 KB
input-037.txt AC 6 ms 256 KB
input-038.txt AC 6 ms 256 KB
input-039.txt AC 6 ms 256 KB
input-040.txt AC 6 ms 256 KB
input-041.txt AC 6 ms 256 KB
input-042.txt AC 6 ms 256 KB
input-043.txt AC 6 ms 256 KB
input-044.txt AC 6 ms 256 KB
input-045.txt AC 6 ms 256 KB
input-046.txt AC 6 ms 256 KB
input-047.txt AC 6 ms 256 KB
input-048.txt AC 6 ms 256 KB
input-049.txt AC 6 ms 256 KB
input-050.txt AC 6 ms 256 KB
input-051.txt AC 6 ms 256 KB
input-052.txt AC 6 ms 256 KB
input-053.txt AC 6 ms 256 KB
input-054.txt AC 6 ms 256 KB
input-055.txt AC 6 ms 256 KB
input-056.txt AC 6 ms 256 KB
input-057.txt AC 6 ms 256 KB
input-058.txt AC 6 ms 256 KB
input-059.txt AC 6 ms 256 KB
input-060.txt AC 6 ms 256 KB
input-061.txt AC 6 ms 256 KB
input-062.txt AC 6 ms 256 KB
input-063.txt AC 6 ms 256 KB
input-064.txt AC 6 ms 256 KB
input-065.txt AC 6 ms 256 KB
input-066.txt AC 6 ms 256 KB
input-067.txt AC 6 ms 256 KB
input-068.txt AC 6 ms 256 KB
input-069.txt AC 6 ms 256 KB
input-070.txt AC 6 ms 256 KB
input-071.txt AC 6 ms 384 KB
input-072.txt AC 6 ms 256 KB
input-073.txt AC 6 ms 256 KB
input-074.txt AC 6 ms 256 KB
input-075.txt AC 6 ms 256 KB
input-076.txt AC 6 ms 256 KB
input-077.txt AC 6 ms 256 KB
input-078.txt AC 6 ms 256 KB
input-079.txt AC 6 ms 256 KB
input-080.txt AC 6 ms 256 KB
input-081.txt AC 6 ms 256 KB
input-082.txt AC 6 ms 256 KB
input-083.txt AC 6 ms 256 KB
input-084.txt AC 6 ms 256 KB
input-085.txt AC 6 ms 256 KB
input-086.txt AC 6 ms 256 KB
input-087.txt AC 6 ms 256 KB
input-088.txt AC 6 ms 256 KB
input-089.txt AC 6 ms 256 KB
input-090.txt AC 6 ms 256 KB
input-091.txt AC 6 ms 256 KB
input-092.txt AC 6 ms 256 KB
input-093.txt AC 6 ms 256 KB
input-094.txt AC 6 ms 256 KB
input-095.txt AC 6 ms 256 KB
input-096.txt AC 6 ms 256 KB
input-097.txt AC 6 ms 256 KB
input-098.txt AC 6 ms 256 KB
input-099.txt AC 6 ms 256 KB
input-100.txt AC 6 ms 256 KB