Borderou de evaluare (job #2814992)
Utilizator | Data | 8 decembrie 2021 22:36:54 | |
---|---|---|---|
Problema | Arbore partial de cost minim | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp:6:15: error: expected ']' before numeric constant
6 | #define N 200 001
| ^~~
main.cpp:10:14: note: in expansion of macro 'N'
10 | bool visited[N];
| ^
main.cpp:6:15: error: expected ']' before numeric constant
6 | #define N 200 001
| ^~~
main.cpp:11:7: note: in expansion of macro 'N'
11 | int T[N]; //vectorul de tati
| ^
main.cpp:6:15: error: expected ']' before numeric constant
6 | #define N 200 001
| ^~~
main.cpp:12:7: note: in expansion of macro 'N'
12 | int S[N]; //vector de sizes
| ^
main.cpp:6:15: error: expected ']' before numeric constant
6 | #define N 200 001
| ^~~
main.cpp:30:25: note: in expansion of macro 'N'
30 | vector <int> adiacenta[N];
| ^
main.cpp:6:15: error: expected ']' before numeric constant
6 | #define N 200 001
| ^~~
main.cpp:32:29: note: in expansion of macro 'N'
32 | vector <int> componente[N];
| ^
main.cpp: In member function 'void Graph::addEdge_neorientat(int, int)':
main.cpp:48:6: error: 'adiacenta' was not declared in this scope
48 | adiacenta[h].push_back(t);
| ^~~~~~~~~
main.cpp: In member function 'void Graph::addEdge_orientat(int, int)':
main.cpp:54:6: error: 'adiacenta' was not declared in this scope
54 | adiacenta[h].push_back(t);
| ^~~~~~~~~
main.cpp: In member function 'void Graph::DFS(int)':
main.cpp:60:2: error: 'visited' was not declared in this scope
60 | visited[vf] = true;
| ^~~~~~~
main.cpp:62:21: error: 'adiacenta' was not declared in this scope
62 | for(int i = 0; i < adiacenta[vf].size(); ++i)
| ^~~~~~~~~
main.cpp: In function 'int find(int)':
main.cpp:76:17: error: 'T' was not declared in this scope
76 | while (x != T[x]) {
| ^
main.cpp: In function 'void connect(int, int)':
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !