#4607
Astar
Se dă o hartă de NxN
care conține spații libere (notate cu '.'
) și spații ocupate (notate cu '#'
). Să se răspundă la Q
interogări de forma i1 j1 i2 j2
, unde se dorește să se afle distanța minimă de la celula (i1, j1)
la celula (i2, j2)
.
Problema | Astar | Operații I/O | tastatură/ecran |
---|---|---|---|
Limita timp | 3.5 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #49922009 | Utilizator | |
Fișier | astar.cpp | Dimensiune | 3.01 KB |
Data încărcării | 20 Martie 2024, 08:25 | Scor / rezultat | Eroare de compilare |
astar.cpp: In function 'int AStar(int, int, int, int)': astar.cpp:47:13: error: reference to 'distance' is ambiguous distance[i][j] = INF; ^ astar.cpp:14:5: note: candidates are: int distance [690][690] int distance[MAX_N][MAX_N]; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66: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/ostream:38, from /usr/include/c++/4.8/iostream:39, from astar.cpp:1: /usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:114:5: note: template<class _InputIterator> typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator) distance(_InputIterator __first, _InputIterator __last) ^ astar.cpp:55:5: error: reference to 'distance' is ambiguous distance[startX][startY] = 0; ^ astar.cpp:14:5: note: candidates are: int distance [690][690] int distance[MAX_N][MAX_N]; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66: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/ostream:38, from /usr/include/c++/4.8/iostream:39, from astar.cpp:1: /usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:114:5: note: template<class _InputIterator> typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator) distance(_InputIterator __first, _InputIterator __last) ^ astar.cpp:71:28: error: 'dx' was not declared in this scope int newX = x + dx[i]; ^ astar.cpp:72:28: error: 'dy' was not declared in this scope int newY = y + dy[i]; ^ astar.cpp:81:28: error: reference to 'distance' is ambiguous if (newF < distance[newX][newY]) { ^ astar.cpp:14:5: note: candidates are: int distance [690][690] int distance[MAX_N][MAX_N]; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66: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/ostream:38, from /usr/include/c++/4.8/iostream:39, from astar.cpp:1: /usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:114:5: note: template<class _InputIterator> typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator) distance(_InputIterator __first, _InputIterator __last) ^ astar.cpp:82:21: error: reference to 'distance' is ambiguous distance[newX][newY] = newF; ^ astar.cpp:14:5: note: candidates are: int distance [690][690] int distance[MAX_N][MAX_N]; ^ In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66: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/ostream:38, from /usr/include/c++/4.8/iostream:39, from astar.cpp:1: /usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:114:5: note: template<class _InputIterator> typename std::iterator_traits<_Iterator>::difference_type std::distance(_InputIterator, _InputIterator) distance(_InputIterator __first, _InputIterator __last) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Astar 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ă.