Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #51276407
Rezumat problemă
#4203
NumberOfPoints
În planul xOy se găsesc n puncte de coordonate numere naturale, nu neapărat aflate pe poziții distincte. Pentru fiecare punct din plan de coordonate (x, y) trebuie să spuneți câte alte puncte au coordonatele (p, q) cu proprietatea că 0 ≤ p < x și 0 ≤ q ≤ y (atenție, p este strict mai mic decât x, iar q este mai mic sau egal cu y).
Folclorul informatic
- Fișiere
-
Pracsiu Dan (dnprx)
- Dan Pracsiu
- dificilă
Detalii
| Problema | NumberOfPoints | Operații I/O |
numberofpoints.in/numberofpoints.out
|
|---|---|---|---|
| Limita timp | 0.3 secunde | Limita memorie |
Total: 128 MB
/
Stivă 64 MB
|
| Id soluție | #51276407 | Utilizator |
Popa Valeriu (popavaleriu3)
|
| Fișier | numberofpoints.cpp | Dimensiune | 2.49 KB |
| Data încărcării | 03 Iunie 2024, 18:55 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
numberofpoints.cpp: In member function 'void ArbInt::update(long long int, long long int, long long int, long long int, long long int)': numberofpoints.cpp:24:18: error: 'node' was not declared in this scope tree[node] += val; ^ numberofpoints.cpp: At global scope: numberofpoints.cpp:66:10: error: 'da' was not declared in this scope bool cmp(da a, da b) ^ numberofpoints.cpp:66:16: error: 'da' was not declared in this scope bool cmp(da a, da b) ^ numberofpoints.cpp:66:20: error: expression list treated as compound expression in initializer [-fpermissive] bool cmp(da a, da b) ^ numberofpoints.cpp:67:1: error: expected ',' or ';' before '{' token { ^ numberofpoints.cpp:74:10: error: '::main' must return 'int' int main() ^ numberofpoints.cpp: In function 'int main()': numberofpoints.cpp:81:40: error: '__gnu_cxx::__alloc_traits<std::allocator<triplet> >::value_type' has no member named 'x' points.push_back({(points[i-3].x*a+points[i-2].x*b+c)%d+1, ^ numberofpoints.cpp:81:56: error: '__gnu_cxx::__alloc_traits<std::allocator<triplet> >::value_type' has no member named 'x' points.push_back({(points[i-3].x*a+points[i-2].x*b+c)%d+1, ^ numberofpoints.cpp:82:40: error: '__gnu_cxx::__alloc_traits<std::allocator<triplet> >::value_type' has no member named 'y' (points[i-3].y*a+points[i-2].y*b+c)%d+1,i}); ^ numberofpoints.cpp:82:56: error: '__gnu_cxx::__alloc_traits<std::allocator<triplet> >::value_type' has no member named 'y' (points[i-3].y*a+points[i-2].y*b+c)%d+1,i}); ^ numberofpoints.cpp:82:69: error: no matching function for call to 'std::vector<triplet>::push_back(<brace-enclosed initializer list>)' (points[i-3].y*a+points[i-2].y*b+c)%d+1,i}); ^ numberofpoints.cpp:82:69: note: candidates are: In file included from /usr/include/c++/4.8/vector:64:0, from /usr/include/c++/4.8/bits/random.h:34, from /usr/include/c++/4.8/random:50, from /usr/include/c++/4.8/bits/stl_algo.h:65, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from numberofpoints.cpp:1: /usr/include/c++/4.8/bits/stl_vector.h:901:7: note: void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = triplet; _Alloc = std::allocator<triplet>; std::vector<_Tp, _Alloc>::value_type = triplet] push_back(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_vector.h:901:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const triplet&}' /usr/include/c++/4.8/bits/stl_vector.h:919:7: note: void std::vector<_Tp, _Alloc>::push_back(std::vector<_Tp, _Alloc>::value_type&&) [with _Tp = triplet; _Alloc = std::allocator<triplet>; std::vector<_Tp, _Alloc>::value_type = triplet] push_back(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_vector.h:919:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::vector<triplet>::value_type&& {aka triplet&&}' numberofpoints.cpp:87:31: error: '__gnu_cxx::__alloc_traits<std::allocator<triplet> >::value_type' has no member named 'y' dr = max(dr,points[i].y); ^ numberofpoints.cpp:92:27: error: '__gnu_cxx::__alloc_traits<std::allocator<triplet> >::value_type' has no member named 'x' int h = points[i].x; ^ numberofpoints.cpp:93:46: error: '__gnu_cxx::__alloc_traits<std::allocator<triplet> >::value_type' has no member named 'x' while(i < points.size() && points[i].x == h) ^ numberofpoints.cpp:96:35: error: '__gnu_cxx::__alloc_traits<std::allocator<triplet> >::value_type' has no member named 'y' z.push_back(points[i].y); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from numberofpoints.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]': /usr/include/c++/4.8/bits/stl_algo.h:2226:70: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]' numberofpoints.cpp:83:41: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: '__comp' cannot be used as a function if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]': /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Size = int; _Compare = bool]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]' numberofpoints.cpp:83:41: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: '__comp' cannot be used as a function if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]': /usr/include/c++/4.8/bits/stl_algo.h:2295:13: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Size = int; _Compare = bool]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]' numberofpoints.cpp:83:41: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: '__comp' cannot be used as a function if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: '__comp' cannot be used as a function if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: '__comp' cannot be used as a function else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: '__comp' cannot be used as a function else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: '__comp' cannot be used as a function else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Tp = triplet; _Compare = bool]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Size = int; _Compare = bool]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]' numberofpoints.cpp:83:41: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: '__comp' cannot be used as a function while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: '__comp' cannot be used as a function while (__comp(__pivot, *__last)) ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from numberofpoints.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Distance = int; _Tp = triplet; _Compare = bool]': /usr/include/c++/4.8/bits/stl_heap.h:448:15: required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]' /usr/include/c++/4.8/bits/stl_algo.h:1946:47: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]' /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Size = int; _Compare = bool]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<triplet*, std::vector<triplet> >; _Compare = bool]' numberofpoints.cpp:83:41: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: '__comp' cannot be used as a function *(__first + (__secondChild - 1)))) ^
Cum funcționează evaluarea?
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
- probleme la care rezolvarea presupune scrierea unui program complet
- probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.
Problema NumberOfPoints face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
- Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
- Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.