Pagini recente » Borderou de evaluare (job #3127508) | Borderou de evaluare (job #143862) | Borderou de evaluare (job #2334607) | Borderou de evaluare (job #3127660) | Borderou de evaluare (job #3127736)
Borderou de evaluare (job #3127736)
Raport evaluator
Compilare:
main.cpp:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
1 | #import<fstream>
| ^~~~~~
main.cpp: In function 'int m(int, int)':
main.cpp:2:114: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
2 | int H[108][108],M[108][108],A,T,Y,p,i,j,n,N,X,Z=1,W=1,L=2,P=2,Q;int m(int i,int j){A++;M[i][j]=1;((H[i][j]>>2)&1)<1&M[i][j+1]<1&&m(i,j+1);((H[i][j]>>1)&1)<1&M[i+1][j]<1&&m(i+1,j);Q=H[i][j];Q==6||Q==7||Q==14||Q==15?T=i,Y=j:0;}main(){std::ifstream f("castel3.in");std::ofstream g("castel3.out");for(f>>p>>n;++i<=n;)for(j=0;++j<=n;f>>H[i][j]);for(i=0;++i<=n;)for(j=0;++j<=n;Q=H[i][j],Q==9||Q==11||Q==13||Q==15?++N,A=0,m(i,j),X<A?X=A,Z=i,W=j,L=T,P=Y:0:0);p<2?g<<N:p<3?g<<X:g<<Z<<' '<<W<<' '<<L<<' '<<P;}
| ~~~~~~~~~~~~~~~~^~
main.cpp:2:155: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
2 | int H[108][108],M[108][108],A,T,Y,p,i,j,n,N,X,Z=1,W=1,L=2,P=2,Q;int m(int i,int j){A++;M[i][j]=1;((H[i][j]>>2)&1)<1&M[i][j+1]<1&&m(i,j+1);((H[i][j]>>1)&1)<1&M[i+1][j]<1&&m(i+1,j);Q=H[i][j];Q==6||Q==7||Q==14||Q==15?T=i,Y=j:0;}main(){std::ifstream f("castel3.in");std::ofstream g("castel3.out");for(f>>p>>n;++i<=n;)for(j=0;++j<=n;f>>H[i][j]);for(i=0;++i<=n;)for(j=0;++j<=n;Q=H[i][j],Q==9||Q==11||Q==13||Q==15?++N,A=0,m(i,j),X<A?X=A,Z=i,W=j,L=T,P=Y:0:0);p<2?g<<N:p<3?g<<X:g<<Z<<' '<<W<<' '<<L<<' '<<P;}
| ~~~~~~~~~~~~~~~~^~
main.cpp:2:225: warning: no return statement in function returning non-void [-Wreturn-type]
2 | int H[108][108],M[108][108],A,T,Y,p,i,j,n,N,X,Z=1,W=1,L=2,P=2,Q;int m(int i,int j){A++;M[i][j]=1;((H[i][j]>>2)&1)<1&M[i][j+1]<1&&m(i,j+1);((H[i][j]>>1)&1)<1&M[i+1][j]<1&&m(i+1,j);Q=H[i][j];Q==6||Q==7||Q==14||Q==15?T=i,Y=j:0;}main(){std::ifstream f("castel3.in");std::ofstream g("castel3.out");for(f>>p>>n;++i<=n;)for(j=0;++j<=n;f>>H[i][j]);for(i=0;++i<=n;)for(j=0;++j<=n;Q=H[i][j],Q==9||Q==11||Q==13||Q==15?++N,A=0,m(i,j),X<A?X=A,Z=i,W=j,L=T,P=Y:0:0);p<2?g<<N:p<3?g<<X:g<<Z<<' '<<W<<' '<<L<<' '<<P;}
| ^
main.cpp: At global scope:
main.cpp:2:226: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
2 | int H[108][108],M[108][108],A,T,Y,p,i,j,n,N,X,Z=1,W=1,L=2,P=2,Q;int m(int i,int j){A++;M[i][j]=1;((H[i][j]>>2)&1)<1&M[i][j+1]<1&&m(i,j+1);((H[i][j]>>1)&1)<1&M[i+1][j]<1&&m(i+1,j);Q=H[i][j];Q==6||Q==7||Q==14||Q==15?T=i,Y=j:0;}main(){std::ifstream f("castel3.in");std::ofstream g("castel3.out");for(f>>p>>n;++i<=n;)for(j=0;++j<=n;f>>H[i][j]);for(i=0;++i<=n;)for(j=0;++j<=n;Q=H[i][j],Q==9||Q==11||Q==13||Q==15?++N,A=0,m(i,j),X<A?X=A,Z=i,W=j,L=T,P=Y:0:0);p<2?g<<N:p<3?g<<X:g<<Z<<' '<<W<<' '<<L<<' '<<P;}
| ^~~~
main.cpp: In function 'int m(int, int)':
main.cpp:2:69: warning: infinite recursion detected [-Winfinite-recursion]
2 | int H[108][108],M[108][108],A,T,Y,p,i,j,n,N,X,Z=1,W=1,L=2,P=2,Q;int m(int i,int j){A++;M[i][j]=1;((H[i][j]>>2)&1)<1&M[i][j+1]<1&&m(i,j+1);((H[i][j]>>1)&1)<1&M[i+1][j]<1&&m(i+1,j);Q=H[i][j];Q==6||Q==7||Q==14||Q==15?T=i,Y=j:0;}main(){std::ifstream f("castel3.in");std::ofstream g("castel3.out");for(f>>p>>n;++i<=n;)for(j=0;++j<=n;f>>H[i][j]);for(i=0;++i<=n;)for(j=0;++j<=n;Q=H[i][j],Q==9||Q==11||Q==13||Q==15?++N,A=0,m(i,j),X<A?X=A,Z=i,W=j,L=T,P=Y:0:0);p<2?g<<N:p<3?g<<X:g<<Z<<' '<<W<<' '<<L<<' '<<P;}
| ^
main.cpp:2:131: note: recursive call
2 | int H[108][108],M[108][108],A,T,Y,p,i,j,n,N,X,Z=1,W=1,L=2,P=2,Q;int m(int i,int j){A++;M[i][j]=1;((H[i][j]>>2)&1)<1&M[i][j+1]<1&&m(i,j+1);((H[i][j]>>1)&1)<1&M[i+1][j]<1&&m(i+1,j);Q=H[i][j];Q==6||Q==7||Q==14||Q==15?T=i,Y=j:0;}main(){std::ifstream f("castel3.in");std::ofstream g("castel3.out");for(f>>p>>n;++i<=n;)for(j=0;++j<=n;f>>H[i][j]);for(i=0;++i<=n;)for(j=0;++j<=n;Q=H[i][j],Q==9||Q==11||Q==13||Q==15?++N,A=0,m(i,j),X<A?X=A,Z=i,W=j,L=T,P=Y:0:0);p<2?g<<N:p<3?g<<X:g<<Z<<' '<<W<<' '<<L<<' '<<P;}
| ~^~~~~~~
main.cpp:2:172: note: recursive call
2 | int H[108][108],M[108][108],A,T,Y,p,i,j,n,N,X,Z=1,W=1,L=2,P=2,Q;int m(int i,int j){A++;M[i][j]=1;((H[i][j]>>2)&1)<1&M[i][j+1]<1&&m(i,j+1);((H[i][j]>>1)&1)<1&M[i+1][j]<1&&m(i+1,j);Q=H[i][j];Q==6||Q==7||Q==14||Q==15?T=i,Y=j:0;}main(){std::ifstream f("castel3.in");std::ofstream g("castel3.out");for(f>>p>>n;++i<=n;)for(j=0;++j<=n;f>>H[i][j]);for(i=0;++i<=n;)for(j=0;++j<=n;Q=H[i][j],Q==9||Q==11||Q==13||Q==15?++N,A=0,m(i,j),X<A?X=A,Z=i,W=j,L=T,P=Y:0:0);p<2?g<<N:p<3?g<<X:g<<Z<<' '<<W<<' '<<L<<' '<<P;}
| ~^~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 10ms | 491kb | Killed by Signal 11 | 0 |
2 | 10ms | 483kb | Killed by Signal 11 | 0 |
3 | 10ms | 487kb | Killed by Signal 11 | 0 |
4 | 10ms | 487kb | Killed by Signal 11 | 0 |
5 | 10ms | 507kb | Killed by Signal 11 | 0 |
6 | 10ms | 512kb | Killed by Signal 11 | 0 |
7 | 10ms | 528kb | Killed by Signal 11 | 0 |
8 | 10ms | 512kb | Killed by Signal 11 | 0 |
9 | 10ms | 512kb | Killed by Signal 11 | 0 |
10 | 10ms | 520kb | Killed by Signal 11 | 0 |
11 | 1ms | 520kb | Killed by Signal 11 | 0 |
12 | 1ms | 483kb | Killed by Signal 11 | 0 |
13 | 1ms | 491kb | Killed by Signal 11 | 0 |
14 | 1ms | 499kb | Killed by Signal 11 | 0 |
15 | 1ms | 512kb | Killed by Signal 11 | 0 |
16 | 1ms | 503kb | Killed by Signal 11 | 0 |
17 | 1ms | 516kb | Killed by Signal 11 | 0 |
18 | 12ms | 520kb | Killed by Signal 11 | 0 |
19 | 10ms | 524kb | Killed by Signal 11 | 0 |
20 | 10ms | 524kb | Killed by Signal 11 | 0 |
21 | 10ms | 573kb | Killed by Signal 11 | 0 |
Punctaj total | 0 |