Submission #1154699


Source Code Expand

                            #include <bits/stdc++.h>
                            #include<iostream>
                            #include<cstdio>
                            #include<vector>
                            #include<queue>
                            #include<map>
                            #include<cstring>
                            #include<string>
                            #include <math.h>
                            #include<algorithm>
                        //    #include <boost/multiprecision/cpp_int.hpp>
                            #include<functional>
                     #define int long long
                            #define inf  1000000007
                            #define pa pair<int,int>
                            #define ll long long
                            #define pal pair<double,int>
                            #define ppa pair<string,pa>
                            #define ssa pair<string,int>
                            #define  mp make_pair
                            #define  pb push_back
                            #define EPS (1e-10)
                            #define equals(a,b) (fabs((a)-(b))<EPS)
                     
                            using namespace std;
                     //priority_queue<int, vector<int>, greater<int> > que;
                            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;
                     
                            struct Segment{
                            Point p1,p2;
                            };
                     
                        double hen(Vector a){
                        if(fabs(a.x)<EPS && a.y>0) return acos(0);
                        else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
                        else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
                        else if(fabs(a.y)<EPS && a.x>0) return 0.0;
                        else if(a.y>0) return acos(a.x/a.absv());
                        else return 2*acos(0)+acos(-a.x/a.absv());
                     
                        }
                     
                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 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;
                            }
                        
                double distans(double x1,double y1,double x2,double y2){
                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                	return sqrt(rr);
                	
                }

                            //----------------kokomade tenpure------------
int N=262144;
pa sgt[530000];

pa minis(int i,int j ){
if(i==j) return sgt[i];
	else if(i%2==1){
		pa z=minis(i+1,j);
		if(sgt[i].first>z.first)return sgt[i] ;
		else return z;
	}
		else if(j%2==0) 	{
		pa z=minis(i,j-1);
		if(sgt[j].first>z.first)return sgt[j] ;
		else return z;
	}
else return minis(i/2,j/2);
}

pa sgtmin(int i ,int j) {
	return minis(i+N,j+N);
}

void upd(int x,int y){
	x+=N;
sgt[x].first=y;
	sgt[x].second=x;
x=x/2;
while(x != 0){
	if(sgt[2*x+1].first>sgt[2*x].first){
		sgt[x]=sgt[2*x+1];
	}
	else sgt[x]=sgt[2*x];

x=x/2;
}
}

 signed  main(){

 	string s;
 	cin>>s;
 	
 	int l=s.length();
 	int a=0,b=3;
 	for(int i=l-1;i>=0;i--){
 		if(l[i]=='-') a= -a:
 		else{
 			if(a==0) a=1;
 			else a=0;
 		}
 	}
 	for(int i=l-1;i>=0;i--){
 		if(l[i]=='-') b= -b:
 		else{
 			if(b==0) b=1;
 			else b=0;
 		}
 	}
 	
 	
 	if(a==0 && b==3){
 		cout<<endl;
 	}
 	else if(a==0 && b==-3){
 		cout<<"-"<<endl;
 	}
 	else if(a==0 && b==1){
 		cout<<"!!"<<endl;
 	}
 	else if(a==0 && b==-1){
 		cout<<"-!!"<<endl;
 	}
 	else if(a==-1 && b==0){
 		cout<<"-!"<<endl;
 	}
 	else if(a==1 && b==0){
 		cout<<"!"<<endl;
 	}
 	//  	printf("%.10f\n",ans[n-1]);
                    	return 0;
}

Submission Info

Submission Time
Task E - ショートコーディング
User smiken
Language C++14 (GCC 5.4.1)
Score 0
Code Size 5400 Byte
Status CE

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:131:10: error: invalid types ‘long long int[long long int]’ for array subscript
    if(l[i]=='-') a= -a:
          ^
./Main.cpp:131:23: error: expected ‘;’ before ‘:’ token
    if(l[i]=='-') a= -a:
                       ^
./Main.cpp:138:10: error: invalid types ‘long long int[long long int]’ for array subscript
    if(l[i]=='-') b= -b:
          ^
./Main.cpp:138:23: error: expected ‘;’ before ‘:’ token
    if(l[i]=='-') b= -b:
                       ^