#2534
Bogdan
Se dă un șir de n
elemente, numere naturale. Problema constă în două operații:
1 i val
: Elementul de pe poziția i
se înlocuiește cu valoarea val
.
2 i j
: Stabiliți dacă secvența [i,j]
, din șirul curent, este ordonată crescător.
Problema | Bogdan | Operații I/O |
bogdan.in /bogdan.out
|
---|---|---|---|
Limita timp | 0.2 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #42062938 | Utilizator | |
Fișier | bogdan.cpp | Dimensiune | 3.27 KB |
Data încărcării | 14 Februarie 2023, 12:02 | Scor / rezultat | Eroare de compilare |
bogdan.cpp: In function 'void build_tree(int, int, int)': bogdan.cpp:26:20: error: no match for 'operator=' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<Node> >::value_type {aka Node}' and '<brace-enclosed initializer list>') tree[node] = {values[left], values[right], true}; ^ bogdan.cpp:26:20: note: candidates are: bogdan.cpp:5:8: note: Node& Node::operator=(const Node&) struct Node { ^ bogdan.cpp:5:8: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const Node&' bogdan.cpp:5:8: note: Node& Node::operator=(Node&&) bogdan.cpp:5:8: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'Node&&' bogdan.cpp:40:16: error: no match for 'operator=' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<Node> >::value_type {aka Node}' and '<brace-enclosed initializer list>') tree[node] = {tree[2 * node].left_value, tree[2 * node + 1].right_value, ordered}; ^ bogdan.cpp:40:16: note: candidates are: bogdan.cpp:5:8: note: Node& Node::operator=(const Node&) struct Node { ^ bogdan.cpp:5:8: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const Node&' bogdan.cpp:5:8: note: Node& Node::operator=(Node&&) bogdan.cpp:5:8: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'Node&&' bogdan.cpp: In function 'void update(int, int, int, int)': bogdan.cpp:59:16: error: no match for 'operator=' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<Node> >::value_type {aka Node}' and '<brace-enclosed initializer list>') tree[node] = {tree[2 * node].left_value, tree[2 * node + 1].right_value, ordered}; ^ bogdan.cpp:59:16: note: candidates are: bogdan.cpp:5:8: note: Node& Node::operator=(const Node&) struct Node { ^ bogdan.cpp:5:8: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const Node&' bogdan.cpp:5:8: note: Node& Node::operator=(Node&&) bogdan.cpp:5:8: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'Node&&' bogdan.cpp: At global scope: bogdan.cpp:67:23: error: no matching function for call to 'Node::Node(<brace-enclosed initializer list>)' Node none{-1, -1, true}; ^ bogdan.cpp:67:23: note: candidates are: bogdan.cpp:5:8: note: constexpr Node::Node() struct Node { ^ bogdan.cpp:5:8: note: candidate expects 0 arguments, 3 provided bogdan.cpp:5:8: note: constexpr Node::Node(const Node&) bogdan.cpp:5:8: note: candidate expects 1 argument, 3 provided bogdan.cpp:5:8: note: constexpr Node::Node(Node&&) bogdan.cpp:5:8: note: candidate expects 1 argument, 3 provided bogdan.cpp: In function 'Node query(int, int, int, int, int)': bogdan.cpp:71:63: error: could not convert '{-1, -1, true}' from '<brace-enclosed initializer list>' to 'Node' else if (right < start || end < left) return {-1, -1, true}; ^ bogdan.cpp:87:69: error: no matching function for call to 'Node::Node(<brace-enclosed initializer list>)' Node ans{left_query.left_value, right_query.right_value, ordered}; ^ bogdan.cpp:87:69: note: candidates are: bogdan.cpp:5:8: note: constexpr Node::Node() struct Node { ^ bogdan.cpp:5:8: note: candidate expects 0 arguments, 3 provided bogdan.cpp:5:8: note: constexpr Node::Node(const Node&) bogdan.cpp:5:8: note: candidate expects 1 argument, 3 provided bogdan.cpp:5:8: note: constexpr Node::Node(Node&&) bogdan.cpp:5:8: note: candidate expects 1 argument, 3 provided
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Bogdan face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
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ă.