Borderou de evaluare (job #1857040)
Utilizator | Data | 25 ianuarie 2017 19:05:09 | |
---|---|---|---|
Problema | Biscuiti | Status | done |
Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp:14:13: error: size of array ‘tree’ is too large
int tree[MAX];
^
user.cpp:15:13: error: size of array ‘lazy’ is too large
int lazy[MAX];
^
user.cpp: In function ‘void build_tree(int, int, int)’:
user.cpp:22:7: error: ‘tree’ was not declared in this scope
tree[node] = arr[a];
^
user.cpp:29:2: error: ‘tree’ was not declared in this scope
tree[node] = min(tree[node*2], tree[node*2+1]);
^
user.cpp: In function ‘void update_tree(int, int, int, int, int, int)’:
user.cpp:35:7: error: ‘lazy’ was not declared in this scope
if(lazy[node] != 0) {
^
user.cpp:36:6: error: ‘tree’ was not declared in this scope
tree[node] += lazy[node];
^
user.cpp:50:7: error: ‘tree’ was not declared in this scope
tree[node] += value;
^
user.cpp:53:4: error: ‘lazy’ was not declared in this scope
lazy[node*2] += value;
^
user.cpp:63:2: error: ‘tree’ was not declared in this scope
tree[node] = min(tree[node*2], tree[node*2+1]);
^
user.cpp: In function ‘int query_tree(int, int, int, int, int)’:
user.cpp:71:5: error: ‘lazy’ was not declared in this scope
if(lazy[node] != 0) {
^
user.cpp:72:3: error: ‘tree’ was not declared in this scope
tree[node] += lazy[node];
^
user.cpp:83:10: error: ‘tree’ was not declared in this scope
return tree[node];
^
user.cpp: In function ‘void update(int, int, int, int, int)’:
user.cpp:100:9: error: ‘tree’ was not declared in this scope
tree[node] = val;
^
user.cpp:113:9: error: ‘tree’ was not declared in this scope
tree[node] = lazy[node] + min(tree[2*node], tree[2*node+1]);
^
user.cpp:113:22: error: ‘lazy’ was not declared in this scope
tree[node] = lazy[node] + min(tree[2*node], tree[2*node+1]);
^
user.cpp: In function ‘void find_pos_and_udate(int, int, int)’:
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !