Borderou de evaluare (job #2942210)

Utilizator andrei_C1Andrei Chertes andrei_C1 Data 19 noiembrie 2022 13:07:59
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:78: warning: multi-character character constant [-Wmultichar] 2 | std::ifstream r("apm.in");std::ofstream w("apm.out");struct s{int x,y,z;}d,e['■'];int m,k,i,j,z,t['■'],x;int f(int x){return t[x]^x?t[x]=f(t[x]):x;}int main(){r>>m>>m;while(r>>e[i].x>>e[i].y>>e[t[i]=i].z)i++;std::sort(e,e+m,[](s a,s b){return a.z<b.z;});for(;j<m;){d=e[j++];x=f(d.x),t[x]=f(d.y);if(x^t[x])z+=d.z,e[k++]=d;}w<<z<<" "<<k<<" ";while(k--)w<<e[k].x<<" "<<e[k].y<<" ";} | ^~~ main.cpp:2:101: warning: multi-character character constant [-Wmultichar] 2 | std::ifstream r("apm.in");std::ofstream w("apm.out");struct s{int x,y,z;}d,e['■'];int m,k,i,j,z,t['■'],x;int f(int x){return t[x]^x?t[x]=f(t[x]):x;}int main(){r>>m>>m;while(r>>e[i].x>>e[i].y>>e[t[i]=i].z)i++;std::sort(e,e+m,[](s a,s b){return a.z<b.z;});for(;j<m;){d=e[j++];x=f(d.x),t[x]=f(d.y);if(x^t[x])z+=d.z,e[k++]=d;}w<<z<<" "<<k<<" ";while(k--)w<<e[k].x<<" "<<e[k].y<<" ";} | ^~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms184kbCorect10
20ms184kbCorect10
30ms184kbCorect10
40ms184kbCorect10
50ms184kbCorect10
643ms2093kbCorect10
782ms3796kbCorect10
812ms839kbCorect10
911ms1056kbCorect10
1072ms3297kbCorect10
Punctaj total100

Ceva nu functioneaza?