Submission #1369839
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
//--------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define LL long long
#define INF INT_MAX/3
//--------------------------------------------
const double EPS = 1e-14;
const double PI = acos(-1.0);
//--------------------------------------------
int main(){
int a,b,c,k;
int s,t;
scanf("%d %d %d %d",&a,&b,&c,&k);
scanf("%d %d",&s,&t);
if (s + t >= k) printf("%d\n",s * a + b * t - (s + t) * c);
else printf("%d\n",s * a + b * t);
}
Submission Info
Submission Time
2017-06-22 11:10:31+0900
Task
A - 動物園
User
croonalullaby
Language
C++14 (GCC 5.4.1)
Score
100
Code Size
671 Byte
Status
AC
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:21:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d %d",&a,&b,&c,&k);
^
./Main.cpp:22:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&s,&t);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
100 / 100
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt, sample_03.txt
All
sample_01.txt, sample_02.txt, sample_03.txt, 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
AC
1 ms
256 KB
sample_02.txt
AC
1 ms
256 KB
sample_03.txt
AC
1 ms
256 KB
subtask1_01.txt
AC
1 ms
256 KB
subtask1_02.txt
AC
1 ms
256 KB
subtask1_03.txt
AC
1 ms
256 KB
subtask1_04.txt
AC
1 ms
256 KB
subtask1_05.txt
AC
1 ms
256 KB
subtask1_06.txt
AC
1 ms
256 KB
subtask1_07.txt
AC
1 ms
256 KB
subtask1_08.txt
AC
1 ms
256 KB
subtask1_09.txt
AC
1 ms
256 KB
subtask1_10.txt
AC
1 ms
256 KB
subtask1_11.txt
AC
1 ms
256 KB
subtask1_12.txt
AC
1 ms
256 KB
subtask1_13.txt
AC
1 ms
256 KB
subtask1_14.txt
AC
1 ms
256 KB
subtask1_15.txt
AC
1 ms
256 KB
subtask1_16.txt
AC
1 ms
256 KB
subtask1_17.txt
AC
1 ms
256 KB
subtask1_18.txt
AC
1 ms
256 KB
subtask1_19.txt
AC
1 ms
256 KB
subtask1_20.txt
AC
1 ms
256 KB
subtask1_21.txt
AC
1 ms
256 KB
subtask1_22.txt
AC
1 ms
256 KB
subtask1_23.txt
AC
1 ms
256 KB
subtask1_24.txt
AC
1 ms
256 KB
subtask1_25.txt
AC
1 ms
256 KB
subtask1_26.txt
AC
1 ms
256 KB
subtask1_27.txt
AC
1 ms
256 KB
subtask1_28.txt
AC
1 ms
256 KB
subtask1_29.txt
AC
1 ms
256 KB