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
Task A - 動物園
User yokozuna57
Language C++11 (GCC 4.9.2)
Score 100
Code Size 1169 Byte
Status
Exec Time 25 ms
Memory 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
All 100 / 100 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.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
subtask1_01.txt 22 ms 920 KB
subtask1_02.txt 22 ms 796 KB
subtask1_03.txt 22 ms 804 KB
subtask1_04.txt 22 ms 800 KB
subtask1_05.txt 22 ms 800 KB
subtask1_06.txt 22 ms 708 KB
subtask1_07.txt 22 ms 800 KB
subtask1_08.txt 22 ms 920 KB
subtask1_09.txt 22 ms 800 KB
subtask1_10.txt 23 ms 804 KB
subtask1_11.txt 23 ms 672 KB
subtask1_12.txt 24 ms 804 KB
subtask1_13.txt 23 ms 800 KB
subtask1_14.txt 25 ms 732 KB
subtask1_15.txt 23 ms 928 KB
subtask1_16.txt 23 ms 924 KB
subtask1_17.txt 23 ms 804 KB
subtask1_18.txt 23 ms 796 KB
subtask1_19.txt 23 ms 924 KB
subtask1_20.txt 23 ms 672 KB
subtask1_21.txt 22 ms 808 KB
subtask1_22.txt 23 ms 676 KB
subtask1_23.txt 23 ms 924 KB
subtask1_24.txt 23 ms 796 KB
subtask1_25.txt 23 ms 928 KB
subtask1_26.txt 23 ms 928 KB
subtask1_27.txt 22 ms 800 KB
subtask1_28.txt 25 ms 796 KB
subtask1_29.txt 24 ms 800 KB