Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #62909720
Rezumat problemă
#4213
În vârful muntelui Acrom trăiesc pe timpul verii K pitici, numerotaţi de la 1 la K. Pe munte există N cabane, aflate la altitudini diferite, legate între ele de M poteci. Cabana piticilor este numerotată cu 1, iar cabana de la poalele muntelui cu N. Fiindcă iarna este prea frig, piticii se mută în cabana de la poalele muntelui, unde este mai cald. Piticii sunt disciplinaţi şi coboară de pe munte în ordinea crescătoare a numerelor lor. Scrieţi un program care să determine lungimea drumului ales de fiecare pitic, drum ce respectă condiţiile din enunţ.
Lot informatică, Ploiești, 2006
Pracsiu Dan (dnprx) Detalii
| Problema | pitici1 | Operații I/O |
pitici.in/pitici.out
|
|---|---|---|---|
| Limita timp | 0.5 secunde | Limita memorie |
Total: 128 MB
/
Stivă 64 MB
|
| Id soluție | #62909720 | Utilizator |
mhmed mesrane (mhmedmesrane)
|
| Fișier | pitici1.cpp | Dimensiune | 2.26 KB |
| Data încărcării | 06 Februarie 2026, 00:36 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
pitici1.cpp: In function 'void compute_dist()': pitici1.cpp:15:19: error: expected unqualified-id before '[' token for (auto [v, w] : g[u]) ^ pitici1.cpp:15:19: error: expected ';' before '[' token pitici1.cpp:15:20: error: 'v' was not declared in this scope for (auto [v, w] : g[u]) ^ pitici1.cpp:15:23: error: 'w' was not declared in this scope for (auto [v, w] : g[u]) ^ pitici1.cpp: In lambda function: pitici1.cpp:15:26: error: expected '{' before ':' token for (auto [v, w] : g[u]) ^ pitici1.cpp: In function 'void compute_dist()': pitici1.cpp:15:26: error: expected ';' before ':' token pitici1.cpp:15:26: error: expected primary-expression before ':' token pitici1.cpp:15:26: error: expected ')' before ':' token pitici1.cpp:15:26: error: expected primary-expression before ':' token pitici1.cpp:15:26: error: expected ';' before ':' token pitici1.cpp:28:19: error: expected unqualified-id before '[' token for (auto [v, w] : g[u]) { ^ pitici1.cpp:28:19: error: expected ';' before '[' token pitici1.cpp:28:20: error: 'v' was not declared in this scope for (auto [v, w] : g[u]) { ^ pitici1.cpp:28:23: error: 'w' was not declared in this scope for (auto [v, w] : g[u]) { ^ pitici1.cpp: In lambda function: pitici1.cpp:28:26: error: expected '{' before ':' token for (auto [v, w] : g[u]) { ^ pitici1.cpp: In function 'void compute_dist()': pitici1.cpp:28:26: error: expected ';' before ':' token pitici1.cpp:28:26: error: expected primary-expression before ':' token pitici1.cpp:28:26: error: expected ')' before ':' token pitici1.cpp:28:26: error: expected primary-expression before ':' token pitici1.cpp:28:26: error: expected ';' before ':' token pitici1.cpp:39:19: error: expected unqualified-id before '[' token for (auto [v, w] : g[u]) { ^ pitici1.cpp:39:19: error: expected ';' before '[' token pitici1.cpp:39:20: error: 'v' was not declared in this scope for (auto [v, w] : g[u]) { ^ pitici1.cpp:39:23: error: 'w' was not declared in this scope for (auto [v, w] : g[u]) { ^ pitici1.cpp: In lambda function: pitici1.cpp:39:26: error: expected '{' before ':' token for (auto [v, w] : g[u]) { ^ pitici1.cpp: In function 'void compute_dist()': pitici1.cpp:39:26: error: expected ';' before ':' token pitici1.cpp:39:26: error: expected primary-expression before ':' token pitici1.cpp:39:26: error: expected ')' before ':' token pitici1.cpp:39:26: error: expected primary-expression before ':' token pitici1.cpp:39:26: error: expected ';' before ':' token pitici1.cpp:38:13: warning: unused variable 'u' [-Wunused-variable] int u = topo[i]; ^ pitici1.cpp: In function 'int main()': pitici1.cpp:71:24: error: parameter declared 'auto' [&](auto &x, auto &y) { ^ pitici1.cpp:71:33: error: parameter declared 'auto' [&](auto &x, auto &y) { ^ pitici1.cpp: In lambda function: pitici1.cpp:72:30: error: 'x' was not declared in this scope return dist[x.first] + x.second < dist[y.first] + y.second; ^ pitici1.cpp:72:57: error: 'y' was not declared in this scope return dist[x.first] + x.second < dist[y.first] + y.second; ^ pitici1.cpp: In function 'int main()': pitici1.cpp:82:14: error: expected unqualified-id before '[' token auto [cost, u, idx] = pq.top(); pq.pop(); ^ pitici1.cpp:84:13: error: 'u' was not declared in this scope if (u == N) { ^ pitici1.cpp:85:30: error: 'cost' was not declared in this scope answer.push_back(cost); ^ pitici1.cpp:89:13: error: 'idx' was not declared in this scope if (idx < (int)g[u].size()) { ^ pitici1.cpp:89:26: error: 'u' was not declared in this scope if (idx < (int)g[u].size()) { ^ pitici1.cpp:90:18: error: expected unqualified-id before '[' token auto [v, w] = g[u][idx]; ^ pitici1.cpp:91:22: error: 'cost' was not declared in this scope pq.push({cost - dist[u] + w + dist[v], v, 0}); ^ pitici1.cpp:91:39: error: 'w' was not declared in this scope pq.push({cost - dist[u] + w + dist[v], v, 0}); ^ pitici1.cpp:91:48: error: 'v' was not declared in this scope pq.push({cost - dist[u] + w + dist[v], v, 0}); ^ pitici1.cpp:91:57: error: no matching function for call to 'std::priority_queue<State, std::vector<State>, std::greater<State> >::push(<brace-enclosed initializer list>)' pq.push({cost - dist[u] + w + dist[v], v, 0}); ^ pitici1.cpp:91:57: note: candidates are: In file included from /usr/include/c++/4.8/queue:64:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:85, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_queue.h:496:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = State; _Sequence = std::vector<State>; _Compare = std::greater<State>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = State] push(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:496:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const State&}' /usr/include/c++/4.8/bits/stl_queue.h:504:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = State; _Sequence = std::vector<State>; _Compare = std::greater<State>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = State] push(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:504:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<State, std::vector<State>, std::greater<State> >::value_type&& {aka State&&}' pitici1.cpp:92:39: error: no matching function for call to 'std::priority_queue<State, std::vector<State>, std::greater<State> >::push(<brace-enclosed initializer list>)' pq.push({cost, u, idx + 1}); ^ pitici1.cpp:92:39: note: candidates are: In file included from /usr/include/c++/4.8/queue:64:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:85, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_queue.h:496:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = State; _Sequence = std::vector<State>; _Compare = std::greater<State>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = State] push(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:496:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const State&}' /usr/include/c++/4.8/bits/stl_queue.h:504:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = State; _Sequence = std::vector<State>; _Compare = std::greater<State>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = State] push(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:504:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<State, std::vector<State>, std::greater<State> >::value_type&& {aka State&&}' In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]': /usr/include/c++/4.8/bits/stl_algo.h:2226:70: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]' pitici1.cpp:73:15: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda7) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__i, *__first)) ^ pitici1.cpp:71:16: note: candidates are: [&](auto &x, auto &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: candidate expects 1 argument, 3 provided pitici1.cpp:71:34: note: main()::__lambda7 [&](auto &x, auto &y) { ^ pitici1.cpp:71:34: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]': /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Size = int; _Compare = main()::__lambda7]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]' pitici1.cpp:73:15: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda7) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__i, *__first)) ^ pitici1.cpp:71:16: note: candidates are: [&](auto &x, auto &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: candidate expects 1 argument, 3 provided pitici1.cpp:71:34: note: main()::__lambda7 [&](auto &x, auto &y) { ^ pitici1.cpp:71:34: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]': /usr/include/c++/4.8/bits/stl_algo.h:2295:13: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Size = int; _Compare = main()::__lambda7]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]' pitici1.cpp:73:15: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda7) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__a, *__b)) ^ pitici1.cpp:71:16: note: candidates are: [&](auto &x, auto &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: void (*)() <conversion> if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: candidate expects 1 argument, 3 provided pitici1.cpp:71:34: note: main()::__lambda7 [&](auto &x, auto &y) { ^ pitici1.cpp:71:34: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda7) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__b, *__c)) ^ pitici1.cpp:71:16: note: candidates are: [&](auto &x, auto &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: void (*)() <conversion> if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: candidate expects 1 argument, 3 provided pitici1.cpp:71:34: note: main()::__lambda7 [&](auto &x, auto &y) { ^ pitici1.cpp:71:34: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda7) (std::pair<int, int>&, std::pair<int, int>&)' else if (__comp(*__a, *__c)) ^ pitici1.cpp:71:16: note: candidates are: [&](auto &x, auto &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: candidate expects 1 argument, 3 provided pitici1.cpp:71:34: note: main()::__lambda7 [&](auto &x, auto &y) { ^ pitici1.cpp:71:34: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda7) (std::pair<int, int>&, std::pair<int, int>&)' else if (__comp(*__a, *__c)) ^ pitici1.cpp:71:16: note: candidates are: [&](auto &x, auto &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: candidate expects 1 argument, 3 provided pitici1.cpp:71:34: note: main()::__lambda7 [&](auto &x, auto &y) { ^ pitici1.cpp:71:34: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda7) (std::pair<int, int>&, std::pair<int, int>&)' else if (__comp(*__b, *__c)) ^ pitici1.cpp:71:16: note: candidates are: [&](auto &x, auto &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: void (*)() <conversion> else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: candidate expects 1 argument, 3 provided pitici1.cpp:71:34: note: main()::__lambda7 [&](auto &x, auto &y) { ^ pitici1.cpp:71:34: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Tp = std::pair<int, int>; _Compare = main()::__lambda7]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Size = int; _Compare = main()::__lambda7]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]' pitici1.cpp:73:15: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda7) (std::pair<int, int>&, const std::pair<int, int>&)' while (__comp(*__first, __pivot)) ^ pitici1.cpp:71:16: note: candidates are: [&](auto &x, auto &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: void (*)() <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 1 argument, 3 provided pitici1.cpp:71:34: note: main()::__lambda7 [&](auto &x, auto &y) { ^ pitici1.cpp:71:34: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda7) (const std::pair<int, int>&, std::pair<int, int>&)' while (__comp(__pivot, *__last)) ^ pitici1.cpp:71:16: note: candidates are: [&](auto &x, auto &y) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: void (*)() <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 1 argument, 3 provided pitici1.cpp:71:34: note: main()::__lambda7 [&](auto &x, auto &y) { ^ pitici1.cpp:71:34: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Distance = int; _Tp = std::pair<int, int>; _Compare = main()::__lambda7]': /usr/include/c++/4.8/bits/stl_heap.h:448:15: required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]' /usr/include/c++/4.8/bits/stl_algo.h:1946:47: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]' /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Size = int; _Compare = main()::__lambda7]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]' pitici1.cpp:73:15: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda7) (std::pair<int, int>&, std::pair<int, int>&)' *(__first + (__secondChild - 1)))) ^ pitici1.cpp:71:16: note: candidates are: [&](auto &x, auto &y) { ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: void (*)() <conversion> *(__first + (__secondChild - 1)))) ^ /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: candidate expects 1 argument, 3 provided pitici1.cpp:71:34: note: main()::__lambda7 [&](auto &x, auto &y) { ^ pitici1.cpp:71:34: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h: At global scope: /usr/include/c++/4.8/bits/stl_algo.h:2110:5: error: 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]', declared using local type 'main()::__lambda7', is used but never defined [-fpermissive] __unguarded_linear_insert(_RandomAccessIterator __last, ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from pitici1.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h:331:5: error: 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda7]', declared using local type 'main()::__lambda7', is used but never defined [-fpermissive] __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, ^ /usr/include/c++/4.8/bits/stl_heap.h:178:5: error: 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Distance = int; _Tp = std::pair<int, int>; _Compare = main()::__lambda7]', declared using local type 'main()::__lambda7', is used but never defined [-fpermissive] __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, ^
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 pitici1 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ă.