Submission #565988

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
5659882022-05-21 16:03:59TheDeliveratorKnapsack (NOI18_knapsack)C++11
Compilation error
0 ms0 KiB
#include <map>
#include <cstring>
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <algorithm>
#include <cstring>
#include <unordered_map>
#include <fstream>
#include <set>
#include <queue>
using namespace std;
#define ll long long
#define pb push_back
/*
*
* Segment Tree implementation
* Current implementation: Range Minimum Query
*
*/
template <class T> struct SegTree {
/*
* TODO: Now the building of the tree is done by updating values which is done in O(NlogN)
* TODO: Better understand the maths behind the algorithm
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

knapsack.cpp: In static member function 'static void Solver::solve()':
knapsack.cpp:111:84: error: no matching function for call to 'max(int&, long long int)'
  111 |             dp[i][j] = max(dp[i][j], dp[i - 1][tmp - v[i-1][1]] + times * v[i-1][0]);
      |                                                                                    ^
In file included from /usr/include/c++/10/bits/stl_tree.h:63,
                 from /usr/include/c++/10/map:60,
                 from knapsack.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> const _Tp& std::max(const _Tp&, const _Tp&)'
  254 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
knapsack.cpp:111:84: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
  111 |             dp[i][j] = max(dp[i][j], dp[i - 1][tmp - v[i-1][1]] + times * v[i-1][0]);
      |                                                                                    ^
In file included from /usr/include/c++/10/bits/stl_tree.h:63,
                 from /usr/include/c++/10/map:60,
                 from knapsack.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:300:5: note: candidate: 'template<class _Tp, class _Compare> const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  300 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:300:5: note:   template argument deduction/substitution failed:
knapsack.cpp:111:84: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
  111 |             dp[i][j] = max(dp[i][j], dp[i - 1][tmp - v[i-1][1]] + times * v[i-1][0]);
      |                                                                                    ^
In file included from /usr/include/c++/10/algorithm:62,
                 from knapsack.cpp:7:
/usr/include/c++/10/bits/stl_algo.h:3480:5: note: candidate: 'template<class _Tp> _Tp std::max(std::initializer_list<_Tp>)'
 3480 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3480:5: note:   template argument deduction/substitution failed:
knapsack.cpp:111:84: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
  111 |             dp[i][j] = max(dp[i][j], dp[i - 1][tmp - v[i-1][1]] + times * v[i-1][0]);
      |                                                                                    ^
In file included from /usr/include/c++/10/algorithm:62,
                 from knapsack.cpp:7:
/usr/include/c++/10/bits/stl_algo.h:3486:5: note: candidate: 'template<class _Tp, class _Compare> _Tp std::max(std::initializer_list<_Tp>, _Compare)'
 3486 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3486:5: note:   template argument deduction/substitution failed:
knapsack.cpp:111:84: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
  111 |             dp[i][j] = max(dp[i][j], dp[i - 1][tmp - v[i-1][1]] + times * v[i-1][0]);
      |                                                                                    ^