Borderou de evaluare (job #1324182)
Utilizator | Data | 21 ianuarie 2015 22:20:21 | |
---|---|---|---|
Problema | Sortare prin comparare | Status | done |
Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp:20:9: error: ‘vector’ does not name a type
vector <T> H;
^
user.cpp: In member function ‘void priorityQueue<T>::insert(T)’:
user.cpp:24:13: error: ‘H’ was not declared in this scope
H.push_back(Value);
^
user.cpp: In member function ‘void priorityQueue<T>::pop()’:
user.cpp:29:13: error: ‘H’ was not declared in this scope
H[0] = H[H.size() - 1];
^
user.cpp: In member function ‘T priorityQueue<T>::front()’:
user.cpp:35:20: error: ‘H’ was not declared in this scope
return H[0];
^
user.cpp: In member function ‘bool priorityQueue<T>::empty()’:
user.cpp:39:21: error: ‘H’ was not declared in this scope
return (H.size() == 0);
^
user.cpp: In member function ‘void priorityQueue<T>::up(int)’:
user.cpp:16:28: error: ‘H’ was not declared in this scope
#define compare(a, b) (H[a - 1] < H[b - 1])
^
user.cpp:45:35: note: in expansion of macro ‘compare’
while(Node != root && compare(Node, father(Node))) {
^
user.cpp: In member function ‘void priorityQueue<T>::down(int)’:
user.cpp:59:37: error: ‘H’ was not declared in this scope
if(leftSon(Node) <= H.size()) {
^
user.cpp:16:28: error: ‘H’ was not declared in this scope
#define compare(a, b) (H[a - 1] < H[b - 1])
^
user.cpp:65:20: note: in expansion of macro ‘compare’
if(compare(Node, son))
^
user.cpp:17:31: error: ‘H’ was not declared in this scope
#define change(a, b) swap(H[a - 1], H[b - 1])
^
user.cpp:69:21: note: in expansion of macro ‘change’
change(Node, son);
^
user.cpp: In function ‘void Read()’:
user.cpp:89:9: error: expected ‘;’ before ‘Heap’
Heap.insert(x);
^
user.cpp: In member function ‘T priorityQueue<T>::front() [with T = int]’:
user.cpp:36:13: warning: control reaches end of non-void function [-Wreturn-type]
}
^
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !