Submission #1540551
Source Code Expand
#include<iostream> #include<cstdio> #include<algorithm> using namespace std; long long ans; struct abc{ int cst; int vol; bool operator<(abc u)const { return cst*vol<u.cst*u.vol; } }a[4]; int n; int main() { int t=8; for(int i=1;i<=4;i++) { scanf("%d",&a[i].cst); a[i].vol=t; t/=2; } sort(a+1,a+4+1); scanf("%d",&n); for(int i=1;i<=4;i++) { if(a[i].vol>=2) { ans+=(long long)n*a[i].vol/2*a[i].cst; break; } else { ans+=(long long)n/2*a[i].cst; n%=2; } } printf("%lld",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Ice Tea Store |
User | ASSWECAN |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 576 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:20:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&a[i].cst); ^ ./Main.cpp:25:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:21:13: warning: iteration 3u invokes undefined behavior [-Waggressive-loop-optimizations] a[i].vol=t; ^ ./Main.cpp:18:15: note: containing loop for(int i=1;i<=4;i++) ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | WA | 1 ms | 256 KB |
sample_02.txt | WA | 1 ms | 256 KB |
sample_03.txt | WA | 1 ms | 256 KB |
sample_04.txt | WA | 1 ms | 256 KB |
subtask_1_01.txt | WA | 1 ms | 256 KB |
subtask_1_02.txt | WA | 1 ms | 256 KB |
subtask_1_03.txt | WA | 1 ms | 256 KB |
subtask_1_04.txt | WA | 1 ms | 256 KB |
subtask_1_05.txt | WA | 1 ms | 256 KB |
subtask_1_06.txt | WA | 1 ms | 256 KB |
subtask_1_07.txt | WA | 1 ms | 256 KB |
subtask_1_08.txt | WA | 1 ms | 256 KB |
subtask_1_09.txt | WA | 1 ms | 256 KB |
subtask_1_10.txt | WA | 1 ms | 256 KB |
subtask_1_11.txt | WA | 1 ms | 256 KB |
subtask_1_12.txt | WA | 1 ms | 256 KB |
subtask_1_13.txt | WA | 1 ms | 256 KB |
subtask_1_14.txt | WA | 1 ms | 256 KB |
subtask_1_15.txt | WA | 1 ms | 256 KB |