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_15598004_20507.cpp: In function 'void getBound(Point*, int&, bool)':
0_0_15598004_20507.cpp:75:5: error: reference to 'stack' is ambiguous
     stack[0] = 0;
     ^
0_0_15598004_20507.cpp:28:8: note: candidates are: int stack [100010]
 int n, stack[MAXN], top;
        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/stack:61:0,
                 from 0_0_15598004_20507.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_stack.h:99:11: note:                 template<class _Tp, class _Sequence> class std::stack
     class stack
           ^
0_0_15598004_20507.cpp:76:5: error: reference to 'stack' is ambiguous
     stack[1] = 1;
     ^
0_0_15598004_20507.cpp:28:8: note: candidates are: int stack [100010]
 int n, stack[MAXN], top;
        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/stack:61:0,
                 from 0_0_15598004_20507.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_stack.h:99:11: note:                 template<class _Tp, class _Sequence> class std::stack
     class stack
           ^
0_0_15598004_20507.cpp:82:43: error: reference to 'stack' is ambiguous
             while(top >= 2 && cross(point[stack[top-2]], point[i], point[stack[top-1]]) < 0)
                                           ^
0_0_15598004_20507.cpp:28:8: note: candidates are: int stack [100010]
 int n, stack[MAXN], top;
        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/stack:61:0,
                 from 0_0_15598004_20507.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_stack.h:99:11: note:                 template<class _Tp, class _Sequence> class std::stack
     class stack
           ^
0_0_15598004_20507.cpp:82:74: error: reference to 'stack' is ambiguous
             while(top >= 2 && cross(point[stack[top-2]], point[i], point[stack[top-1]]) < 0)
                                                                          ^
0_0_15598004_20507.cpp:28:8: note: candidates are: int stack [100010]
 int n, stack[MAXN], top;
        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/stack:61:0,
                 from 0_0_15598004_20507.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_stack.h:99:11: note:                 template<class _Tp, class _Sequence> class std::stack
     class stack
           ^
0_0_15598004_20507.cpp:86:13: error: reference to 'stack' is ambiguous
             stack[top++] = i;
             ^
0_0_15598004_20507.cpp:28:8: note: candidates are: int stack [100010]
 int n, stack[MAXN], top;
        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/stack:61:0,
                 from 0_0_15598004_20507.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_stack.h:99:11: note:                 template<class _Tp, class _Sequence> class std::stack
     class stack
           ^
0_0_15598004_20507.cpp:93:43: error: reference to 'stack' is ambiguous
             while(top >= 2 && cross(point[stack[top-2]], point[i], point[stack[top-1]]) > 0)
                                           ^
0_0_15598004_20507.cpp:28:8: note: candidates are: int stack [100010]
 int n, stack[MAXN], top;
        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/stack:61:0,
                 from 0_0_15598004_20507.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_stack.h:99:11: note:                 template<class _Tp, class _Sequence> class std::stack
     class stack
           ^
0_0_15598004_20507.cpp:93:74: error: reference to 'stack' is ambiguous
             while(top >= 2 && cross(point[stack[top-2]], point[i], point[stack[top-1]]) > 0)
                                                                          ^
0_0_15598004_20507.cpp:28:8: note: candidates are: int stack [100010]
 int n, stack[MAXN], top;
        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/stack:61:0,
                 from 0_0_15598004_20507.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_stack.h:99:11: note:                 template<class _Tp, class _Sequence> class std::stack
     class stack
           ^
0_0_15598004_20507.cpp:97:13: error: reference to 'stack' is ambiguous
             stack[top++] = i;
             ^
0_0_15598004_20507.cpp:28:8: note: candidates are: int stack [100010]
 int n, stack[MAXN], top;
        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/stack:61:0,
                 from 0_0_15598004_20507.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_stack.h:99:11: note:                 template<class _Tp, class _Sequence> class std::stack
     class stack
           ^
0_0_15598004_20507.cpp:103:29: error: reference to 'stack' is ambiguous
         result[i].x = point[stack[i]].x;
                             ^
0_0_15598004_20507.cpp:28:8: note: candidates are: int stack [100010]
 int n, stack[MAXN], top;
        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/stack:61:0,
                 from 0_0_15598004_20507.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_stack.h:99:11: note:                 template<class _Tp, class _Sequence> class std::stack
     class stack
           ^
0_0_15598004_20507.cpp:104:29: error: reference to 'stack' is ambiguous
         result[i].y = point[stack[i]].y;
                             ^
0_0_15598004_20507.cpp:28:8: note: candidates are: int stack [100010]
 int n, stack[MAXN], top;
        ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/stack:61:0,
                 from 0_0_15598004_20507.cpp:11:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_stack.h:99:11: note:                 template<class _Tp, class _Sequence> class std::stack
     class stack
           ^
0_0_15598004_20507.cpp: In function 'void mergeBound(Point*, int, Point*, int, bool)':
0_0_15598004_20507.cpp:110:5: error: reference to 'merge' is ambiguous
     merge[mergeNumber++] = p1[0] + p2[0];
     ^
0_0_15598004_20507.cpp:26:44: note: candidates are: Point merge [200020]
 }point[MAXN], high[2][MAXN], low[2][MAXN], merge[MAXN * 2];
                                            ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
                 from 0_0_15598004_20507.cpp:13:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:4814:5: note:                 template<class _IIter1, class _IIter2, class _OIter, class _Compare> _OIter std::merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare)
     merge(_InputIterator1 __first1, _InputIterator1 __last1,
     ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:4766:5: note:                 template<class _IIter1, class _IIter2, class _OIter> _OIter std::merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter)
     merge(_InputIterator1 __first1, _InputIterator1 __last1,
     ^
0_0_15598004_20507.cpp:116:13: error: reference to 'merge' is ambiguous
             merge[mergeNumber++] = p1[pNum1 - 1] + p2[pNum2 ++];
             ^
0_0_15598004_20507.cpp:26:44: note: candidates are: Point merge [200020]
 }point[MAXN], high[2][MAXN], low[2][MAXN], merge[MAXN * 2];
                                            ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
                 from 0_0_15598004_20507.cpp:13:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:4814:5: note:                 template<class _IIter1, class _IIter2, class _OIter, class _Compare> _OIter std::merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare)
     merge(_InputIterator1 __first1, _InputIterator1 __last1,
     ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:4766:5: note:                 template<class _IIter1, class _IIter2, class _OIter> _OIter std::merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter)
     merge(_InputIterator1 __first1, _InputIterator1 __last1,
     ^
0_0_15598004_20507.cpp:120:13: error: reference to 'merge' is ambiguous
             merge[mergeNumber++] = p1[pNum1 ++] + p2[pNum2 - 1];
             ^
0_0_15598004_20507.cpp:26:44: note: candidates are: Point merge [200020]
 }point[MAXN], high[2][MAXN], low[2][MAXN], merge[MAXN * 2];
                                            ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
                 from 0_0_15598004_20507.cpp:13:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:4814:5: note:                 template<class _IIter1, class _IIter2, class _OIter, class _Compare> _OIter std::merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare)
     merge(_InputIterator1 __first1, _InputIterator1 __last1,
     ^
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_algo.h:4766:5: note:                 template<class _IIter1, class _IIter2, class _OIter> _OIter std::merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter)
     merge(_InputIterator1 __first1, _InputIterator1 __last1,
     ^
0_0_15598004_20507.cpp:131:21: error: reference to 'merge' is ambiguous
                     merge[mergeNumber++] = temp1;
                     ^
0_0_15598004_20507.cpp:26:44: note: candidates are: Point merge [200020]
 }point[MAXN], high[2][MAXN], low[2][MAXN], merge[MAXN * 2];
                                            ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:62:0,
       


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-23 04:40:17, Gzip enabled