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_21110223_16751.cpp: In function 'void radix_sort()':
0_0_21110223_16751.cpp:38:5: error: reference to 'rank' is ambiguous
   w[rank[i]]++;
     ^
0_0_21110223_16751.cpp:27:27: note: candidates are: int* rank
 int sa[N], ta[N], tb[N], *rank = ta, *temp = tb;
                           ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_21110223_16751.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_21110223_16751.cpp:44:10: error: reference to 'rank' is ambiguous
   sa[--w[rank[temp[i]]]] = temp[i];
          ^
0_0_21110223_16751.cpp:27:27: note: candidates are: int* rank
 int sa[N], ta[N], tb[N], *rank = ta, *temp = tb;
                           ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_21110223_16751.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_21110223_16751.cpp: In function 'void suffix_array()':
0_0_21110223_16751.cpp:50:3: error: reference to 'rank' is ambiguous
   rank[i] = str[i];
   ^
0_0_21110223_16751.cpp:27:27: note: candidates are: int* rank
 int sa[N], ta[N], tb[N], *rank = ta, *temp = tb;
                           ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_21110223_16751.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_21110223_16751.cpp:64:19: error: reference to 'rank' is ambiguous
   for (swap(temp, rank), rank[sa[0]] = 0, i = p = 1; i < n; ++i) {
                   ^
0_0_21110223_16751.cpp:27:27: note: candidates are: int* rank
 int sa[N], ta[N], tb[N], *rank = ta, *temp = tb;
                           ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_21110223_16751.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_21110223_16751.cpp:64:26: error: reference to 'rank' is ambiguous
   for (swap(temp, rank), rank[sa[0]] = 0, i = p = 1; i < n; ++i) {
                          ^
0_0_21110223_16751.cpp:27:27: note: candidates are: int* rank
 int sa[N], ta[N], tb[N], *rank = ta, *temp = tb;
                           ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_21110223_16751.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_21110223_16751.cpp:65:4: error: reference to 'rank' is ambiguous
    rank[sa[i]] = compare(sa[i - 1], sa[i], j) ? p - 1 : p++;
    ^
0_0_21110223_16751.cpp:27:27: note: candidates are: int* rank
 int sa[N], ta[N], tb[N], *rank = ta, *temp = tb;
                           ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_21110223_16751.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_21110223_16751.cpp:69:7: error: reference to 'rank' is ambiguous
   if (rank[i]) {
       ^
0_0_21110223_16751.cpp:27:27: note: candidates are: int* rank
 int sa[N], ta[N], tb[N], *rank = ta, *temp = tb;
                           ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_21110223_16751.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_21110223_16751.cpp:70:11: error: reference to 'rank' is ambiguous
    j = sa[rank[i] - 1];
           ^
0_0_21110223_16751.cpp:27:27: note: candidates are: int* rank
 int sa[N], ta[N], tb[N], *rank = ta, *temp = tb;
                           ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_21110223_16751.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_21110223_16751.cpp:72:11: error: reference to 'rank' is ambiguous
    height[rank[i]] = k;
           ^
0_0_21110223_16751.cpp:27:27: note: candidates are: int* rank
 int sa[N], ta[N], tb[N], *rank = ta, *temp = tb;
                           ^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/move.h:57:0,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_pair.h:59,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/utility:70,
                 from GCC4.9.2/x86_64-w64-mingw32/include/c++/algorithm:60,
                 from 0_0_21110223_16751.cpp:3:
GCC4.9.2/x86_64-w64-mingw32/include/c++/type_traits:1340:12: note:                 template<class> struct std::rank
     struct rank
            ^
0_0_21110223_16751.cpp: In function 'void solve()':
0_0_21110223_16751.cpp:91:4: error: reference to 'prev' is ambiguous
    prev[i][j] = 0;
    ^
0_0_21110223_16751.cpp:81:11: note: candidates are: long long int prev [222][222]
 long long prev[222][222];
           ^
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_21110223_16751.cpp:3:
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_21110223_16751.cpp:100:5: error: reference to 'prev' is ambiguous
     prev[i][j] = prev[i][j] * base + (info[i + delta - 1][j] - 'A');
     ^
0_0_21110223_16751.cpp:81:11: note: candidates are: long long int prev [222][222]
 long long prev[222][222];
           ^
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_21110223_16751.cpp:3:
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_21110223_16751.cpp:100:18: error: reference to 'prev' is ambiguous
     prev[i][j] = prev[i][j] * base + (info[i + delta - 1][j] - 'A');
                  ^
0_0_21110223_16751.cpp:81:11: note: candidates are: long long int prev [222][222]
 long long prev[222][222];
           ^
In file included from D:/H


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-26 18:37:21, Gzip enabled