Borderou de evaluare (job #2841309)
Utilizator | Data | 29 ianuarie 2022 15:28:11 | |
---|---|---|---|
Problema | Arbori de intervale | Status | done |
Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
1 | #import<fstream>
| ^~~~~~
main.cpp:4:27: error: ISO C++ forbids declaration of 'u' with no type [-fpermissive]
4 | l a[400000],p=1,v,m,k,n,o;u(l s,l d,l i){if(s-d){m=(s+d)/2;if(p<=m)u(s,m,i*2+1);else u(m+1,d,i*2+2);a[i]=std::max(a[i*2+1],a[i*2+2]);}else a[i]=v;}l q(l s,l d,l x,l y,l i){if(x-s+d-y){m=(s+d)/2;if(y<=m)R q(s,m,x,y,i*2+1);if(x>m)R q(m+1,d,x,y,i*2+2);R std::max(q(s,m,x,m,i*2+1),q(m+1,d,m+1,y,i*2+2));}R a[i];}main(){std::ifstream f("arbint.in");std::ofstream g("arbint.out");f>>n>>k;for(;p<=n;p++){f>>v;u(1,n,0);}while(k--){f>>p;if(p){f>>p>>v;u(1,n,0);}else{f>>p>>v;g<<q(1,n,p,v,0)<<'\n';}}}
| ^
main.cpp: In function 'int u(int, int, int)':
main.cpp:4:147: warning: no return statement in function returning non-void [-Wreturn-type]
4 | l a[400000],p=1,v,m,k,n,o;u(l s,l d,l i){if(s-d){m=(s+d)/2;if(p<=m)u(s,m,i*2+1);else u(m+1,d,i*2+2);a[i]=std::max(a[i*2+1],a[i*2+2]);}else a[i]=v;}l q(l s,l d,l x,l y,l i){if(x-s+d-y){m=(s+d)/2;if(y<=m)R q(s,m,x,y,i*2+1);if(x>m)R q(m+1,d,x,y,i*2+2);R std::max(q(s,m,x,m,i*2+1),q(m+1,d,m+1,y,i*2+2));}R a[i];}main(){std::ifstream f("arbint.in");std::ofstream g("arbint.out");f>>n>>k;for(;p<=n;p++){f>>v;u(1,n,0);}while(k--){f>>p;if(p){f>>p>>v;u(1,n,0);}else{f>>p>>v;g<<q(1,n,p,v,0)<<'\n';}}}
| ^
main.cpp: At global scope:
main.cpp:4:309: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
4 | l a[400000],p=1,v,m,k,n,o;u(l s,l d,l i){if(s-d){m=(s+d)/2;if(p<=m)u(s,m,i*2+1);else u(m+1,d,i*2+2);a[i]=std::max(a[i*2+1],a[i*2+2]);}else a[i]=v;}l q(l s,l d,l x,l y,l i){if(x-s+d-y){m=(s+d)/2;if(y<=m)R q(s,m,x,y,i*2+1);if(x>m)R q(m+1,d,x,y,i*2+2);R std::max(q(s,m,x,m,i*2+1),q(m+1,d,m+1,y,i*2+2));}R a[i];}main(){std::ifstream f("arbint.in");std::ofstream g("arbint.out");f>>n>>k;for(;p<=n;p++){f>>v;u(1,n,0);}while(k--){f>>p;if(p){f>>p>>v;u(1,n,0);}else{f>>p>>v;g<<q(1,n,p,v,0)<<'\n';}}}
| ^~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !