Submission #1267087

#	Time	Username	Problem	Language	Result	Execution time	Memory
1267087		minhmc2019	Knapsack (NOI18_knapsack)	C++17	Compilation error	0 ms	0 KiB

knapsack

#include <bits/stdc++.h>
#define FOR(i, l, r, x) for(int i = l; i <= r; i += x)
#define FOD(i, l, r, x) for(int i = l; i >= r; i -= x)
#define debug(x) cout << "[DEBUG]:  " << #x << " = " << x << endl;
#define _double_vector_ vector<vector<int>>
#define BIT(x) (1LL << (x))
#define pii pair<int, int>
#define fi first
#define se second
//#define int long long
using namespace std;

const int N = 5e6 + 5;
const int mod = 1e9 + 7;

int S, n;
vector <pii> items;

void solve() {
    cin >> S >> n; items.reserve(N);
    FOR(_, 1, n, 1) {
        int v, w, k; cin >> v >> w >> k;
        int lim = min(S / w, k);

        if (lim == 0) continue;

        int tmp = __lg(lim);

        FOR(i, 0, tmp, 1) {
            int mul = min(BIT(i), k);
            int cur_v = v * mul;
            int cur_w = w * mul;

            items.push_back({cur_w, cur_v});

            k -= mul;

            if (k == 0) break;
        }
    }

    int sz = items.size();

    _double_vector_ dp(3, vector<int>(S + 3));
    dp[0][0] = 0;


    int i = 0;
    for(const pii &x : items) {
        int w = x.fi;
        int v = x.se;

//        cout << v << " " << w << '\n';

        ++i;

        FOR(k, 0, S, 1) {
            dp[i & 1][k] = dp[(i - 1) & 1][k];
            if (k >= w) {
                dp[i & 1][k] = max(dp[i & 1][k], dp[(i - 1) & 1][k - w] + v);
            }
        }

    }

//
//    FOR(i, 1, sz, 1) {
//        FOR(k, 0, S, 1) {
//            cout << dp[i][k] << " ";
//        }
//        cout << '\n';
//    }

    cout << dp[sz & 1][S] << '\n';
}

signed main() {
    #define name "task"
    if (ifstream(name".inp")) {
        freopen(name".inp", "r", stdin);
        freopen(name".out", "w", stdout);
    }

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();
}

Compilation message (stderr)

knapsack.cpp: In function 'void solve()':
knapsack.cpp:30:26: error: no matching function for call to 'min(long long int, int&)'
   30 |             int mul = min(BIT(i), k);
      |                       ~~~^~~~~~~~~~~
In file included from /usr/include/c++/11/bits/specfun.h:45,
                 from /usr/include/c++/11/cmath:1935,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:41,
                 from knapsack.cpp:1:
/usr/include/c++/11/bits/stl_algobase.h:230:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  230 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/11/bits/stl_algobase.h:230:5: note:   template argument deduction/substitution failed:
knapsack.cpp:30:26: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   30 |             int mul = min(BIT(i), k);
      |                       ~~~^~~~~~~~~~~
In file included from /usr/include/c++/11/bits/specfun.h:45,
                 from /usr/include/c++/11/cmath:1935,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:41,
                 from knapsack.cpp:1:
/usr/include/c++/11/bits/stl_algobase.h:278:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  278 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/11/bits/stl_algobase.h:278:5: note:   template argument deduction/substitution failed:
knapsack.cpp:30:26: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   30 |             int mul = min(BIT(i), k);
      |                       ~~~^~~~~~~~~~~
In file included from /usr/include/c++/11/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from knapsack.cpp:1:
/usr/include/c++/11/bits/stl_algo.h:3449:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)'
 3449 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/11/bits/stl_algo.h:3449:5: note:   template argument deduction/substitution failed:
knapsack.cpp:30:26: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   30 |             int mul = min(BIT(i), k);
      |                       ~~~^~~~~~~~~~~
In file included from /usr/include/c++/11/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from knapsack.cpp:1:
/usr/include/c++/11/bits/stl_algo.h:3455:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)'
 3455 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/11/bits/stl_algo.h:3455:5: note:   template argument deduction/substitution failed:
knapsack.cpp:30:26: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   30 |             int mul = min(BIT(i), k);
      |                       ~~~^~~~~~~~~~~
knapsack.cpp: In function 'int main()':
knapsack.cpp:80:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |         freopen(name".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
knapsack.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         freopen(name".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~