Borderou de evaluare (job #2944727)

Utilizator lucaperjuLuca Perju Verzotti lucaperju Data 22 noiembrie 2022 21:40:20
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:167: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type] 2 | using namespace std;ofstream w("apm.out");ifstream r("apm.in");tuple<int,int,int>e[1<<20],d;int t[1<<20],m,a,b,c,i,j,k,x,p,q;int f(int x){return t[x]?t[x]=f(t[x]):x;}main(){r>>m>>m;while(r>>a>>b>>c)e[i++]={c,a,b};sort(e,e+m);for(;j<m;)tie(c,a,b)=e[f(b)^(x=f(a))?t[x]=b,p+=c,q++:j++]=e[j];w<<p<<" "<<q<<" ";for(;k<m;)tie(c,a,b)=e[k++],w<<a<<" "<<b<<" ";} | ^~~~ main.cpp: In function 'int main()': main.cpp:2:280: warning: operation on 'j' may be undefined [-Wsequence-point] 2 | using namespace std;ofstream w("apm.out");ifstream r("apm.in");tuple<int,int,int>e[1<<20],d;int t[1<<20],m,a,b,c,i,j,k,x,p,q;int f(int x){return t[x]?t[x]=f(t[x]):x;}main(){r>>m>>m;while(r>>a>>b>>c)e[i++]={c,a,b};sort(e,e+m);for(;j<m;)tie(c,a,b)=e[f(b)^(x=f(a))?t[x]=b,p+=c,q++:j++]=e[j];w<<p<<" "<<q<<" ";for(;k<m;)tie(c,a,b)=e[k++],w<<a<<" "<<b<<" ";} | ~^~ main.cpp:2:280: warning: operation on 'j' may be undefined [-Wsequence-point]
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms184kbSubgraful selectat nu e arbore0
20ms184kbCost incorect0
30ms184kbCost incorect0
40ms188kbCost incorect0
50ms184kbCost incorect0
670ms2863kbCost incorect0
7105ms4231kbCost incorect0
816ms905kbCost incorect0
929ms1335kbCost incorect0
1096ms3993kbCost incorect0
Punctaj total0

Ceva nu functioneaza?