Contest Duration: - (local time) (100 minutes) Back to Home

Submission #13926103

Source Code Expand

Copy
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
#define int  long long
#define inf  1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define PI 3.14159265358979323846
#define  mp make_pair
#define  pb push_back
#define EPS (1e-8)

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;
int 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);
}

};

string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}

int Gcd(int v,int b){
if(v==0) return b;
if(b==0) return v;
if(v>b) return Gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return Gcd(v,b%v);
}

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;
}
pa operator+(const pa & l,const pa & r) {
return {l.first+r.first,l.second+r.second};
}
pa operator-(const pa & l,const pa & r) {
return {l.first-r.first,l.second-r.second};
}
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;
}

int pr[1000100];
int inv[1000110];

int comb(int nn,int rr){
if(rr<0 || rr>nn || nn<0) return 0;
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]=((ll)pr[i-1]*i)%mod;
}
inv[ert]=beki(pr[ert],mod-2,mod);
for(int i=ert-1;i>=0;i--){
inv[i]=(ll)inv[i+1]*(i+1)%mod;
}
}

//   cin.tie(0);
//	ios::sync_with_stdio(false);
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
//   mt19937(clock_per_sec);

signed main(){
cin.tie(0);
ios::sync_with_stdio(false);

cpp_int x;
x.assign("10");

queue<cpp_int>qu;

int n;
cin>>n;
for(int i=0;i<n;i++){
cpp_int x;
cin>>x;
qu.push(x);
}
while(qu.size()>1){
cpp_int x=qu.front();
qu.pop();
cpp_int y=qu.front();
qu.pop();
qu.push(x*y);

}
cpp_int z=qu.front();
if(z>1000000000000000000ll)z=-1;
cout<<z<<endl;
return 0;
}

#### Submission Info

Submission Time 2020-06-01 21:08:51+0900 B - Multiplication 2 smiken C++ (GCC 9.2.1) 0 8549 Byte TLE 2205 ms 6828 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
 AC × 3
 AC × 18 TLE × 6
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All hand_01.txt, hand_02.txt, max_01.txt, max_02.txt, random_01.txt, random_02.txt, random_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, small11_02.txt, small11_03.txt, small11_04.txt, small12_02.txt, small12_03.txt, small12_04.txt, small21_01.txt, small21_02.txt, small21_03.txt, small22_01.txt, small22_02.txt, small22_03.txt, zero_01.txt, zero_02.txt
Case Name Status Exec Time Memory
hand_01.txt AC 9 ms 3616 KB
hand_02.txt AC 2 ms 3656 KB
max_01.txt TLE 2205 ms 6828 KB
max_02.txt AC 21 ms 6668 KB
random_01.txt TLE 2205 ms 6136 KB
random_02.txt TLE 2205 ms 5764 KB
random_03.txt TLE 2205 ms 5568 KB
sample_01.txt AC 2 ms 3652 KB
sample_02.txt AC 2 ms 3556 KB
sample_03.txt AC 4 ms 3680 KB
small11_02.txt AC 2 ms 3652 KB
small11_03.txt AC 2 ms 3500 KB
small11_04.txt AC 2 ms 3564 KB
small12_02.txt AC 2 ms 3584 KB
small12_03.txt AC 2 ms 3500 KB
small12_04.txt AC 2 ms 3656 KB
small21_01.txt AC 18 ms 6664 KB
small21_02.txt AC 21 ms 6656 KB
small21_03.txt AC 18 ms 6640 KB
small22_01.txt AC 20 ms 6636 KB
small22_02.txt AC 20 ms 6660 KB
small22_03.txt AC 18 ms 6644 KB
zero_01.txt TLE 2205 ms 6756 KB
zero_02.txt TLE 2205 ms 6652 KB