Pagini recente » Borderou de evaluare (job #79179) | Borderou de evaluare (job #3147944)
Borderou de evaluare (job #3147944)
Raport evaluator
Compilare:
In file included from /usr/include/c++/12.2.1/unordered_map:46,
from main.cpp:3:
In member function 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::size_type std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::size() const [with _Key = char; _Value = std::pair<const char, Trie*>; _Alloc = std::allocator<std::pair<const char, Trie*> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<char>; _Hash = std::hash<char>; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<false, false, true>]',
inlined from 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::size_type std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_M_erase(std::true_type, const key_type&) [with _Key = char; _Value = std::pair<const char, Trie*>; _Alloc = std::allocator<std::pair<const char, Trie*> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<char>; _Hash = std::hash<char>; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<false, false, true>]' at /usr/include/c++/12.2.1/bits/hashtable.h:2348:15,
inlined from 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::size_type std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::erase(const key_type&) [with _Key = char; _Value = std::pair<const char, Trie*>; _Alloc = std::allocator<std::pair<const char, Trie*> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<char>; _Hash = std::hash<char>; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<false, false, true>]' at /usr/include/c++/12.2.1/bits/hashtable.h:973:24,
inlined from 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::size_type std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::erase(const key_type&) [with _Key = char; _Tp = Trie*; _Hash = std::hash<char>; _Pred = std::equal_to<char>; _Alloc = std::allocator<std::pair<const char, Trie*> >]' at /usr/include/c++/12.2.1/bits/unordered_map.h:763:26,
inlined from 'void Trie::erase(const char*)' at main.cpp:69:20:
/usr/include/c++/12.2.1/bits/hashtable.h:649:16: warning: 'ant' may be used uninitialized [-Wmaybe-uninitialized]
649 | { return _M_element_count; }
| ^~~~~~~~~~~~~~~~
main.cpp: In member function 'void Trie::erase(const char*)':
main.cpp:61:39: note: 'ant' was declared here
61 | Trie* ant;
| ^~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 0ms | 303kb | Incorect | 0 | 0 |
2 | 0ms | 303kb | Incorect | 0 | 0 |
3 | 0ms | 303kb | Incorect | 0 | 0 |
4 | 0ms | 303kb | Incorect | 0 | 0 |
5 | 0ms | 303kb | Incorect | 0 | 0 |
6 | 1ms | 303kb | Incorect | 0 | 0 |
7 | 1ms | 303kb | Incorect | 0 | 0 |
8 | 2ms | 303kb | Incorect | 0 | 0 |
9 | 3ms | 557kb | Incorect | 0 | 0 |
10 | 5ms | 1343kb | Incorect | 0 | 0 |
11 | 5ms | 303kb | Incorect | 0 | 0 |
12 | 9ms | 2654kb | Incorect | 0 | 0 |
13 | 9ms | 2129kb | Incorect | 0 | 0 |
14 | 9ms | 819kb | Incorect | 0 | 0 |
15 | 14ms | 847kb | Incorect | 0 | 0 |
16 | 39ms | 17235kb | Incorect | 0 |
17 | 19ms | 9814kb | Incorect | 0 | 0 |
18 | 39ms | 12947kb | Incorect | 0 |
19 | 14ms | 512kb | Incorect | 0 | 0 |
20 | 54ms | 22556kb | Incorect | 0 |
Punctaj total | 0 |