Borderou de evaluare (job #2944621)

Utilizator Stefan_PiscuPiscu Stefan Constantin Stefan_Piscu Data 22 noiembrie 2022 19:00:37
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:154: 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=-1,i,j,z,t[1<<20],x;struct s{int x,y,z;}d,e[1<<20];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,e[k].x+=d.z,e[k].y++:j++]=d;for(;k<m;)w<<e[k].x<<" "<<e[k++].y<<" ";} | ^~~~ main.cpp: In function 'int main()': main.cpp:2:354: warning: operation on 'k' may be undefined [-Wsequence-point] 2 | std::ifstream r("apm.in");std::ofstream w("apm.out");int m,k=-1,i,j,z,t[1<<20],x;struct s{int x,y,z;}d,e[1<<20];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,e[k].x+=d.z,e[k].y++:j++]=d;for(;k<m;)w<<e[k].x<<" "<<e[k++].y<<" ";} | ~^~
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms184kbCorect10
20ms184kbCorect10
30ms184kbCorect10
40ms184kbCorect10
50ms184kbCorect10
665ms2777kbCorect10
797ms4296kbCorect10
819ms1032kbCorect10
923ms1142kbCorect10
1093ms4001kbCorect10
Punctaj total100

Ceva nu functioneaza?