Borderou de evaluare (job #2234650)

Utilizator lflorin29Florin Laiu lflorin29 Data 25 august 2018 22:18:18
Problema Nespus Status done
Runda Algoritmiada 2018 Runda Maraton Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Compilare: user.cpp: In function ‘void dfsLabel(int, int, int)’: user.cpp:23:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0;i<g[node].size(); ++i) { ~^~~~~~~~~~~~~~~ user.cpp: In function ‘void find_(int)’: user.cpp:58:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] while(edge_ptr[n1] < g[n1].size()) { ~~~~~~~~~~~~~^~~~~~~~~~~~~~ user.cpp: In function ‘int paralel(int, int)’: user.cpp:75:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] while(k1 < g[n1].size()) { ~~~^~~~~~~~~~~~~~ user.cpp:82:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(k1<g[n1].size()){ ~~^~~~~~~~~~~~~ user.cpp:96:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] while(k2 < g[n2].size()) { ~~~^~~~~~~~~~~~~~ user.cpp:103:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(k2<g[n2].size()){ ~~^~~~~~~~~~~~~ user.cpp:74:15: warning: unused variable ‘ok’ [-Wunused-variable] bool ok = 0; ^~ In file included from /usr/include/c++/6/cassert:44:0, from /usr/include/x86_64-linux-gnu/c++/6/32/bits/stdc++.h:33, from user.cpp:1: user.cpp: In function ‘void disconect(int, int, int)’: user.cpp:131:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] assert(am_vizitat.size() <= 4 * newSz); ~~~~~~~~~~~~~~~~~~^~~~~~~~ user.cpp:124:9: warning: unused variable ‘tt’ [-Wunused-variable] int tt = am_vizitat.size(); ^~ user.cpp: In function ‘bool pot(int)’: user.cpp:139:5: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation] for(int i = 1; i < N; ++i) ^~~ user.cpp:141:7: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the ‘for’ for(int i=1;i<n;++i)went[i]=0,cant[i]=0; ^~~
Feedback Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
1116ms28096kbIncorect00
2116ms28096kbIncorect0
3124ms28116kbIncorect00
4124ms28120kbIncorect0
5128ms28120kbIncorect0
6128ms28120kbIncorect0
7Depăşit30748kbTime limit exceeded.00
8952ms31120kbIncorect0
9Depăşit31148kbTime limit exceeded.0
10Depăşit31224kbTime limit exceeded.0
11Depăşit31176kbTime limit exceeded.0
12252ms30924kbIncorect0
13Depăşit31180kbTime limit exceeded.00
14Depăşit32144kbTime limit exceeded.0
15Depăşit32116kbTime limit exceeded.0
16Depăşit32172kbTime limit exceeded.0
17Depăşit32136kbTime limit exceeded.0
18Depăşit32112kbTime limit exceeded.0
19Depăşit32148kbTime limit exceeded.0
20380ms31708kbOK5
Punctaj total0

Ceva nu functioneaza?