Borderou de evaluare (job #2951315)
Utilizator | Data | 5 decembrie 2022 22:44:37 | |
---|---|---|---|
Problema | Arbvalmax | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp:8:10: error: expected ';' before 'nmax'
8 | const int nmax = 3e5 + 2;
| ^~~~~
| ;
main.cpp:10:17: error: 'nmax' was not declared in this scope
10 | vector<int> adj[nmax];
| ^~~~
main.cpp:11:1: error: 'll' does not name a type
11 | ll v[nmax];
| ^~
main.cpp:12:1: error: 'll' does not name a type
12 | ll dp[2][nmax];
| ^~
main.cpp:13:1: error: 'll' does not name a type
13 | ll bestfiu[nmax];
| ^~
main.cpp:14:1: error: 'll' does not name a type
14 | ll maxfiu[2][nmax];
| ^~
main.cpp:15:1: error: 'll' does not name a type
15 | ll subtreeMax[nmax];
| ^~
main.cpp: In function 'void dfs(int)':
main.cpp:19:20: error: 'adj' was not declared in this scope
19 | for (auto to : adj[nod])
| ^~~
main.cpp:22:17: error: 'subtreeMax' was not declared in this scope
22 | if (max(subtreeMax[to], v[to]) > maxfiu[0][nod])
| ^~~~~~~~~~
main.cpp:22:33: error: 'v' was not declared in this scope
22 | if (max(subtreeMax[to], v[to]) > maxfiu[0][nod])
| ^
main.cpp:22:42: error: 'maxfiu' was not declared in this scope
22 | if (max(subtreeMax[to], v[to]) > maxfiu[0][nod])
| ^~~~~~
main.cpp:25:13: error: 'bestfiu' was not declared in this scope
25 | bestfiu[nod] = to;
| ^~~~~~~
main.cpp:32:9: error: 'subtreeMax' was not declared in this scope
32 | subtreeMax[nod] = max(subtreeMax[nod], max(subtreeMax[to], v[to]));
| ^~~~~~~~~~
main.cpp:32:68: error: 'v' was not declared in this scope
32 | subtreeMax[nod] = max(subtreeMax[nod], max(subtreeMax[to], v[to]));
| ^
main.cpp: In function 'void depe(int, int)':
main.cpp:40:20: error: 'adj' was not declared in this scope
40 | for (auto to : adj[nod])
| ^~~
main.cpp:42:13: error: 'bestfiu' was not declared in this scope
42 | if (bestfiu[nod] == to)
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !