0_0_18079995_14091.cpp: In function 'int bfs(point, point)':
0_0_18079995_14091.cpp:49:86: error: reference to 'hash' is ambiguous
if(t.x >= 1 && t.x <= n && t.y >= 1 && t.y <= m&& t.con <= 2&&t.con <= hash[t.x][t.y])
^
0_0_18079995_14091.cpp:10:5: note: candidates are: int hash [1005][1005]
int hash[1005][1005];/*因为要回搜，<span style="font-family: 'Times New Roman'; font-size: 14px;">记录所有点的最少转弯次数，剪枝使用，比如搜到i点最少转1次，当又回搜改点时转弯是2次</span>
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ostream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/iostream:39,
from 0_0_18079995_14091.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
0_0_18079995_14091.cpp:53:27: error: reference to 'hash' is ambiguous
hash[t.x][t.y] = t.con;
^
0_0_18079995_14091.cpp:10:5: note: candidates are: int hash [1005][1005]
int hash[1005][1005];/*因为要回搜，<span style="font-family: 'Times New Roman'; font-size: 14px;">记录所有点的最少转弯次数，剪枝使用，比如搜到i点最少转1次，当又回搜改点时转弯是2次</span>
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ostream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/iostream:39,
from 0_0_18079995_14091.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
0_0_18079995_14091.cpp:58:26: error: reference to 'hash' is ambiguous
hash[t.x][t.y] = t.con;
^
0_0_18079995_14091.cpp:10:5: note: candidates are: int hash [1005][1005]
int hash[1005][1005];/*因为要回搜，<span style="font-family: 'Times New Roman'; font-size: 14px;">记录所有点的最少转弯次数，剪枝使用，比如搜到i点最少转1次，当又回搜改点时转弯是2次</span>
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ostream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/iostream:39,
from 0_0_18079995_14091.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
0_0_18079995_14091.cpp: In function 'int main()':
0_0_18079995_14091.cpp:91:20: error: reference to 'hash' is ambiguous
memset(hash,0x3f,sizeof(hash));
^
0_0_18079995_14091.cpp:10:5: note: candidates are: int hash [1005][1005]
int hash[1005][1005];/*因为要回搜，<span style="font-family: 'Times New Roman'; font-size: 14px;">记录所有点的最少转弯次数，剪枝使用，比如搜到i点最少转1次，当又回搜改点时转弯是2次</span>
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ostream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/iostream:39,
from 0_0_18079995_14091.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
0_0_18079995_14091.cpp:91:37: error: reference to 'hash' is ambiguous
memset(hash,0x3f,sizeof(hash));
^
0_0_18079995_14091.cpp:10:5: note: candidates are: int hash [1005][1005]
int hash[1005][1005];/*因为要回搜，<span style="font-family: 'Times New Roman'; font-size: 14px;">记录所有点的最少转弯次数，剪枝使用，比如搜到i点最少转1次，当又回搜改点时转弯是2次</span>
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/basic_string.h:3068:0,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/string:52,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/locale_classes.h:40,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/ios_base.h:41,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ios:42,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/ostream:38,
from GCC4.9.2/x86_64-w64-mingw32/include/c++/iostream:39,
from 0_0_18079995_14091.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/functional_hash.h:58:12: note: template<class _Tp> struct std::hash
struct hash;
^
|
