Rezumat problemă

Zapada

#616

Orașul Kruskal are n intersecții unite prin m străzi bidirecționale. Datorită ninsorii de peste noapte, străzile sunt acoperite cu zăpadă. Administratorul orașului, Gigel, a determinat cu mari eforturi pentru fiecare stradă costul deszăpezirii ei și acum dorește deszăpezirea unor străzi astfel încât costul total al deszăpezirii lor să fie minim, și să se poată circula între oricare două intersecții pe străzi deszăpezite.

Maleficul Costel îl forțează pe Gigel să deszăpezească numite străzi, din motive doar de el știute. Ajutați-l pe Gigel să determine costul minim pentru deszăpezirea orașului, astfel încât să fie deszăpezite străzile dorite de Costel și să se poată circula între oricare două intersecții pe străzi deszăpezite.

Fișiere Candale Silviu (silviu) Silviu Candale medie

Clasa 11 Teoria Grafurilor Grafuri cu costuri Algoritmul lui Kruskal

Rezolvă

Detalii

Problema	Zapada	Operații I/O	zapada.in/zapada.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#42329668	Utilizator	Krisztian Toth (BlueEyeGuy)
Fișier	zapada.cpp	Dimensiune	1.90 KB
Data încărcării	01 Martie 2023, 10:56	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

zapada.cpp:2:13: warning: ISO C99 requires whitespace after the macro name [enabled by default]
 #define nmax=101

             ^
zapada.cpp: In function 'void beolvas()':
zapada.cpp:22:8: error: 'm' was not declared in this scope
     m2=m;

        ^
zapada.cpp:26:19: warning: left operand of comma operator has no effect [-Wunused-value]
         temp = (a,b,c,0);

                   ^
zapada.cpp:26:21: warning: right operand of comma operator has no effect [-Wunused-value]
         temp = (a,b,c,0);

                     ^
zapada.cpp:26:23: warning: right operand of comma operator has no effect [-Wunused-value]
         temp = (a,b,c,0);

                       ^
zapada.cpp:26:14: error: no match for 'operator=' (operand types are 'graf' and 'int')
         temp = (a,b,c,0);

              ^
zapada.cpp:26:14: note: candidates are:
zapada.cpp:6:8: note: graf& graf::operator=(const graf&)
 struct graf{

        ^
zapada.cpp:6:8: note:   no known conversion for argument 1 from 'int' to 'const graf&'
zapada.cpp:6:8: note: graf& graf::operator=(graf&&)
zapada.cpp:6:8: note:   no known conversion for argument 1 from 'int' to 'graf&&'
zapada.cpp:32:17: error: 'n' was not declared in this scope
     if(v.size()<n-1)

                 ^
zapada.cpp: At global scope:
zapada.cpp:2:13: error: expected primary-expression before '=' token
 #define nmax=101

             ^
zapada.cpp:37:24: note: in expansion of macro 'nmax'
 int m,n,elekszama,komp[nmax];

                        ^
zapada.cpp: In function 'int main()':
zapada.cpp:41:5: error: 'in' was not declared in this scope
     in>>n>>m;

     ^
zapada.cpp:53:9: error: 'komp' was not declared in this scope
         komp[i]=i;

         ^
zapada.cpp:60:13: error: 'k1' was not declared in this scope
             k1=komp[v[i].csucs1];

             ^
zapada.cpp:60:16: error: 'komp' was not declared in this scope
             k1=komp[v[i].csucs1];

                ^
zapada.cpp:61:13: error: 'k2' was not declared in this scope
             k2=komp[v[i].csucs2];

             ^
zapada.cpp:78:24: error: 'dbkomp' was not declared in this scope
     for(int i=0;i<m && dbkomp>0;i++)

                        ^
zapada.cpp:80:28: error: 'komp' was not declared in this scope
         if(v[i].kell==0 && komp[v[i].csucs1]!=komp[v[i].csucs2])

                            ^
zapada.cpp:83:13: error: 'k1' was not declared in this scope
             k1=komp[v[i].csucs1];

             ^
zapada.cpp:84:13: error: 'k2' was not declared in this scope
             k2=komp[v[i].csucs2];

             ^
zapada.cpp:40:9: warning: unused variable 'i' [-Wunused-variable]
     int i=0,k,kompsz=0,osszkoltseg=0,komp1,komp2;

         ^
zapada.cpp:40:38: warning: unused variable 'komp1' [-Wunused-variable]
     int i=0,k,kompsz=0,osszkoltseg=0,komp1,komp2;

                                      ^
zapada.cpp:40:44: warning: unused variable 'komp2' [-Wunused-variable]
     int i=0,k,kompsz=0,osszkoltseg=0,komp1,komp2;

                                            ^
zapada.cpp: At global scope:
zapada.cpp:98:5: error: expected unqualified-id before 'return'
     return 0;

     ^
zapada.cpp:99:1: error: expected declaration before '}' token
 }

 ^
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 zapada.cpp:1:
/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<graf*, std::vector<graf> >; _Tp = graf; _Compare = bool (*)(graf&, graf&)]':
/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<graf*, std::vector<graf> >; _Compare = bool (*)(graf&, graf&)]'
/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<graf*, std::vector<graf> >; _Size = int; _Compare = bool (*)(graf&, graf&)]'
/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<graf*, std::vector<graf> >; _Compare = bool (*)(graf&, graf&)]'
zapada.cpp:50:34:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: invalid initialization of reference of type 'graf&' from expression of type 'const graf'
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: invalid initialization of reference of type 'graf&' from expression of type 'const graf'
    while (__comp(__pivot, *__last))
                                  ^

Cum funcționează evaluarea?