Submission #1540571
Source Code Expand
#include <cstdio> #include <cstdlib> typedef long long llint; int n; double a[5][5]; llint sol; int main() { a[0][2] = 0.25; a[1][2] = 0.5; a[2][2] = 1; a[3][2] = 2; for (int i = 0; i < 4; ++i) { scanf("%lf", &a[i][0]); a[i][1] = a[i][0] / a[i][2]; } scanf("%d", &n); if (n > 1) { int best = 0; for (int i = 1; i < 4; ++i) { if (a[best][1] > a[i][1]) best = i; } sol += (llint)((double)n / a[best][2]) * a[best][0]; n -= (llint)((double)n / a[best][2]) * a[best][2]; } if (n < 0) { exit(1); } if (n) { int best = 0; for (int i = 1; i < 3; ++i) { if (a[best][1] > a[i][1]) best = i; } sol += (llint)((double)n / a[best][2]) * a[best][0]; } printf("%lld\n", sol); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Ice Tea Store |
User | ltomic |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 770 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:16:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lf", &a[i][0]); ^ ./Main.cpp:19:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^
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 | AC | 1 ms | 128 KB |
sample_02.txt | AC | 1 ms | 128 KB |
sample_03.txt | AC | 1 ms | 128 KB |
sample_04.txt | AC | 1 ms | 128 KB |
subtask_1_01.txt | AC | 1 ms | 128 KB |
subtask_1_02.txt | AC | 1 ms | 128 KB |
subtask_1_03.txt | WA | 1 ms | 128 KB |
subtask_1_04.txt | AC | 1 ms | 128 KB |
subtask_1_05.txt | AC | 0 ms | 128 KB |
subtask_1_06.txt | AC | 1 ms | 128 KB |
subtask_1_07.txt | AC | 1 ms | 128 KB |
subtask_1_08.txt | WA | 1 ms | 128 KB |
subtask_1_09.txt | WA | 1 ms | 128 KB |
subtask_1_10.txt | AC | 1 ms | 128 KB |
subtask_1_11.txt | AC | 1 ms | 128 KB |
subtask_1_12.txt | AC | 1 ms | 128 KB |
subtask_1_13.txt | AC | 1 ms | 128 KB |
subtask_1_14.txt | WA | 1 ms | 128 KB |
subtask_1_15.txt | AC | 1 ms | 128 KB |