Pagini recente » Borderou de evaluare (job #932943) | Borderou de evaluare (job #3317061) | Borderou de evaluare (job #2358909) | Cod sursa (job #167347) | Borderou de evaluare (job #2943504)
Borderou de evaluare (job #2943504)
Raport evaluator
Compilare:
main.cpp:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
1 | #import<bits/stdc++.h>
| ^~~~~~
main.cpp:2:70: warning: multi-character character constant [-Wmultichar]
2 | std::ifstream r("apm.in");std::ofstream w("apm.out");int m,k,i,j,z,t['■'],x;struct s{int x,y,z;}d,e['■'];int f(int x){return x^t[x]?t[x]=f(t[x]):x;}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;});while(j<m)d=e[j],e[(t[x=f(d.x)]=f(d.y))^x?z+=d.z,k++:j++]=d;w<<z<<" "<<k<<" ";while(k--)w<<e[k].x<<" "<<e[k].y<<" ";}
| ^~~
main.cpp:2:103: warning: multi-character character constant [-Wmultichar]
2 | std::ifstream r("apm.in");std::ofstream w("apm.out");int m,k,i,j,z,t['■'],x;struct s{int x,y,z;}d,e['■'];int f(int x){return x^t[x]?t[x]=f(t[x]):x;}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;});while(j<m)d=e[j],e[(t[x=f(d.x)]=f(d.y))^x?z+=d.z,k++:j++]=d;w<<z<<" "<<k<<" ";while(k--)w<<e[k].x<<" "<<e[k].y<<" ";}
| ^~~
main.cpp:2:153: 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['■'],x;struct s{int x,y,z;}d,e['■'];int f(int x){return x^t[x]?t[x]=f(t[x]):x;}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;});while(j<m)d=e[j],e[(t[x=f(d.x)]=f(d.y))^x?z+=d.z,k++:j++]=d;w<<z<<" "<<k<<" ";while(k--)w<<e[k].x<<" "<<e[k].y<<" ";}
| ^~~~
main.cpp: In function 'int main()':
main.cpp:2:278: warning: operation on 'x' may be undefined [-Wsequence-point]
2 | std::ifstream r("apm.in");std::ofstream w("apm.out");int m,k,i,j,z,t['■'],x;struct s{int x,y,z;}d,e['■'];int f(int x){return x^t[x]?t[x]=f(t[x]):x;}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;});while(j<m)d=e[j],e[(t[x=f(d.x)]=f(d.y))^x?z+=d.z,k++:j++]=d;w<<z<<" "<<k<<" ";while(k--)w<<e[k].x<<" "<<e[k].y<<" ";}
| ~^~~~~~~
main.cpp:2:278: warning: operation on 'x' may be undefined [-Wsequence-point]
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 184kb | Corect | 10 |
| 2 | 0ms | 184kb | Corect | 10 |
| 3 | 0ms | 184kb | Corect | 10 |
| 4 | 0ms | 184kb | Corect | 10 |
| 5 | 0ms | 184kb | Corect | 10 |
| 6 | 42ms | 2002kb | Corect | 10 |
| 7 | 84ms | 3751kb | Corect | 10 |
| 8 | 15ms | 909kb | Corect | 10 |
| 9 | 12ms | 1101kb | Corect | 10 |
| 10 | 72ms | 3215kb | Corect | 10 |
| Punctaj total | 100 |