Borderou de evaluare (job #1618114)

Utilizator GeanaVladGeana Vlad GeanaVlad Data 27 februarie 2016 18:18:53
Problema Vis Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: user.cpp: In function ‘bool OK()’: user.cpp:24:40: error: reference to ‘prev’ is ambiguous if((a[c[i].x+dx[k]][c[i].y+dy[k]]<=prev[c[i].x][c[i].y] || a[c[i].x+dx[k]][c[i].y+dy[k]]>=prev2[c[i].x][c[i].y]) && a[c[i].x+dx[k]][c[i].y+dy[k]]!=-1 ) ^ user.cpp:6:51: note: candidates are: int prev [1000][1000] int n,i,j,n1,ok,l1,c1,l2,c2,k,k1,k2,a[1000][1000],prev[1000][1000],prev2[1000][1000],dx[4]= {1,-1,0,0},dy[4]= {0,0,-1,1}; ^ 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 user.cpp:1: /usr/include/c++/4.8/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 ^ user.cpp: In function ‘int main()’: user.cpp:45:17: error: reference to ‘prev’ is ambiguous prev[c[n1].x][c[n1].y]=prev[c[i].x][c[i].y]; ^ user.cpp:6:51: note: candidates are: int prev [1000][1000] int n,i,j,n1,ok,l1,c1,l2,c2,k,k1,k2,a[1000][1000],prev[1000][1000],prev2[1000][1000],dx[4]= {1,-1,0,0},dy[4]= {0,0,-1,1}; ^ 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 user.cpp:1: /usr/include/c++/4.8/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 ^ user.cpp:45:40: error: reference to ‘prev’ is ambiguous prev[c[n1].x][c[n1].y]=prev[c[i].x][c[i].y]; ^ user.cpp:6:51: note: candidates are: int prev [1000][1000] int n,i,j,n1,ok,l1,c1,l2,c2,k,k1,k2,a[1000][1000],prev[1000][1000],prev2[1000][1000],dx[4]= {1,-1,0,0},dy[4]= {0,0,-1,1}; ^ 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 user.cpp:1: /usr/include/c++/4.8/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 ^ user.cpp:47:44: error: reference to ‘prev’ is ambiguous if(c[i].x==l1&&c[i].y==c1) prev[c[n1].x][c[n1].y]=k1; ^

Ceva nu functioneaza?