Borderou de evaluare (job #1766254)

Utilizator mihai2003LLL LLL mihai2003 Data 27 septembrie 2016 19:17:16
Problema Plantatie Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 10

Raport evaluator

Compilare: user.cpp: In function ‘int main()’: user.cpp:4:35: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] {freopen("plantatie.in","r",stdin);freopen("plantatie.out","w",stdout);int n,m,i,b,a,j;scanf("%d %d",&n,&m);log[1]=0;for(i=2;i<=n;i++)log[i]=1+log[i/2];for(i=1;i<=n;i++){for(j=1;j<=n;j++){scanf("%d",&r[i][j][0]);for(int k=1;(1<<k)<=i && (1<<k)<=j;k++){r[i][j][k]=max(max(r[i-(1<<(k-1))][j-(1<<(k-1))][k-1],r[i-(1<<(k-1))][j][k-1]),max(r[i][j-(1<<(k-1))][k-1] ,r[i][j][k-1]));}}}for(i=1;i<=m;i++){int c;scanf("%d %d %d",&a,&b,&c);int q,l;l=log[c]-1;;q=max(max(r[a+(1<<l)-1][b+(1<<l)-1][l],r[a+(1<<l)-1][b+c-1][l]),max(r[a+c-1][b+(1<<l)-1][l],r[a+c-1][b+c-1][l]));printf("%d\n",q);}return 0;} ^ user.cpp:4:71: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result] {freopen("plantatie.in","r",stdin);freopen("plantatie.out","w",stdout);int n,m,i,b,a,j;scanf("%d %d",&n,&m);log[1]=0;for(i=2;i<=n;i++)log[i]=1+log[i/2];for(i=1;i<=n;i++){for(j=1;j<=n;j++){scanf("%d",&r[i][j][0]);for(int k=1;(1<<k)<=i && (1<<k)<=j;k++){r[i][j][k]=max(max(r[i-(1<<(k-1))][j-(1<<(k-1))][k-1],r[i-(1<<(k-1))][j][k-1]),max(r[i][j-(1<<(k-1))][k-1] ,r[i][j][k-1]));}}}for(i=1;i<=m;i++){int c;scanf("%d %d %d",&a,&b,&c);int q,l;l=log[c]-1;;q=max(max(r[a+(1<<l)-1][b+(1<<l)-1][l],r[a+(1<<l)-1][b+c-1][l]),max(r[a+c-1][b+(1<<l)-1][l],r[a+c-1][b+c-1][l]));printf("%d\n",q);}return 0;} ^ user.cpp:4:108: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] {freopen("plantatie.in","r",stdin);freopen("plantatie.out","w",stdout);int n,m,i,b,a,j;scanf("%d %d",&n,&m);log[1]=0;for(i=2;i<=n;i++)log[i]=1+log[i/2];for(i=1;i<=n;i++){for(j=1;j<=n;j++){scanf("%d",&r[i][j][0]);for(int k=1;(1<<k)<=i && (1<<k)<=j;k++){r[i][j][k]=max(max(r[i-(1<<(k-1))][j-(1<<(k-1))][k-1],r[i-(1<<(k-1))][j][k-1]),max(r[i][j-(1<<(k-1))][k-1] ,r[i][j][k-1]));}}}for(i=1;i<=m;i++){int c;scanf("%d %d %d",&a,&b,&c);int q,l;l=log[c]-1;;q=max(max(r[a+(1<<l)-1][b+(1<<l)-1][l],r[a+(1<<l)-1][b+c-1][l]),max(r[a+c-1][b+(1<<l)-1][l],r[a+c-1][b+c-1][l]));printf("%d\n",q);}return 0;} ^ user.cpp:4:212: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] {freopen("plantatie.in","r",stdin);freopen("plantatie.out","w",stdout);int n,m,i,b,a,j;scanf("%d %d",&n,&m);log[1]=0;for(i=2;i<=n;i++)log[i]=1+log[i/2];for(i=1;i<=n;i++){for(j=1;j<=n;j++){scanf("%d",&r[i][j][0]);for(int k=1;(1<<k)<=i && (1<<k)<=j;k++){r[i][j][k]=max(max(r[i-(1<<(k-1))][j-(1<<(k-1))][k-1],r[i-(1<<(k-1))][j][k-1]),max(r[i][j-(1<<(k-1))][k-1] ,r[i][j][k-1]));}}}for(i=1;i<=m;i++){int c;scanf("%d %d %d",&a,&b,&c);int q,l;l=log[c]-1;;q=max(max(r[a+(1<<l)-1][b+(1<<l)-1][l],r[a+(1<<l)-1][b+c-1][l]),max(r[a+c-1][b+(1<<l)-1][l],r[a+c-1][b+c-1][l]));printf("%d\n",q);}return 0;} ^ user.cpp:4:431: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] {freopen("plantatie.in","r",stdin);freopen("plantatie.out","w",stdout);int n,m,i,b,a,j;scanf("%d %d",&n,&m);log[1]=0;for(i=2;i<=n;i++)log[i]=1+log[i/2];for(i=1;i<=n;i++){for(j=1;j<=n;j++){scanf("%d",&r[i][j][0]);for(int k=1;(1<<k)<=i && (1<<k)<=j;k++){r[i][j][k]=max(max(r[i-(1<<(k-1))][j-(1<<(k-1))][k-1],r[i-(1<<(k-1))][j][k-1]),max(r[i][j-(1<<(k-1))][k-1] ,r[i][j][k-1]));}}}for(i=1;i<=m;i++){int c;scanf("%d %d %d",&a,&b,&c);int q,l;l=log[c]-1;;q=max(max(r[a+(1<<l)-1][b+(1<<l)-1][l],r[a+(1<<l)-1][b+c-1][l]),max(r[a+c-1][b+(1<<l)-1][l],r[a+c-1][b+c-1][l]));printf("%d\n",q);}return 0;} ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
10ms468kbOK1010
20ms644kbIncorect00
30ms1024kbIncorect00
44ms1820kbIncorect00
512ms3228kbIncorect00
628ms5140kbIncorect00
760ms10408kbIncorect0
8116ms17632kbIncorect0
9168ms25104kbIncorect0
10180ms25108kbIncorect0
Punctaj total10

Ceva nu functioneaza?