Borderou de evaluare (job #2649749)

Utilizator Ioana_GaborGabor Ioana Ioana_Gabor Data 16 septembrie 2020 10:40:29
Problema Biperm Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In function 'void dfs(int)': main.cpp:63:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=0;i<G[nod].size();i++){ ~^~~~~~~~~~~~~~ main.cpp: In function 'void init()': main.cpp:28:31: warning: array subscript is above array bounds [-Warray-bounds] poz[p[j][i]][2].first=i; ~~~~~~~~~~~~~~^ main.cpp:29:31: warning: array subscript is above array bounds [-Warray-bounds] poz[p[j][i]][2].second=j; ~~~~~~~~~~~~~~^ main.cpp:37:38: warning: array subscript is above array bounds [-Warray-bounds] if(poz[i][1].second==poz[i][2].second){ ~~~~~~~~^ main.cpp:38:69: warning: array subscript is above array bounds [-Warray-bounds] G[get_nod(poz[i][1].first,0)].push_back(get_nod(poz[i][2].first,1)); ~~~~~~~~^ main.cpp:39:69: warning: array subscript is above array bounds [-Warray-bounds] G[get_nod(poz[i][1].first,1)].push_back(get_nod(poz[i][2].first,0)); ~~~~~~~~^ main.cpp:40:31: warning: array subscript is above array bounds [-Warray-bounds] G[get_nod(poz[i][2].first,0)].push_back(get_nod(poz[i][1].first,1)); ~~~~~~~~^ main.cpp:41:31: warning: array subscript is above array bounds [-Warray-bounds] G[get_nod(poz[i][2].first,1)].push_back(get_nod(poz[i][1].first,0)); ~~~~~~~~^ main.cpp:43:69: warning: array subscript is above array bounds [-Warray-bounds] G[get_nod(poz[i][1].first,0)].push_back(get_nod(poz[i][2].first,0)); ~~~~~~~~^ main.cpp:44:69: warning: array subscript is above array bounds [-Warray-bounds] G[get_nod(poz[i][1].first,1)].push_back(get_nod(poz[i][2].first,1)); ~~~~~~~~^ main.cpp:45:31: warning: array subscript is above array bounds [-Warray-bounds] G[get_nod(poz[i][2].first,0)].push_back(get_nod(poz[i][1].first,0)); ~~~~~~~~^ main.cpp:46:31: warning: array subscript is above array bounds [-Warray-bounds] G[get_nod(poz[i][2].first,1)].push_back(get_nod(poz[i][1].first,1)); ~~~~~~~~^
Test Timp executie Memorie folosita Mesaj Punctaj/test
13ms655kbCorect10
23ms655kbCorect10
33ms655kbCorect10
43ms655kbCorect10
53ms655kbCorect10
64ms655kbCorect10
74ms655kbCorect10
84ms655kbCorect10
923ms1703kbCorect10
1024ms1835kbCorect10
Punctaj total100

Ceva nu functioneaza?