Borderou de evaluare (job #2944613)

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

Raport evaluator

Compilare: main.cpp:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated] 1 | #import<bits/stdc++.h> | ^~~~~~ 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[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:350: warning: operation on 'k' may be undefined [-Wsequence-point] 2 | std::ifstream r("apm.in");std::ofstream w("apm.out");int m,k,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
115ms13299kbKilled by Signal 110
215ms13410kbKilled by Signal 110
310ms10227kbKilled by Signal 110
47ms10104kbKilled by Signal 110
514ms12767kbKilled by Signal 110
61001ms1495kbTime limit exceeded0
71002ms2150kbTime limit exceeded0
81002ms708kbTime limit exceeded0
91002ms839kbTime limit exceeded0
101005ms2150kbTime limit exceeded0
Punctaj total0

Ceva nu functioneaza?