Borderou de evaluare (job #2944726)

Utilizator lucaperjuLuca Perju Verzotti lucaperju Data 22 noiembrie 2022 21:39:28
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:163: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type] 2 | using namespace std;ofstream w("a.out");ifstream r("a.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:276: warning: operation on 'j' may be undefined [-Wsequence-point] 2 | using namespace std;ofstream w("a.out");ifstream r("a.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:276: warning: operation on 'j' may be undefined [-Wsequence-point]
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms188kbFisier de iesire lipsa!0
20ms184kbFisier de iesire lipsa!0
30ms184kbFisier de iesire lipsa!0
40ms184kbFisier de iesire lipsa!0
50ms184kbFisier de iesire lipsa!0
60ms184kbFisier de iesire lipsa!0
70ms184kbFisier de iesire lipsa!0
80ms184kbFisier de iesire lipsa!0
90ms188kbFisier de iesire lipsa!0
100ms184kbFisier de iesire lipsa!0
Punctaj total0

Ceva nu functioneaza?