0_0_13799682_30617.cpp:208:11: error: redefinition of 'const int N'
const int N = 100010;
^
0_0_13799682_30617.cpp:10:11: note: 'const int N' previously defined here
const int N = 100000;
^
0_0_13799682_30617.cpp:209:11: error: redefinition of 'const int D'
const int D = 40;
^
0_0_13799682_30617.cpp:11:11: note: 'const int D' previously defined here
const int D = 40;
^
0_0_13799682_30617.cpp:222:8: error: redefinition of 'struct Entry'
struct Entry{
^
0_0_13799682_30617.cpp:17:8: error: previous definition of 'struct Entry'
struct Entry {
^
0_0_13799682_30617.cpp:259:5: error: redefinition of 'int n'
int n, Q, queue[N], parent[N], size[N], balence[N], depth[N], weight[N];
^
0_0_13799682_30617.cpp:13:5: note: 'int n' previously declared here
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
0_0_13799682_30617.cpp:259:18: error: redefinition of 'int queue [100000]'
int n, Q, queue[N], parent[N], size[N], balence[N], depth[N], weight[N];
^
0_0_13799682_30617.cpp:13:11: note: 'int queue [100000]' previously declared here
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
0_0_13799682_30617.cpp:259:29: error: redefinition of 'int parent [100000]'
int n, Q, queue[N], parent[N], size[N], balence[N], depth[N], weight[N];
^
0_0_13799682_30617.cpp:13:21: note: 'int parent [100000]' previously declared here
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
0_0_13799682_30617.cpp:259:38: error: redefinition of 'int size [100000]'
int n, Q, queue[N], parent[N], size[N], balence[N], depth[N], weight[N];
^
0_0_13799682_30617.cpp:13:32: note: 'int size [100000]' previously declared here
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
0_0_13799682_30617.cpp:259:60: error: redefinition of 'int depth [100000]'
int n, Q, queue[N], parent[N], size[N], balence[N], depth[N], weight[N];
^
0_0_13799682_30617.cpp:13:53: note: 'int depth [100000]' previously declared here
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
0_0_13799682_30617.cpp:259:71: error: redefinition of 'int weight [100000]'
int n, Q, queue[N], parent[N], size[N], balence[N], depth[N], weight[N];
^
0_0_13799682_30617.cpp:13:63: note: 'int weight [100000]' previously declared here
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
0_0_13799682_30617.cpp:260:15: error: redefinition of 'bool visited [100000]'
bool visited[N];
^
0_0_13799682_30617.cpp:14:6: note: 'bool visited [100000]' previously declared here
bool visited[N];
^
0_0_13799682_30617.cpp:261:29: error: redefinition of 'std::vector<Entry> entries [100000]'
std::vector<Entry> entries[N];
^
0_0_13799682_30617.cpp:23:21: note: 'std::vector<Entry> entries [100000]' previously declared here
std::vector <Entry> entries[N];
^
0_0_13799682_30617.cpp:262:25: error: conflicting declaration 'std::map<int, SegTree> bits [100000]'
map<int, SegTree> bits[N];
^
0_0_13799682_30617.cpp:58:35: note: previous declaration as 'std::map<int, BinaryIndexedTree> bits [100000]'
std::map <int, BinaryIndexedTree> bits[N];
^
0_0_13799682_30617.cpp: In function 'void divide(int)':
0_0_13799682_30617.cpp:274:6: error: redefinition of 'void divide(int)'
void divide(int root){
^
0_0_13799682_30617.cpp:60:6: note: 'void divide(int)' previously defined here
void divide(int root)
^
0_0_13799682_30617.cpp:276:5: error: reference to 'queue' is ambiguous
queue[tail++] = root; parent[root] = 0; size[root] = 1; balence[root] = 0;
^
0_0_13799682_30617.cpp:13:11: note: candidates are: int queue [100000]
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
from 0_0_13799682_30617.cpp:7:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:96:11: note: template<class _Tp, class _Sequence> class std::queue
class queue
^
0_0_13799682_30617.cpp:278:17: error: reference to 'queue' is ambiguous
int u = queue[Head];
^
0_0_13799682_30617.cpp:13:11: note: candidates are: int queue [100000]
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
from 0_0_13799682_30617.cpp:7:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:96:11: note: template<class _Tp, class _Sequence> class std::queue
class queue
^
0_0_13799682_30617.cpp:282:13: error: reference to 'queue' is ambiguous
queue[tail++] = v; parent[v] = u; size[v] = 1; balence[v] = 0;
^
0_0_13799682_30617.cpp:13:11: note: candidates are: int queue [100000]
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
from 0_0_13799682_30617.cpp:7:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:96:11: note: template<class _Tp, class _Sequence> class std::queue
class queue
^
0_0_13799682_30617.cpp:285:12: error: reference to 'queue' is ambiguous
root = queue[tail - 1];
^
0_0_13799682_30617.cpp:13:11: note: candidates are: int queue [100000]
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
from 0_0_13799682_30617.cpp:7:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:96:11: note: template<class _Tp, class _Sequence> class std::queue
class queue
^
0_0_13799682_30617.cpp:287:17: error: reference to 'queue' is ambiguous
int v = queue[i], u = parent[v];
^
0_0_13799682_30617.cpp:13:11: note: candidates are: int queue [100000]
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
from 0_0_13799682_30617.cpp:7:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:96:11: note: template<class _Tp, class _Sequence> class std::queue
class queue
^
0_0_13799682_30617.cpp:288:14: error: 'u' was not declared in this scope
size[u] += size[v]; balence[u] = max(balence[u], size[v]);
^
0_0_13799682_30617.cpp:296:20: error: 'std::map<int, BinaryIndexedTree>::mapped_type' has no member named 'update'
bits[root][-1].update(0, weight[root]);
^
0_0_13799682_30617.cpp:302:9: error: reference to 'queue' is ambiguous
queue[tail++] = vv;
^
0_0_13799682_30617.cpp:13:11: note: candidates are: int queue [100000]
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
from 0_0_13799682_30617.cpp:7:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:96:11: note: template<class _Tp, class _Sequence> class std::queue
class queue
^
0_0_13799682_30617.cpp:304:21: error: reference to 'queue' is ambiguous
int u = queue[Head];
^
0_0_13799682_30617.cpp:13:11: note: candidates are: int queue [100000]
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
from 0_0_13799682_30617.cpp:7:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:96:11: note: template<class _Tp, class _Sequence> class std::queue
class queue
^
0_0_13799682_30617.cpp:309:17: error: reference to 'queue' is ambiguous
queue[tail++] = v;
^
0_0_13799682_30617.cpp:13:11: note: candidates are: int queue [100000]
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/include/c++/queue:64:0,
from 0_0_13799682_30617.cpp:7:
GCC4.9.2/x86_64-w64-mingw32/include/c++/bits/stl_queue.h:96:11: note: template<class _Tp, class _Sequence> class std::queue
class queue
^
0_0_13799682_30617.cpp:315:21: error: reference to 'queue' is ambiguous
int u = queue[Head];
^
0_0_13799682_30617.cpp:13:11: note: candidates are: int queue [100000]
int n, q, queue[N], parent[N], size[N], balance[N], depth[N], weight[N];
^
In file included from GCC4.9.2/x86_64-w64-mingw32/incl
|
