Pagini recente » Borderou de evaluare (job #225249) | Borderou de evaluare (job #3227112) | Borderou de evaluare (job #476229) | Borderou de evaluare (job #1783833) | Borderou de evaluare (job #2155393)
Borderou de evaluare (job #2155393)
Raport evaluator
Compilare:
user.cpp: In function ‘matrix produs(matrix, matrix)’:
user.cpp:7:26: warning: narrowing conversion of ‘((((((long long int)A.matrix::x1) * ((long long int)B.matrix::x1)) % 666013ll) + ((((long long int)A.matrix::x2) * ((long long int)B.matrix::x3)) % 666013ll)) % 666013ll)’ from ‘long long int’ to ‘int’ inside { } [-Wnarrowing]
#define S(x, y) ((x + y) % mod)
^
user.cpp:18:16: note: in expansion of macro ‘S’
matrix C = {S(P(A.x1, B.x1), P(A.x2, B.x3)), S(P(A.x1, B.x2), P(A.x2, B.x4)), S(P(A.x3, B.x1), P(A.x4, B.x3)), S(P(A.x3, B.x2), P(A.x4, B.x4))};
^
user.cpp:7:26: warning: narrowing conversion of ‘((((((long long int)A.matrix::x1) * ((long long int)B.matrix::x2)) % 666013ll) + ((((long long int)A.matrix::x2) * ((long long int)B.matrix::x4)) % 666013ll)) % 666013ll)’ from ‘long long int’ to ‘int’ inside { } [-Wnarrowing]
#define S(x, y) ((x + y) % mod)
^
user.cpp:18:49: note: in expansion of macro ‘S’
matrix C = {S(P(A.x1, B.x1), P(A.x2, B.x3)), S(P(A.x1, B.x2), P(A.x2, B.x4)), S(P(A.x3, B.x1), P(A.x4, B.x3)), S(P(A.x3, B.x2), P(A.x4, B.x4))};
^
user.cpp:7:26: warning: narrowing conversion of ‘((((((long long int)A.matrix::x3) * ((long long int)B.matrix::x1)) % 666013ll) + ((((long long int)A.matrix::x4) * ((long long int)B.matrix::x3)) % 666013ll)) % 666013ll)’ from ‘long long int’ to ‘int’ inside { } [-Wnarrowing]
#define S(x, y) ((x + y) % mod)
^
user.cpp:18:82: note: in expansion of macro ‘S’
matrix C = {S(P(A.x1, B.x1), P(A.x2, B.x3)), S(P(A.x1, B.x2), P(A.x2, B.x4)), S(P(A.x3, B.x1), P(A.x4, B.x3)), S(P(A.x3, B.x2), P(A.x4, B.x4))};
^
user.cpp:7:26: warning: narrowing conversion of ‘((((((long long int)A.matrix::x3) * ((long long int)B.matrix::x2)) % 666013ll) + ((((long long int)A.matrix::x4) * ((long long int)B.matrix::x4)) % 666013ll)) % 666013ll)’ from ‘long long int’ to ‘int’ inside { } [-Wnarrowing]
#define S(x, y) ((x + y) % mod)
^
user.cpp:18:115: note: in expansion of macro ‘S’
matrix C = {S(P(A.x1, B.x1), P(A.x2, B.x3)), S(P(A.x1, B.x2), P(A.x2, B.x4)), S(P(A.x3, B.x1), P(A.x4, B.x3)), S(P(A.x3, B.x2), P(A.x4, B.x4))};
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 1388kb | OK | 5 |
| 2 | 4ms | 1388kb | OK | 5 |
| 3 | 20ms | 1388kb | OK | 5 |
| 4 | 20ms | 1392kb | OK | 5 |
| 5 | 20ms | 1396kb | OK | 5 |
| 6 | 20ms | 1396kb | OK | 5 |
| 7 | 24ms | 1392kb | OK | 5 |
| 8 | 24ms | 1392kb | OK | 5 |
| 9 | Depăşit | 7684kb | Time limit exceeded. | 0 |
| 10 | Depăşit | 7684kb | Time limit exceeded. | 0 |
| 11 | Depăşit | 8416kb | Time limit exceeded. | 0 |
| 12 | Depăşit | 9192kb | Time limit exceeded. | 0 |
| 13 | Depăşit | 9196kb | Time limit exceeded. | 0 |
| 14 | Depăşit | 8420kb | Time limit exceeded. | 0 |
| 15 | Depăşit | 8808kb | Time limit exceeded. | 0 |
| 16 | Depăşit | 9196kb | Time limit exceeded. | 0 |
| 17 | 1348ms | Depăşit | Memory limit exceeded. | 0 |
| 18 | 1348ms | Depăşit | Memory limit exceeded. | 0 |
| 19 | 1360ms | Depăşit | Memory limit exceeded. | 0 |
| 20 | 1364ms | Depăşit | Memory limit exceeded. | 0 |
| Punctaj total | 40 |