Borderou de evaluare (job #2944591)

Utilizator Stefan_PiscuPiscu Stefan Constantin Stefan_Piscu Data 22 noiembrie 2022 18:22:39
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated] 1 | #import<bits/stdc++.h> | ^~~~~~ main.cpp:2:70: warning: multi-character character constant [-Wmultichar] 2 | std::ifstream r("apm.in");std::ofstream w("apm.out");int m,k,i,j,z,t['■'],x;struct s{int x,y,z;}d,e['■'];int f(int x){return t[x]?t[x]=f(t[x]):x;}main(){r>>m>>m;for(;r>>e[i].x>>e[i].y>>e[i].z;i++);std::sort(e,e+m,[](s a,s b){return a.z<b.z;});for(;j<m;)d=e[j],e[f(d.y)^(x=f(d.x))?t[x]=d.y,z+=d.z,k++:j++]=d;w<<z<<" "<<k<<" ";for(;k--;)w<<e[k].x<<" "<<e[k].y<<" ";} | ^~~ main.cpp:2:103: warning: multi-character character constant [-Wmultichar] 2 | std::ifstream r("apm.in");std::ofstream w("apm.out");int m,k,i,j,z,t['■'],x;struct s{int x,y,z;}d,e['■'];int f(int x){return t[x]?t[x]=f(t[x]):x;}main(){r>>m>>m;for(;r>>e[i].x>>e[i].y>>e[i].z;i++);std::sort(e,e+m,[](s a,s b){return a.z<b.z;});for(;j<m;)d=e[j],e[f(d.y)^(x=f(d.x))?t[x]=d.y,z+=d.z,k++:j++]=d;w<<z<<" "<<k<<" ";for(;k--;)w<<e[k].x<<" "<<e[k].y<<" ";} | ^~~ main.cpp:2:151: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type] 2 | std::ifstream r("apm.in");std::ofstream w("apm.out");int m,k,i,j,z,t['■'],x;struct s{int x,y,z;}d,e['■'];int f(int x){return t[x]?t[x]=f(t[x]):x;}main(){r>>m>>m;for(;r>>e[i].x>>e[i].y>>e[i].z;i++);std::sort(e,e+m,[](s a,s b){return a.z<b.z;});for(;j<m;)d=e[j],e[f(d.y)^(x=f(d.x))?t[x]=d.y,z+=d.z,k++:j++]=d;w<<z<<" "<<k<<" ";for(;k--;)w<<e[k].x<<" "<<e[k].y<<" ";} | ^~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms184kbCorect10
20ms188kbCorect10
30ms184kbCorect10
41ms184kbCorect10
50ms184kbCorect10
643ms1732kbCorect10
784ms3444kbCorect10
813ms708kbCorect10
915ms884kbCorect10
1075ms2920kbCorect10
Punctaj total100

Ceva nu functioneaza?