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_15048573_26563.cpp: In function 'int find_route(int, int, int)':
0_0_15048573_26563.cpp:56:7: error: reference to 'prev' is ambiguous
       prev[i] = id;
       ^
0_0_15048573_26563.cpp:43:52: note: candidates are: int prev [202]
 int cap[MAXG][MAXG], cost[MAXG][MAXG], dist[MAXG], prev[MAXG];
                                                    ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algobase.h:66:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:61,
                 from 0_0_15048573_26563.cpp:10:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_iterator_base_funcs.h:193:5: note:                 template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
     prev(_BidirectionalIterator __x, typename
     ^
0_0_15048573_26563.cpp:61:35: error: reference to 'prev' is ambiguous
   for (int i = to; i != from; i = prev[i]) {
                                   ^
0_0_15048573_26563.cpp:43:52: note: candidates are: int prev [202]
 int cap[MAXG][MAXG], cost[MAXG][MAXG], dist[MAXG], prev[MAXG];
                                                    ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algobase.h:66:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:61,
                 from 0_0_15048573_26563.cpp:10:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_iterator_base_funcs.h:193:5: note:                 template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
     prev(_BidirectionalIterator __x, typename
     ^
0_0_15048573_26563.cpp:62:11: error: reference to 'prev' is ambiguous
     --cap[prev[i]][i];
           ^
0_0_15048573_26563.cpp:43:52: note: candidates are: int prev [202]
 int cap[MAXG][MAXG], cost[MAXG][MAXG], dist[MAXG], prev[MAXG];
                                                    ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algobase.h:66:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:61,
                 from 0_0_15048573_26563.cpp:10:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_iterator_base_funcs.h:193:5: note:                 template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
     prev(_BidirectionalIterator __x, typename
     ^
0_0_15048573_26563.cpp:63:14: error: reference to 'prev' is ambiguous
     ++cap[i][prev[i]];
              ^
0_0_15048573_26563.cpp:43:52: note: candidates are: int prev [202]
 int cap[MAXG][MAXG], cost[MAXG][MAXG], dist[MAXG], prev[MAXG];
                                                    ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algobase.h:66:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:61,
                 from 0_0_15048573_26563.cpp:10:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_iterator_base_funcs.h:193:5: note:                 template<class _BidirectionalIterator> _BidirectionalIterator std::prev(_BidirectionalIterator, typename std::iterator_traits<_Iter>::difference_type)
     prev(_BidirectionalIterator __x, typename
     ^


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-16 14:21:49, Gzip enabled