Pagini recente » Borderou de evaluare (job #1145848) | Borderou de evaluare (job #27722) | Borderou de evaluare (job #2804388) | Borderou de evaluare (job #1846878) | Borderou de evaluare (job #2933210)
Borderou de evaluare (job #2933210)
Raport evaluator
Compilare:
main.cpp: In function 'void add(int, std::string&, int)':
main.cpp:36:34: warning: array subscript has type 'char' [-Wchar-subscripts]
36 | if (tree[node].nxt[toInt[s[ind]]] == 0)
| ^
main.cpp:38:32: warning: array subscript has type 'char' [-Wchar-subscripts]
38 | tree[node].nxt[toInt[s[ind]]] = nodes++;
| ^
main.cpp:40:34: warning: array subscript has type 'char' [-Wchar-subscripts]
40 | add(tree[node].nxt[toInt[s[ind]]], s, ind + 1);
| ^
main.cpp: In function 'void query(int, std::string&)':
main.cpp:57:16: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
57 | if (s.size() == k)
| ~~~~~~~~~^~~~
main.cpp:64:62: warning: array subscript has type 'char' [-Wchar-subscripts]
64 | if (tree[node].dp == (tree[tree[node].nxt[toInt[toBeaten[c]]]].stop) *
| ^
main.cpp:64:63: warning: array subscript has type 'char' [-Wchar-subscripts]
64 | if (tree[node].dp == (tree[tree[node].nxt[toInt[toBeaten[c]]]].stop) *
| ~~~~~~~~~~^
main.cpp:66:56: warning: array subscript has type 'char' [-Wchar-subscripts]
66 | tree[tree[node].nxt[toInt[c]]].dp)
| ^
main.cpp:71:28: warning: array subscript has type 'char' [-Wchar-subscripts]
71 | if (tree[node].nxt[toInt[res]] == 0)
| ^~~
main.cpp:72:26: warning: array subscript has type 'char' [-Wchar-subscripts]
72 | tree[node].nxt[toInt[res]] = nodes++;
| ^~~
main.cpp:74:30: warning: array subscript has type 'char' [-Wchar-subscripts]
74 | query(tree[node].nxt[toInt[res]], s);
| ^~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 15ms | 20267kb | OK | 5 |
2 | 14ms | 20267kb | OK | 5 |
3 | 12ms | 20217kb | OK | 5 |
4 | 14ms | 20258kb | OK | 5 |
5 | 15ms | 20205kb | OK | 5 |
6 | 14ms | 20312kb | Incorect | 0 |
7 | 73ms | 21626kb | OK | 5 |
8 | 94ms | 21815kb | Incorect | 0 |
9 | 100ms | 21905kb | Killed by Signal 11 | 0 |
10 | 100ms | 21876kb | OK | 5 |
11 | 75ms | 21000kb | Incorect | 0 |
12 | 84ms | 21090kb | OK | 5 |
13 | 96ms | 21282kb | Incorect | 0 |
14 | 91ms | 21311kb | OK | 5 |
15 | 99ms | 21348kb | OK | 5 |
16 | 103ms | 21405kb | Incorect | 0 |
17 | 99ms | 21377kb | OK | 5 |
18 | 104ms | 21422kb | Incorect | 0 |
19 | 160ms | 35561kb | Killed by Signal 11 | 0 |
20 | 95ms | 21254kb | OK | 5 |
Punctaj total | 60 |