Contest Duration: ~ (local time) (120 minutes) Back to Home

Submission #412904

Source Code Expand

Copy
```#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,ll> P;
typedef pair<ll,P> P1;

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define mp1(a,b,c) P1(a,P(b,c))

const int INF=1000000000000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};

int main(){
int a,b,c,k;
int s,t;
cin >> a >> b >> c >> k >> s >> t;
int ret = a*s + b*t;
if(s+t >= k)ret -= (s+t)*c;
cout << ret << endl;
}
```

#### Submission Info

Submission Time 2015-05-23 21:02:06+0900 A - 動物園 yokozuna57 C++11 (GCC 4.9.2) 100 1169 Byte AC 25 ms 928 KB

#### Compile Error

```./Main.cpp:33:15: warning: overflow in implicit constant conversion [-Woverflow]
const int INF=1000000000000000000;
^
```

#### Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
sample_01.txt 24 ms 796 KB
sample_02.txt 22 ms 800 KB
sample_03.txt 24 ms 924 KB