Pagini recente » Borderou de evaluare (job #2352906) | Borderou de evaluare (job #1208699) | Borderou de evaluare (job #1223732) | Borderou de evaluare (job #2944052) | Borderou de evaluare (job #2944727)
Borderou de evaluare (job #2944727)
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 |
| 1 | 0ms | 184kb | Subgraful selectat nu e arbore | 0 |
| 2 | 0ms | 184kb | Cost incorect | 0 |
| 3 | 0ms | 184kb | Cost incorect | 0 |
| 4 | 0ms | 188kb | Cost incorect | 0 |
| 5 | 0ms | 184kb | Cost incorect | 0 |
| 6 | 70ms | 2863kb | Cost incorect | 0 |
| 7 | 105ms | 4231kb | Cost incorect | 0 |
| 8 | 16ms | 905kb | Cost incorect | 0 |
| 9 | 29ms | 1335kb | Cost incorect | 0 |
| 10 | 96ms | 3993kb | Cost incorect | 0 |
| Punctaj total | 0 |