Submission #1518197


Source Code Expand

#include <cstdio>
#include <algorithm>
 
#define ll long long
#define maxn 40
#define maxa 10
#define maxx 5000
 
int d[maxn + 1][maxa * maxn + maxa + 1][maxa * maxn + maxa + 1];
int a[maxn + 1], b[maxn + 1], c[maxn + 1];
 
int main() {
    int n, aa, bb, rez = maxx;
    scanf("%d%d%d", &n, &aa, &bb);
 
    for (int i = 1; i <= n; i++) {
        scanf("%d%d%d", &a[i], &b[i], &c[i]);
    }
 
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j <= maxn * maxa; j++) {
            for (int k = 0; k <= maxn * maxa; k++) {
                d[i][j][k] = maxx;
            }
        }
    }
 
    d[0][0][0] = 0;
 
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= maxn * maxa; j++) {
            for (int k = 0; k <= maxn * maxa; k++) {
                if (d[i - 1][j][k] != maxx) {
                    d[i][j][k] = d[i - 1][j][k];
                    d[i][j + a[i]][k + b[i]] = std::min(d[i][j + a[i]][k + b[i]], d[i - 1][j][k] + c[i]);
                }
            }
        }
    }
    for (int i = 1; i <= maxn * maxa; i++) {
        for (int j = 1; j <= maxn * maxa; j++) {
            if (aa * j == bb * i)
                rez = std::min(rez, d[n][i][j]);
        }
    }
    if(rez != maxx)
        printf("%d", rez);
    else
        printf("-1");
    return 0;
}

Submission Info

Submission Time
Task D - Mixing Experiment
User FizZ
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1342 Byte
Status WA
Exec Time 15 ms
Memory 27136 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &aa, &bb);
                                  ^
./Main.cpp:17:45: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &a[i], &b[i], &c[i]);
                                             ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 14
WA × 6
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.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, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 4224 KB
sample_02.txt AC 1 ms 1408 KB
subtask_1_01.txt AC 3 ms 4224 KB
subtask_1_02.txt AC 2 ms 2048 KB
subtask_1_03.txt AC 3 ms 4224 KB
subtask_1_04.txt AC 4 ms 8320 KB
subtask_1_05.txt WA 5 ms 10368 KB
subtask_1_06.txt AC 7 ms 14464 KB
subtask_1_07.txt AC 8 ms 16512 KB
subtask_1_08.txt AC 8 ms 16512 KB
subtask_1_09.txt WA 10 ms 20608 KB
subtask_1_10.txt AC 12 ms 22656 KB
subtask_1_11.txt WA 14 ms 26752 KB
subtask_1_12.txt AC 15 ms 27136 KB
subtask_1_13.txt AC 14 ms 27136 KB
subtask_1_14.txt WA 15 ms 27136 KB
subtask_1_15.txt WA 14 ms 27136 KB
subtask_1_16.txt AC 15 ms 27136 KB
subtask_1_17.txt WA 14 ms 27136 KB
subtask_1_18.txt AC 15 ms 27136 KB