Pagini recente » Borderou de evaluare (job #1966) | Borderou de evaluare (job #2511911) | Borderou de evaluare (job #2669754) | Borderou de evaluare (job #98097) | Borderou de evaluare (job #2818716)
Borderou de evaluare (job #2818716)
Raport evaluator
Compilare:
main.cpp: In function 'void getSortingOrder(const string&, int)':
main.cpp:16:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
16 | for (int i = 0; i < s.size(); ++i) {
| ~~^~~~~~~~~~
main.cpp:23:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
23 | for (int i = 0; i < s.size() - (1 << pow) + 1; ++i) {
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'std::size_t std::hash<HashingKey>::operator()(const HashingKey&) const':
main.cpp:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
51 | for (int i = 0; i < k.sortingOrders.size(); ++i) {
| ~~^~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'std::vector<int> getInvsortedLogBits(int)':
main.cpp:85:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
85 | for (int i = 0; i < sol.size() / 2; ++i) {
| ~~^~~~~~~~~~~~~~~~
main.cpp: In function 'int countMaxRepsForLength(int)':
main.cpp:105:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
105 | for (int i = 0; i < s.size() - length + 1; ++i)
| ~~^~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:118:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
118 | for (int pow = 0; (1 << pow) <= s.size(); ++pow) getSortingOrder(s, pow);
| ~~~~~~~~~~~^~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 102ms | 2867kb | Time limit exceeded | 0 |
2 | 102ms | 2867kb | Time limit exceeded | 0 |
3 | 102ms | 2867kb | Time limit exceeded | 0 |
4 | 35ms | 933kb | OK | 10 |
5 | 102ms | 2797kb | Time limit exceeded | 0 |
6 | 102ms | 2760kb | Time limit exceeded | 0 |
7 | 2ms | 184kb | OK | 10 |
8 | 6ms | 331kb | OK | 10 |
9 | 11ms | 454kb | OK | 10 |
10 | 102ms | 2314kb | Time limit exceeded | 0 |
Punctaj total | 40 |