Borderou de evaluare (job #1775175)

Utilizator danielNiculaeDaniel Niculae danielNiculae Data 9 octombrie 2016 23:11:52
Problema Cuplaj maxim in graf bipartit Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Compilare: user.cpp: In function ‘int createChain(int, cpl, cpl, bool*, std::vector<cpl>, int)’: user.cpp:26:10: warning: unused variable ‘nextIteration’ [-Wunused-variable] bool nextIteration = false; ^ user.cpp: In function ‘void findChains(int)’: user.cpp:74:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0 ; i < v.size() ; i++) { ^ user.cpp:77:55: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j = 0 ; j < graph[v[i].node].size() ; j++) { ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms644kbRaspuns gresit0
20ms644kbRaspuns gresit0
30ms640kbRaspuns gresit0
48ms676kbRaspuns gresit0
528ms732kbRaspuns gresit0
6Depăşit960kbTime limit exceeded.0
7Depăşit1304kbTime limit exceeded.0
816ms1372kbKilled by signal 11(SIGSEGV).0
932ms1836kbKilled by signal 11(SIGSEGV).0
1072ms2648kbKilled by signal 11(SIGSEGV).0
Punctaj total0

Ceva nu functioneaza?