Submission #1104000

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>

using namespace std;

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 30;

const int N = 500;
int dp[N][N];

int main() {
  int n, A, B;
  scanf("%d%d%d", &n, &A, &B);
  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      dp[i][j] = INF;
    }
  }
  dp[0][0] = 0;
  int sumA = 0, sumB = 0;
  for (int i = 0; i < n; ++i) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    sumA += a;
    sumB += b;
    for (int i = sumA; i >= a; --i) {
      for (int j = sumB; j >= b; --j) {
        if (dp[i - a][j - b] != INF && (dp[i - a][j - b] + c < dp[i][j] || dp[i][j] < 0)) {
          dp[i][j] = dp[i - a][j - b] + c;
        }
      }
    }
  }
  int ret = INF;
  for (int i = 0; i <= sumA; ++i) {
    for (int j = 0; j <= sumB; ++j) {
      if (i == 0 && j == 0) continue;
      if (i * B == j * A) {
        ret = min(ret, dp[i][j]);
      }
    }
  }
  if (ret == INF) ret = -1;
  printf("%d\n", ret);
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &n, &A, &B);
                              ^
./Main.cpp:41:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &a, &b, &c);
                                ^

Judge Result