Borderou de evaluare (job #2698609)

Utilizator LittleWhoFeraru Mihail LittleWho Data 22 ianuarie 2021 16:22:18
Problema Cuplaj maxim in graf bipartit Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 50

Raport evaluator

Compilare: main.cpp: In function 'void read()': main.cpp:34:21: warning: narrowing conversion of '(((int)y) + ((int)n))' from 'int' to 'ushort {aka short unsigned int}' inside { } [-Wnarrowing] #define B_NODE(i) (i+n) ~~^~~ main.cpp:44:41: note: in expansion of macro 'B_NODE' G[A_NODE(x)].push_back({.node = B_NODE(y), .flow = 0, .capacity = 1}); ^~~~~~ main.cpp:34:21: warning: narrowing conversion of '(((int)i) + ((int)n))' from 'int' to 'ushort {aka short unsigned int}' inside { } [-Wnarrowing] #define B_NODE(i) (i+n) ~~^~~ main.cpp:60:36: note: in expansion of macro 'B_NODE' G[dest].push_back({.node = B_NODE(i), .flow = 0, .capacity = 0}); ^~~~~~ main.cpp: In function 'int main()': main.cpp:131:37: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("cuplaj.in", "r", stdin); ^ main.cpp:132:39: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("cuplaj.out", "w", stdout); ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
14ms786kbOK10
24ms786kbOK10
34ms786kbOK10
413ms917kbOK10
553ms1048kbOK10
6201ms2359kbTime limit exceeded0
7201ms4456kbTime limit exceeded0
8200ms3801kbTime limit exceeded0
9202ms6553kbTime limit exceeded0
1050ms8912kbRaspuns gresit0
Punctaj total50

Ceva nu functioneaza?