F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_29615245_17548.cpp: In function 'void dfs(int, int, int)':
0_0_29615245_17548.cpp:32:55: error: reference to 'map' is ambiguous
         if (xx <= 0 || yy <= 0 || xx > m || yy > n || map[xx][yy] == '*')
                                                       ^
0_0_29615245_17548.cpp:9:6: note: candidates are: char map [110][110]
 char map[110][110];
      ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:61:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/x86_64-w64-mingw32/bits/stdc++.h:80,
                 from 0_0_29615245_17548.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_map.h:96:11: note:                 template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map
     class map
           ^
0_0_29615245_17548.cpp:45:9: error: reference to 'map' is ambiguous
         map[xx][yy] = '*'; //如果这里能走,就把这里变成不能走,然后再从这里开始递归,其实就是起到vis[][] 的作用,会用vis的话就不用追究了
         ^
0_0_29615245_17548.cpp:9:6: note: candidates are: char map [110][110]
 char map[110][110];
      ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:61:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/x86_64-w64-mingw32/bits/stdc++.h:80,
                 from 0_0_29615245_17548.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_map.h:96:11: note:                 template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map
     class map
           ^
0_0_29615245_17548.cpp:47:9: error: reference to 'map' is ambiguous
         map[xx][yy] = '.'; //这里再变成'.',是为了不影响其他的递归过程,因为其他路线可能还要从这里过
         ^
0_0_29615245_17548.cpp:9:6: note: candidates are: char map [110][110]
 char map[110][110];
      ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:61:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/x86_64-w64-mingw32/bits/stdc++.h:80,
                 from 0_0_29615245_17548.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_map.h:96:11: note:                 template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map
     class map
           ^
0_0_29615245_17548.cpp: In function 'int main()':
0_0_29615245_17548.cpp:62:31: error: reference to 'map' is ambiguous
                 scanf(" %c", &map[i][j]);
                               ^
0_0_29615245_17548.cpp:9:6: note: candidates are: char map [110][110]
 char map[110][110];
      ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/map:61:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/x86_64-w64-mingw32/bits/stdc++.h:80,
                 from 0_0_29615245_17548.cpp:1:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_map.h:96:11: note:                 template<class _Key, class _Tp, class _Compare, class _Alloc> class std::map
     class map
           ^
0_0_29615245_17548.cpp:64:22: error: 'Max' was not declared in this scope
         memset(turn, Max, sizeof(turn));             //因为在dfs()中剪枝要去最小的转弯次数,所以turn要初始化成最大
                      ^


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-17 14:28:14, Gzip enabled