Borderou de evaluare (job #2052133)

Utilizator neth------ neth Data 30 octombrie 2017 01:41:01
Problema Cuplaj maxim de cost minim Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp: In function ‘void kuhn_augment(int, const T (*)[S], int*, int*, T (*)[S], int (*)[S], int*)’: user.cpp:22:10: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wparentheses] if (g[i][j] - v[ROW][i] - v[COL][j] == 0) ^ user.cpp: In instantiation of ‘void kuhn_augment(int, const T (*)[S], int*, int*, T (*)[S], int (*)[S], int*) [with T = int; int S = 301; T INF = 20001]’: user.cpp:50:52: required from ‘void kuhn(int, const T (*)[S], int*, int*) [with T = int; int S = 301; T INF = 20001]’ user.cpp:75:37: required from here user.cpp:27:21: warning: operation on ‘i’ may be undefined [-Wsequence-point] while (i) rig[i] = j, lef[j] = lef[j] + i - (i = lef[j]), j = x[i]; ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms496kbCorect10
20ms492kbCorect10
324ms708kbCorect10
420ms688kbCorect10
520ms688kbCorect10
6288ms1016kbCorect10
7304ms1136kbCorect10
8716ms1176kbCorect10
9712ms1184kbCorect10
10720ms1184kbCorect10
Punctaj total100

Ceva nu functioneaza?