Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.

Detalii evaluare #55025000

Rezumat problemă

#4712 aperm

Se consideră o matrice cu n linii și p coloane. Fiecare linie a matricei este o permutare a mulțimii {1, 2, ..., p}. Să se ordoneze lexicografic liniile matricei.

XOR 2015

Rezolvă

Detalii

Problema aperm Operații I/O aperm.in/aperm.out
Limita timp 0.3 secunde Limita memorie Total: 2 MB / Stivă 1 MB
Id soluție #55025000 Utilizator stefu vlad (vladutz36)
Fișier aperm.cpp Dimensiune 715 B
Data încărcării 17 Decembrie 2024, 09:41 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

aperm.cpp:8:19: error: 'numarb' has not been declared
 int comp(numar a, numarb)

                   ^
aperm.cpp: In function 'int comp(numar, int)':
aperm.cpp:10:13: error: 'b' was not declared in this scope
     if (a.v<b.v)

             ^
aperm.cpp:12:13: error: 'b' was not declared in this scope
     if (a.v>b.v)

             ^
aperm.cpp:14:19: error: 'b' was not declared in this scope
     return (a.nro<b.nro);

                   ^
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 aperm.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = numar*; _Compare = int (*)(numar, int)]':
/usr/include/c++/4.8/bits/stl_algo.h:2226:70:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = numar*; _Compare = int (*)(numar, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5500:55:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = numar*; _Compare = int (*)(numar, int)]'
aperm.cpp:31:24:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: cannot convert 'numar' to 'int' in argument passing
    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 = numar*; _Compare = int (*)(numar, int)]':
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = numar*; _Compare = int (*)(numar, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = numar*; _Size = int; _Compare = int (*)(numar, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = numar*; _Compare = int (*)(numar, int)]'
aperm.cpp:31:24:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: cannot convert 'numar' to 'int' in argument passing
  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 = numar*; _Compare = int (*)(numar, int)]':
/usr/include/c++/4.8/bits/stl_algo.h:2295:13:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = numar*; _Compare = int (*)(numar, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = numar*; _Size = int; _Compare = int (*)(numar, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = numar*; _Compare = int (*)(numar, int)]'
aperm.cpp:31:24:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: cannot convert 'numar' to 'int' in argument passing
       if (__comp(*__a, *__b))
                            ^
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: cannot convert 'numar' to 'int' in argument passing
    if (__comp(*__b, *__c))
                         ^
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: cannot convert 'numar' to 'int' in argument passing
    else if (__comp(*__a, *__c))
                              ^
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: cannot convert 'numar' to 'int' in argument passing
       else if (__comp(*__a, *__c))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: cannot convert 'numar' to 'int' in argument passing
       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 = numar*; _Tp = numar; _Compare = int (*)(numar, int)]':
/usr/include/c++/4.8/bits/stl_algo.h:2296:78:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = numar*; _Compare = int (*)(numar, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:2337:62:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = numar*; _Size = int; _Compare = int (*)(numar, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = numar*; _Compare = int (*)(numar, int)]'
aperm.cpp:31:24:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: cannot convert 'const numar' to 'int' in argument passing
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: cannot convert 'numar' to 'int' in argument passing
    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 aperm.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 = numar*; _Distance = int; _Tp = numar; _Compare = int (*)(numar, int)]':
/usr/include/c++/4.8/bits/stl_heap.h:448:15:   required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = numar*; _Compare = int (*)(numar, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:1946:47:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = numar*; _Compare = int (*)(numar, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = numar*; _Compare = int (*)(numar, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = numar*; _Size = int; _Compare = int (*)(numar, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = numar*; _Compare = int (*)(numar, int)]'
aperm.cpp:31:24:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: cannot convert 'numar' to 'int' in argument passing
        *(__first + (__secondChild - 1))))
                                        ^
aperm.cpp:15:1: warning: control reaches end of non-void function [-Wreturn-type]
 }

 ^

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 aperm 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ă.