Submission #3866810
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))&¶reru((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 extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a%b, y, x);
y -= a/b * x;
return d;
}
int pr[1000010];
int inv[1000010];
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<char> ve;
string s;
int aite[210];
int yaru(int a,int b,char c){
if(c=='+')return a+b;
if(c=='*')return a*b;
if(c=='-')return a-b;
else exit(1);
}
int jun[4][3];
int saiki(int l,int r,int q){
if(aite[l]==r){
return saiki(l+1,r-1,q);
}
int lev=0;
int a[3]={-inf,-inf,-inf};
for(int i=l;i<=r;i++){
if(s[i]=='(')lev++;
for(int j=0;j<3;j++){
if(s[i]==ve[j]&& lev==0)a[jun[q][j]]=max(a[jun[q][j]],i);
}
// if(s[i]==ve[0] && lev==0)a[0]=max(a[0],i);
// if(s[i]==ve[1] && lev==0)a[1]=max(a[1],i);
// if(s[i]==ve[2] && lev==0)a[2]=max(a[2],i);
if(s[i]==')')lev--;
}
int z=max({a[0],a[1],a[2]});
if(z==-inf){
return stoi(s.substr(l,r-l+1));
}
for(int i=0;i<3;i++)if(a[i]>-inf){
int l1=saiki(l,a[i]-1,q);
int l2=saiki(a[i]+1,r,q);
return yaru(l1,l2,s[a[i]]);
}
cout<<"out"<<endl;
exit(1);
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
jun[0][0]=0;
jun[0][1]=0;
jun[0][2]=0;
jun[1][0]=1;
jun[1][1]=1;
jun[1][2]=0;
jun[2][0]=1;
jun[2][1]=0;
jun[2][2]=0;
jun[3][0]=2;
jun[3][1]=1;
jun[3][2]=0;
cin>>s;
ve.pb('*');
ve.pb('-');
ve.pb('+');
sort(ve.begin(),ve.end());
vector<int> ans;
int l=s.length();
stack<int> st;
for(int i=0;i<l;i++)aite[i]=-1;
for(int i=0;i<l;i++){
if(s[i]=='('){
st.push(i);
}
if(s[i]==')'){
int z=st.top();
st.pop();
aite[z]=i;
aite[i]=z;
}
}
do{
for(int j=0;j<4;j++){
int y=saiki(0,l-1,j);
// cout<<ve[0]<<" "<<ve[1]<<" "<<ve[2]<<" "<<y<<endl;
ans.pb(y);
}
}while(next_permutation(ve.begin(),ve.end()));
sort(ans.begin(),ans.end());
cout<<ans.back()<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
G - Unordered Operators |
User |
smiken |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
13867 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
00-sample1.txt, 00-sample2.txt, 00-sample3.txt, allpatterntest-00.txt, allpatterntest-01.txt, allpatterntest-02.txt, allpatterntest-03.txt, allpatterntest-04.txt, allpatterntest-05.txt, allpatterntest-06.txt, allpatterntest-07.txt, allpatterntest-08.txt, allpatterntest-09.txt, allpatterntest-10.txt, allpatterntest-11.txt, allpatterntest-12.txt, overflow-00.txt, overflow-01.txt, random0000.txt, random0001.txt, random0002.txt, random0003.txt, random0004.txt, random0005.txt, random0006.txt, random0007.txt, random0008.txt, random0009.txt, random0010.txt, random0011.txt, random0012.txt, random0013.txt, random0014.txt, random0015.txt, random0016.txt, random0017.txt, random0018.txt, random0019.txt, random0020.txt, random0021.txt, random0022.txt, random0023.txt, random0024.txt, random0025.txt, random0026.txt, random0027.txt, random0028.txt, random0029.txt, random0030.txt, random0031.txt, random0032.txt, random0033.txt, random0034.txt, random0035.txt, random0036.txt, random0037.txt, random0038.txt, random0039.txt, random0040.txt, random0041.txt, random0042.txt, random0043.txt, random0044.txt, random0045.txt, random0046.txt, random0047.txt, random0048.txt, random0049.txt, random0050.txt, random0051.txt, random0052.txt, random0053.txt, random0054.txt, random0055.txt, random0056.txt, random0057.txt, random0058.txt, random0059.txt, random0060.txt, random0061.txt, random0062.txt, random0063.txt, random0064.txt, random0065.txt, random0066.txt, random0067.txt, random0068.txt, random0069.txt, random0070.txt, random0071.txt, random0072.txt, random0073.txt, random0074.txt, random0075.txt, random0076.txt, random0077.txt, random0078.txt, random0079.txt, random0080.txt, random0081.txt, random0082.txt, random0083.txt, random0084.txt, random0085.txt, random0086.txt, random0087.txt, random0088.txt, random0089.txt, random0090.txt, random0091.txt, random0092.txt, random0093.txt, random0094.txt, random0095.txt, random0096.txt, random0097.txt, random0098.txt, random0099.txt, random0100.txt, random0101.txt, random0102.txt, random0103.txt, random0104.txt, random0105.txt, random0106.txt, random0107.txt, random0108.txt, random0109.txt, sample4.txt |
Case Name |
Status |
Exec Time |
Memory |
00-sample1.txt |
AC |
1 ms |
256 KB |
00-sample2.txt |
AC |
1 ms |
256 KB |
00-sample3.txt |
AC |
1 ms |
256 KB |
allpatterntest-00.txt |
AC |
1 ms |
256 KB |
allpatterntest-01.txt |
AC |
1 ms |
256 KB |
allpatterntest-02.txt |
AC |
1 ms |
256 KB |
allpatterntest-03.txt |
AC |
1 ms |
256 KB |
allpatterntest-04.txt |
AC |
1 ms |
256 KB |
allpatterntest-05.txt |
AC |
1 ms |
256 KB |
allpatterntest-06.txt |
AC |
1 ms |
256 KB |
allpatterntest-07.txt |
AC |
1 ms |
256 KB |
allpatterntest-08.txt |
AC |
1 ms |
256 KB |
allpatterntest-09.txt |
AC |
1 ms |
256 KB |
allpatterntest-10.txt |
AC |
1 ms |
256 KB |
allpatterntest-11.txt |
AC |
1 ms |
256 KB |
allpatterntest-12.txt |
AC |
1 ms |
256 KB |
overflow-00.txt |
AC |
2 ms |
256 KB |
overflow-01.txt |
AC |
2 ms |
256 KB |
random0000.txt |
AC |
1 ms |
256 KB |
random0001.txt |
AC |
1 ms |
256 KB |
random0002.txt |
AC |
1 ms |
256 KB |
random0003.txt |
AC |
1 ms |
256 KB |
random0004.txt |
AC |
1 ms |
256 KB |
random0005.txt |
AC |
1 ms |
256 KB |
random0006.txt |
AC |
2 ms |
256 KB |
random0007.txt |
AC |
2 ms |
256 KB |
random0008.txt |
AC |
1 ms |
256 KB |
random0009.txt |
AC |
1 ms |
256 KB |
random0010.txt |
AC |
1 ms |
256 KB |
random0011.txt |
AC |
1 ms |
256 KB |
random0012.txt |
AC |
2 ms |
256 KB |
random0013.txt |
AC |
1 ms |
256 KB |
random0014.txt |
AC |
1 ms |
256 KB |
random0015.txt |
AC |
2 ms |
256 KB |
random0016.txt |
AC |
1 ms |
256 KB |
random0017.txt |
AC |
1 ms |
256 KB |
random0018.txt |
AC |
1 ms |
256 KB |
random0019.txt |
AC |
1 ms |
256 KB |
random0020.txt |
AC |
1 ms |
256 KB |
random0021.txt |
AC |
1 ms |
256 KB |
random0022.txt |
AC |
1 ms |
256 KB |
random0023.txt |
AC |
1 ms |
256 KB |
random0024.txt |
AC |
1 ms |
256 KB |
random0025.txt |
AC |
1 ms |
256 KB |
random0026.txt |
AC |
2 ms |
256 KB |
random0027.txt |
AC |
2 ms |
256 KB |
random0028.txt |
AC |
1 ms |
256 KB |
random0029.txt |
AC |
1 ms |
256 KB |
random0030.txt |
AC |
1 ms |
256 KB |
random0031.txt |
AC |
1 ms |
256 KB |
random0032.txt |
AC |
1 ms |
256 KB |
random0033.txt |
AC |
1 ms |
256 KB |
random0034.txt |
AC |
1 ms |
256 KB |
random0035.txt |
AC |
1 ms |
256 KB |
random0036.txt |
AC |
1 ms |
256 KB |
random0037.txt |
AC |
1 ms |
256 KB |
random0038.txt |
AC |
1 ms |
256 KB |
random0039.txt |
AC |
1 ms |
256 KB |
random0040.txt |
AC |
1 ms |
256 KB |
random0041.txt |
AC |
1 ms |
256 KB |
random0042.txt |
AC |
2 ms |
256 KB |
random0043.txt |
AC |
1 ms |
256 KB |
random0044.txt |
AC |
1 ms |
256 KB |
random0045.txt |
AC |
1 ms |
256 KB |
random0046.txt |
AC |
1 ms |
256 KB |
random0047.txt |
AC |
1 ms |
256 KB |
random0048.txt |
AC |
1 ms |
256 KB |
random0049.txt |
AC |
1 ms |
256 KB |
random0050.txt |
AC |
1 ms |
256 KB |
random0051.txt |
AC |
1 ms |
256 KB |
random0052.txt |
AC |
1 ms |
256 KB |
random0053.txt |
AC |
1 ms |
256 KB |
random0054.txt |
AC |
1 ms |
256 KB |
random0055.txt |
AC |
1 ms |
256 KB |
random0056.txt |
AC |
1 ms |
256 KB |
random0057.txt |
AC |
1 ms |
256 KB |
random0058.txt |
AC |
1 ms |
256 KB |
random0059.txt |
AC |
1 ms |
256 KB |
random0060.txt |
AC |
1 ms |
256 KB |
random0061.txt |
AC |
1 ms |
256 KB |
random0062.txt |
AC |
1 ms |
256 KB |
random0063.txt |
AC |
1 ms |
256 KB |
random0064.txt |
AC |
1 ms |
256 KB |
random0065.txt |
AC |
1 ms |
256 KB |
random0066.txt |
AC |
2 ms |
256 KB |
random0067.txt |
AC |
1 ms |
256 KB |
random0068.txt |
AC |
2 ms |
256 KB |
random0069.txt |
AC |
2 ms |
256 KB |
random0070.txt |
AC |
1 ms |
256 KB |
random0071.txt |
AC |
1 ms |
256 KB |
random0072.txt |
AC |
2 ms |
256 KB |
random0073.txt |
AC |
1 ms |
256 KB |
random0074.txt |
AC |
1 ms |
256 KB |
random0075.txt |
AC |
2 ms |
256 KB |
random0076.txt |
AC |
1 ms |
256 KB |
random0077.txt |
AC |
1 ms |
256 KB |
random0078.txt |
AC |
1 ms |
256 KB |
random0079.txt |
AC |
1 ms |
256 KB |
random0080.txt |
AC |
1 ms |
256 KB |
random0081.txt |
AC |
1 ms |
256 KB |
random0082.txt |
AC |
1 ms |
256 KB |
random0083.txt |
AC |
2 ms |
256 KB |
random0084.txt |
AC |
2 ms |
256 KB |
random0085.txt |
AC |
1 ms |
256 KB |
random0086.txt |
AC |
1 ms |
256 KB |
random0087.txt |
AC |
1 ms |
256 KB |
random0088.txt |
AC |
1 ms |
256 KB |
random0089.txt |
AC |
1 ms |
256 KB |
random0090.txt |
AC |
2 ms |
256 KB |
random0091.txt |
AC |
1 ms |
256 KB |
random0092.txt |
AC |
1 ms |
256 KB |
random0093.txt |
AC |
1 ms |
256 KB |
random0094.txt |
AC |
2 ms |
256 KB |
random0095.txt |
AC |
1 ms |
256 KB |
random0096.txt |
AC |
2 ms |
256 KB |
random0097.txt |
AC |
1 ms |
256 KB |
random0098.txt |
AC |
2 ms |
256 KB |
random0099.txt |
AC |
1 ms |
256 KB |
random0100.txt |
AC |
1 ms |
256 KB |
random0101.txt |
AC |
2 ms |
256 KB |
random0102.txt |
AC |
2 ms |
256 KB |
random0103.txt |
AC |
1 ms |
256 KB |
random0104.txt |
AC |
1 ms |
256 KB |
random0105.txt |
AC |
1 ms |
256 KB |
random0106.txt |
AC |
1 ms |
256 KB |
random0107.txt |
AC |
1 ms |
256 KB |
random0108.txt |
AC |
1 ms |
256 KB |
random0109.txt |
AC |
1 ms |
256 KB |
sample4.txt |
AC |
1 ms |
256 KB |