Borderou de evaluare (job #2523185)
Utilizator | Data | 13 ianuarie 2020 20:26:12 | |
---|---|---|---|
Problema | Consiliul tribului | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp:11:1: error: 'vector' does not name a type
vector < short int > dp[N];
^~~~~~
main.cpp:12:1: error: 'vector' does not name a type
vector < pair < int, int > > adia[N];///<nod, pe ce poz esti tu in adiacenta lui>
^~~~~~
main.cpp: In function 'int calc(int, int)':
main.cpp:15:9: error: 'dp' was not declared in this scope
if (dp[nod][poz])
^~
main.cpp:17:5: error: 'vector' was not declared in this scope
vector < int > valori;
^~~~~~
main.cpp:17:14: error: expected primary-expression before 'int'
vector < int > valori;
^~~
main.cpp:18:25: error: 'adia' was not declared in this scope
for (int i = 0; i < adia[nod].size(); ++i) {
^~~~
main.cpp:21:9: error: 'valori' was not declared in this scope
valori.push_back(calc(adia[nod][i].first, adia[nod][i].second));
^~~~~~
main.cpp:23:10: error: 'valori' was not declared in this scope
sort(valori.begin(), valori.end());
^~~~~~
main.cpp:23:38: error: 'sort' was not declared in this scope
sort(valori.begin(), valori.end());
^
main.cpp:24:5: error: 'dp' was not declared in this scope
dp[nod][poz] = 1;
^~
main.cpp:25:18: error: unable to deduce 'auto&&' from 'valori'
for (int i : valori)
^~~~~~
main.cpp: In function 'int main()':
main.cpp:36:24: error: 'adia' was not declared in this scope
fin >> u >> v, adia[u].push_back({v, adia[v].size()}), adia[v].push_back({u, adia[u].size() - 1});
^~~~
main.cpp:38:9: error: 'dp' was not declared in this scope
dp[i].resize(adia[i].size() + 1);
^~
main.cpp:38:22: error: 'adia' was not declared in this scope
dp[i].resize(adia[i].size() + 1);
^~~~
main.cpp:41:32: error: 'adia' was not declared in this scope
ans = max(ans, calc(i, adia[i].size()));
^~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !