Pagini recente » Borderou de evaluare (job #447515) | Borderou de evaluare (job #2106752) | Borderou de evaluare (job #149150) | Borderou de evaluare (job #20970) | Borderou de evaluare (job #1332673)
Borderou de evaluare (job #1332673)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:3:608: warning: unused variable ‘p’ [-Wunused-variable]
using namespace std;int dx[4]={-1,0,0,1},dy[4]={0,-1,1,0};int a[1031][1031],b[1031][1031],solx[1000001],soly[1000001],xs,ys,n;int fill(int x1,int y1){int Max=0,j,x,y;for(j=0;j<=3;j++){x=x1+dx[j];y=y1+dy[j];if(x<1||x>n||y<1||y>n)continue;if(a[x][y]>a[x1][y1]){if(b[x][y]!=-1){Max=max(Max,b[x][y]);}else{Max=max(Max,fill(x,y));}}}b[x1][y1]=Max+1;return Max+1;}void afis(int x,int y,int k){solx[k]=x;soly[k]=y;if(k==0)return;else{if(b[x-1][y]==k-1){afis(x-1,y,k-1);}else if(b[x+1][y]==k-1){afis(x+1,y,k-1);}else if(b[x][y-1]==k-1){afis(x,y-1,k-1);}else if(b[x][y+1]==k-1){afis(x,y+1,k-1);}}}int main(){int i,j,p,r,k,Max=-1;freopen("alpin.in","r",stdin);freopen("alpin.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++)for(j=1;j<=n;j++){scanf("%d",&a[i][j]);b[i][j]=-1;}for(i=1;i<=n;i++){for(j=1;j<=n;j++){if(b[i][j]==-1){b[i][j]=fill(i,j);if(b[i][j]>Max){Max=b[i][j];xs=i;ys=j;}}}}printf("%d\n",Max);afis(xs,ys,Max);for(i=1;i<=Max;i++)printf("%d %d\n",solx[Max-i+1],soly[Max-i+1]);return 0;}
^
user.cpp:3:610: warning: unused variable ‘r’ [-Wunused-variable]
using namespace std;int dx[4]={-1,0,0,1},dy[4]={0,-1,1,0};int a[1031][1031],b[1031][1031],solx[1000001],soly[1000001],xs,ys,n;int fill(int x1,int y1){int Max=0,j,x,y;for(j=0;j<=3;j++){x=x1+dx[j];y=y1+dy[j];if(x<1||x>n||y<1||y>n)continue;if(a[x][y]>a[x1][y1]){if(b[x][y]!=-1){Max=max(Max,b[x][y]);}else{Max=max(Max,fill(x,y));}}}b[x1][y1]=Max+1;return Max+1;}void afis(int x,int y,int k){solx[k]=x;soly[k]=y;if(k==0)return;else{if(b[x-1][y]==k-1){afis(x-1,y,k-1);}else if(b[x+1][y]==k-1){afis(x+1,y,k-1);}else if(b[x][y-1]==k-1){afis(x,y-1,k-1);}else if(b[x][y+1]==k-1){afis(x,y+1,k-1);}}}int main(){int i,j,p,r,k,Max=-1;freopen("alpin.in","r",stdin);freopen("alpin.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++)for(j=1;j<=n;j++){scanf("%d",&a[i][j]);b[i][j]=-1;}for(i=1;i<=n;i++){for(j=1;j<=n;j++){if(b[i][j]==-1){b[i][j]=fill(i,j);if(b[i][j]>Max){Max=b[i][j];xs=i;ys=j;}}}}printf("%d\n",Max);afis(xs,ys,Max);for(i=1;i<=Max;i++)printf("%d %d\n",solx[Max-i+1],soly[Max-i+1]);return 0;}
^
user.cpp:3:612: warning: unused variable ‘k’ [-Wunused-variable]
using namespace std;int dx[4]={-1,0,0,1},dy[4]={0,-1,1,0};int a[1031][1031],b[1031][1031],solx[1000001],soly[1000001],xs,ys,n;int fill(int x1,int y1){int Max=0,j,x,y;for(j=0;j<=3;j++){x=x1+dx[j];y=y1+dy[j];if(x<1||x>n||y<1||y>n)continue;if(a[x][y]>a[x1][y1]){if(b[x][y]!=-1){Max=max(Max,b[x][y]);}else{Max=max(Max,fill(x,y));}}}b[x1][y1]=Max+1;return Max+1;}void afis(int x,int y,int k){solx[k]=x;soly[k]=y;if(k==0)return;else{if(b[x-1][y]==k-1){afis(x-1,y,k-1);}else if(b[x+1][y]==k-1){afis(x+1,y,k-1);}else if(b[x][y-1]==k-1){afis(x,y-1,k-1);}else if(b[x][y+1]==k-1){afis(x,y+1,k-1);}}}int main(){int i,j,p,r,k,Max=-1;freopen("alpin.in","r",stdin);freopen("alpin.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++)for(j=1;j<=n;j++){scanf("%d",&a[i][j]);b[i][j]=-1;}for(i=1;i<=n;i++){for(j=1;j<=n;j++){if(b[i][j]==-1){b[i][j]=fill(i,j);if(b[i][j]>Max){Max=b[i][j];xs=i;ys=j;}}}}printf("%d\n",Max);afis(xs,ys,Max);for(i=1;i<=Max;i++)printf("%d %d\n",solx[Max-i+1],soly[Max-i+1]);return 0;}
^
user.cpp:3:650: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int dx[4]={-1,0,0,1},dy[4]={0,-1,1,0};int a[1031][1031],b[1031][1031],solx[1000001],soly[1000001],xs,ys,n;int fill(int x1,int y1){int Max=0,j,x,y;for(j=0;j<=3;j++){x=x1+dx[j];y=y1+dy[j];if(x<1||x>n||y<1||y>n)continue;if(a[x][y]>a[x1][y1]){if(b[x][y]!=-1){Max=max(Max,b[x][y]);}else{Max=max(Max,fill(x,y));}}}b[x1][y1]=Max+1;return Max+1;}void afis(int x,int y,int k){solx[k]=x;soly[k]=y;if(k==0)return;else{if(b[x-1][y]==k-1){afis(x-1,y,k-1);}else if(b[x+1][y]==k-1){afis(x+1,y,k-1);}else if(b[x][y-1]==k-1){afis(x,y-1,k-1);}else if(b[x][y+1]==k-1){afis(x,y+1,k-1);}}}int main(){int i,j,p,r,k,Max=-1;freopen("alpin.in","r",stdin);freopen("alpin.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++)for(j=1;j<=n;j++){scanf("%d",&a[i][j]);b[i][j]=-1;}for(i=1;i<=n;i++){for(j=1;j<=n;j++){if(b[i][j]==-1){b[i][j]=fill(i,j);if(b[i][j]>Max){Max=b[i][j];xs=i;ys=j;}}}}printf("%d\n",Max);afis(xs,ys,Max);for(i=1;i<=Max;i++)printf("%d %d\n",solx[Max-i+1],soly[Max-i+1]);return 0;}
^
user.cpp:3:682: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int dx[4]={-1,0,0,1},dy[4]={0,-1,1,0};int a[1031][1031],b[1031][1031],solx[1000001],soly[1000001],xs,ys,n;int fill(int x1,int y1){int Max=0,j,x,y;for(j=0;j<=3;j++){x=x1+dx[j];y=y1+dy[j];if(x<1||x>n||y<1||y>n)continue;if(a[x][y]>a[x1][y1]){if(b[x][y]!=-1){Max=max(Max,b[x][y]);}else{Max=max(Max,fill(x,y));}}}b[x1][y1]=Max+1;return Max+1;}void afis(int x,int y,int k){solx[k]=x;soly[k]=y;if(k==0)return;else{if(b[x-1][y]==k-1){afis(x-1,y,k-1);}else if(b[x+1][y]==k-1){afis(x+1,y,k-1);}else if(b[x][y-1]==k-1){afis(x,y-1,k-1);}else if(b[x][y+1]==k-1){afis(x,y+1,k-1);}}}int main(){int i,j,p,r,k,Max=-1;freopen("alpin.in","r",stdin);freopen("alpin.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++)for(j=1;j<=n;j++){scanf("%d",&a[i][j]);b[i][j]=-1;}for(i=1;i<=n;i++){for(j=1;j<=n;j++){if(b[i][j]==-1){b[i][j]=fill(i,j);if(b[i][j]>Max){Max=b[i][j];xs=i;ys=j;}}}}printf("%d\n",Max);afis(xs,ys,Max);for(i=1;i<=Max;i++)printf("%d %d\n",solx[Max-i+1],soly[Max-i+1]);return 0;}
^
user.cpp:3:697: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int dx[4]={-1,0,0,1},dy[4]={0,-1,1,0};int a[1031][1031],b[1031][1031],solx[1000001],soly[1000001],xs,ys,n;int fill(int x1,int y1){int Max=0,j,x,y;for(j=0;j<=3;j++){x=x1+dx[j];y=y1+dy[j];if(x<1||x>n||y<1||y>n)continue;if(a[x][y]>a[x1][y1]){if(b[x][y]!=-1){Max=max(Max,b[x][y]);}else{Max=max(Max,fill(x,y));}}}b[x1][y1]=Max+1;return Max+1;}void afis(int x,int y,int k){solx[k]=x;soly[k]=y;if(k==0)return;else{if(b[x-1][y]==k-1){afis(x-1,y,k-1);}else if(b[x+1][y]==k-1){afis(x+1,y,k-1);}else if(b[x][y-1]==k-1){afis(x,y-1,k-1);}else if(b[x][y+1]==k-1){afis(x,y+1,k-1);}}}int main(){int i,j,p,r,k,Max=-1;freopen("alpin.in","r",stdin);freopen("alpin.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++)for(j=1;j<=n;j++){scanf("%d",&a[i][j]);b[i][j]=-1;}for(i=1;i<=n;i++){for(j=1;j<=n;j++){if(b[i][j]==-1){b[i][j]=fill(i,j);if(b[i][j]>Max){Max=b[i][j];xs=i;ys=j;}}}}printf("%d\n",Max);afis(xs,ys,Max);for(i=1;i<=Max;i++)printf("%d %d\n",solx[Max-i+1],soly[Max-i+1]);return 0;}
^
user.cpp:3:753: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int dx[4]={-1,0,0,1},dy[4]={0,-1,1,0};int a[1031][1031],b[1031][1031],solx[1000001],soly[1000001],xs,ys,n;int fill(int x1,int y1){int Max=0,j,x,y;for(j=0;j<=3;j++){x=x1+dx[j];y=y1+dy[j];if(x<1||x>n||y<1||y>n)continue;if(a[x][y]>a[x1][y1]){if(b[x][y]!=-1){Max=max(Max,b[x][y]);}else{Max=max(Max,fill(x,y));}}}b[x1][y1]=Max+1;return Max+1;}void afis(int x,int y,int k){solx[k]=x;soly[k]=y;if(k==0)return;else{if(b[x-1][y]==k-1){afis(x-1,y,k-1);}else if(b[x+1][y]==k-1){afis(x+1,y,k-1);}else if(b[x][y-1]==k-1){afis(x,y-1,k-1);}else if(b[x][y+1]==k-1){afis(x,y+1,k-1);}}}int main(){int i,j,p,r,k,Max=-1;freopen("alpin.in","r",stdin);freopen("alpin.out","w",stdout);scanf("%d",&n);for(i=1;i<=n;i++)for(j=1;j<=n;j++){scanf("%d",&a[i][j]);b[i][j]=-1;}for(i=1;i<=n;i++){for(j=1;j<=n;j++){if(b[i][j]==-1){b[i][j]=fill(i,j);if(b[i][j]>Max){Max=b[i][j];xs=i;ys=j;}}}}printf("%d\n",Max);afis(xs,ys,Max);for(i=1;i<=Max;i++)printf("%d %d\n",solx[Max-i+1],soly[Max-i+1]);return 0;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 408kb | Alpinistul si-a indeplinit sarcina! | 10 |
2 | 0ms | 812kb | Alpinistul si-a indeplinit sarcina! | 10 |
3 | 4ms | 1276kb | Alpinistul si-a indeplinit sarcina! | 10 |
4 | 12ms | 2140kb | Alpinistul si-a indeplinit sarcina! | 10 |
5 | 36ms | 2860kb | Alpinistul si-a indeplinit sarcina! | 10 |
6 | 64ms | 3844kb | Alpinistul si-a indeplinit sarcina! | 10 |
7 | 192ms | 6592kb | Alpinistul si-a indeplinit sarcina! | 10 |
8 | 256ms | 7584kb | Alpinistul si-a indeplinit sarcina! | 10 |
9 | 280ms | 8312kb | Alpinistul si-a indeplinit sarcina! | 10 |
10 | 356ms | 8508kb | Alpinistul si-a indeplinit sarcina! | 10 |
Punctaj total | 100 |