Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #49927537
Rezumat problemă
#1886
Rucsac1
Într-un magazin sunt n obiecte; pentru fiecare se cunoaște greutatea G și valoarea V. Un hoț intră în magazin având un rucsac ce poate transporta o greutate maximă GMax. El va fura anumite obiecte, astfel încât suma greutăților obiectelor furate să nu depășească GMax.
Să se stabilească câștigul maxim pe care îl poate obține hoțul. Câștigul este egal cu suma valorilor obiectelor furate.
Candale Silviu (silviu) Detalii
| Problema | Rucsac1 | Operații I/O |
 tastatură/ecran
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #49927537 | Utilizator |
Manolea Stefan (StefanManolea)
|
| Fișier | rucsac1.cpp | Dimensiune | 640 B |
| Data încărcării | 20 Martie 2024, 10:47 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
rucsac1.cpp: In function 'int main()': rucsac1.cpp:16:9: error: 'fin' was not declared in this scope fin >> objects[i].weight >> objects[i].val; ^ rucsac1.cpp:21:49: error: no match for 'operator-' (operand types are 'int' and 'cv') dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ rucsac1.cpp:21:49: note: candidates are: In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/sstream:38, from /usr/include/c++/4.8/complex:45, from /usr/include/c++/4.8/ccomplex:38, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52, from rucsac1.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:327:5: note: template<class _Iterator> typename std::reverse_iterator<_Iterator>::difference_type std::operator-(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_Iterator>&) operator-(const reverse_iterator<_Iterator>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:327:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::reverse_iterator<_Iterator>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/sstream:38, from /usr/include/c++/4.8/complex:45, from /usr/include/c++/4.8/ccomplex:38, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52, from rucsac1.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:379:5: note: template<class _IteratorL, class _IteratorR> decltype ((__y.base() - __x.base())) std::operator-(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_IteratorR>&) operator-(const reverse_iterator<_IteratorL>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:379:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::reverse_iterator<_Iterator>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/sstream:38, from /usr/include/c++/4.8/complex:45, from /usr/include/c++/4.8/ccomplex:38, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52, from rucsac1.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:1104:5: note: template<class _IteratorL, class _IteratorR> decltype ((__x.base() - __y.base())) std::operator-(const std::move_iterator<_Iterator>&, const std::move_iterator<_IteratorR>&) operator-(const move_iterator<_IteratorL>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:1104:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::move_iterator<_Iterator>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:67:0, from /usr/include/c++/4.8/bits/char_traits.h:39, from /usr/include/c++/4.8/ios:40, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/sstream:38, from /usr/include/c++/4.8/complex:45, from /usr/include/c++/4.8/ccomplex:38, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52, from rucsac1.cpp:1: /usr/include/c++/4.8/bits/stl_iterator.h:1111:5: note: template<class _Iterator> decltype ((__x.base() - __y.base())) std::operator-(const std::move_iterator<_Iterator>&, const std::move_iterator<_Iterator>&) operator-(const move_iterator<_Iterator>& __x, ^ /usr/include/c++/4.8/bits/stl_iterator.h:1111:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::move_iterator<_Iterator>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/ccomplex:38:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52, from rucsac1.cpp:1: /usr/include/c++/4.8/complex:354:5: note: template<class _Tp> std::complex<_Tp> std::operator-(const std::complex<_Tp>&, const std::complex<_Tp>&) operator-(const complex<_Tp>& __x, const complex<_Tp>& __y) ^ /usr/include/c++/4.8/complex:354:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::complex<_Tp>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/ccomplex:38:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52, from rucsac1.cpp:1: /usr/include/c++/4.8/complex:363:5: note: template<class _Tp> std::complex<_Tp> std::operator-(const std::complex<_Tp>&, const _Tp&) operator-(const complex<_Tp>& __x, const _Tp& __y) ^ /usr/include/c++/4.8/complex:363:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::complex<_Tp>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/ccomplex:38:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52, from rucsac1.cpp:1: /usr/include/c++/4.8/complex:372:5: note: template<class _Tp> std::complex<_Tp> std::operator-(const _Tp&, const std::complex<_Tp>&) operator-(const _Tp& __x, const complex<_Tp>& __y) ^ /usr/include/c++/4.8/complex:372:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: 'cv' is not derived from 'const std::complex<_Tp>' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/ccomplex:38:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52, from rucsac1.cpp:1: /usr/include/c++/4.8/complex:449:5: note: template<class _Tp> std::complex<_Tp> std::operator-(const std::complex<_Tp>&) operator-(const complex<_Tp>& __x) ^ /usr/include/c++/4.8/complex:449:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::complex<_Tp>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/vector:65:0, from /usr/include/c++/4.8/bits/random.h:34, from /usr/include/c++/4.8/random:50, from /usr/include/c++/4.8/bits/stl_algo.h:65, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from rucsac1.cpp:1: /usr/include/c++/4.8/bits/stl_bvector.h:208:3: note: std::ptrdiff_t std::operator-(const std::_Bit_iterator_base&, const std::_Bit_iterator_base&) operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) ^ /usr/include/c++/4.8/bits/stl_bvector.h:208:3: note: no known conversion for argument 1 from 'int' to 'const std::_Bit_iterator_base&' In file included from /usr/include/c++/4.8/deque:64:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:67, from rucsac1.cpp:1: /usr/include/c++/4.8/bits/stl_deque.h:331:5: note: template<class _Tp, class _Ref, class _Ptr> typename std::_Deque_iterator<_Tp, _Ref, _Ptr>::difference_type std::operator-(const std::_Deque_iterator<_Tp, _Ref, _Ptr>&, const std::_Deque_iterator<_Tp, _Ref, _Ptr>&) operator-(const _Deque_iterator<_Tp, _Ref, _Ptr>& __x, ^ /usr/include/c++/4.8/bits/stl_deque.h:331:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::_Deque_iterator<_Tp, _Ref, _Ptr>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/deque:64:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:67, from rucsac1.cpp:1: /usr/include/c++/4.8/bits/stl_deque.h:343:5: note: template<class _Tp, class _RefL, class _PtrL, class _RefR, class _PtrR> typename std::_Deque_iterator<_Tp, _Ref, _Ptr>::difference_type std::operator-(const std::_Deque_iterator<_Tp, _Ref, _Ptr>&, const std::_Deque_iterator<_Tp, _RefR, _PtrR>&) operator-(const _Deque_iterator<_Tp, _RefL, _PtrL>& __x, ^ /usr/include/c++/4.8/bits/stl_deque.h:343:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::_Deque_iterator<_Tp, _Ref, _Ptr>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/valarray:587:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:94, from rucsac1.cpp:1: /usr/include/c++/4.8/bits/valarray_after.h:403:5: note: template<class _Dom1, class _Dom2> std::_Expr<std::_BinClos<std::__minus, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const std::_Expr<_Dom2, typename _Dom2::value_type>&) _DEFINE_EXPR_BINARY_OPERATOR(-, __minus) ^ /usr/include/c++/4.8/bits/valarray_after.h:403:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::_Expr<_Dom1, typename _Dom1::value_type>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/valarray:587:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:94, from rucsac1.cpp:1: /usr/include/c++/4.8/bits/valarray_after.h:403:5: note: template<class _Dom> std::_Expr<std::_BinClos<std::__minus, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&) _DEFINE_EXPR_BINARY_OPERATOR(-, __minus) ^ /usr/include/c++/4.8/bits/valarray_after.h:403:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::_Expr<_Dom1, typename _Dom1::value_type>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/valarray:587:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:94, from rucsac1.cpp:1: /usr/include/c++/4.8/bits/valarray_after.h:403:5: note: template<class _Dom> std::_Expr<std::_BinClos<std::__minus, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const typename _Dom::value_type&, const std::_Expr<_Dom1, typename _Dom1::value_type>&) _DEFINE_EXPR_BINARY_OPERATOR(-, __minus) ^ /usr/include/c++/4.8/bits/valarray_after.h:403:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: 'cv' is not derived from 'const std::_Expr<_Dom1, typename _Dom1::value_type>' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/valarray:587:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:94, from rucsac1.cpp:1: /usr/include/c++/4.8/bits/valarray_after.h:403:5: note: template<class _Dom> std::_Expr<std::_BinClos<std::__minus, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const std::_Expr<_Dom1, typename _Dom1::value_type>&, const std::valarray<typename _Dom::value_type>&) _DEFINE_EXPR_BINARY_OPERATOR(-, __minus) ^ /usr/include/c++/4.8/bits/valarray_after.h:403:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::_Expr<_Dom1, typename _Dom1::value_type>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/c++/4.8/valarray:587:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:94, from rucsac1.cpp:1: /usr/include/c++/4.8/bits/valarray_after.h:403:5: note: template<class _Dom> std::_Expr<std::_BinClos<std::__minus, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__minus, typename _Dom1::value_type>::result_type> std::operator-(const std::valarray<typename _Dom::value_type>&, const std::_Expr<_Dom1, typename _Dom1::value_type>&) _DEFINE_EXPR_BINARY_OPERATOR(-, __minus) ^ /usr/include/c++/4.8/bits/valarray_after.h:403:5: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::valarray<typename _Dom::value_type>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:94:0, from rucsac1.cpp:1: /usr/include/c++/4.8/valarray:1168:1: note: template<class _Tp> std::_Expr<std::_BinClos<std::__minus, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const std::valarray<_Tp>&, const std::valarray<_Tp>&) _DEFINE_BINARY_OPERATOR(-, __minus) ^ /usr/include/c++/4.8/valarray:1168:1: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::valarray<_Tp>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:94:0, from rucsac1.cpp:1: /usr/include/c++/4.8/valarray:1168:1: note: template<class _Tp> std::_Expr<std::_BinClos<std::__minus, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const std::valarray<_Tp>&, const _Tp&) _DEFINE_BINARY_OPERATOR(-, __minus) ^ /usr/include/c++/4.8/valarray:1168:1: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: mismatched types 'const std::valarray<_Tp>' and 'int' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^ In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:94:0, from rucsac1.cpp:1: /usr/include/c++/4.8/valarray:1168:1: note: template<class _Tp> std::_Expr<std::_BinClos<std::__minus, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__minus, _Tp>::result_type> std::operator-(const _Tp&, const std::valarray<_Tp>&) _DEFINE_BINARY_OPERATOR(-, __minus) ^ /usr/include/c++/4.8/valarray:1168:1: note: template argument deduction/substitution failed: rucsac1.cpp:21:61: note: 'cv' is not derived from 'const std::valarray<_Tp>' dp[i][j] = max(dp[i-1][j],dp[i-1][j-objects[i-1]]+objects[i-1].val); ^
Cum funcționează evaluarea?
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
- probleme la care rezolvarea presupune scrierea unui program complet
- probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.
Problema Rucsac1 face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
- Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
- Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.