蒟蒻60分,求助

P1002 [NOIP2002 普及组] 过河卒

建议坐标全体+2 不然数组容易越界
by Ravener @ 2024-04-18 20:15:48


@[wang_zi_yi_233](/user/1168953)
by Ravener @ 2024-04-18 20:16:00


还是 $60$ 分
by wang_zi_yi_233 @ 2024-04-19 06:32:38


```cpp #include<bits/stdc++.h> using namespace std; int dx[]={0,2,1,-1,-2,-2,-1,1,2}; int dy[]={0,1,2,2,1,-1,-2,-2,-1}; bool b[105][105]; long long p[105][105]; int main() { int n,m,mx,my; scanf("%d %d %d %d",&n,&m,&mx,&my); n+=2; m+=2; mx+=2; my+=2; for(int i=0;i<=8;i++) { int x=mx+dx[i]; int y=my+dy[i]; if(x>=2 && x<=n && y>=2 && y<=m) b[x][y]=1; } p[2][2]=1; for(int i=2;i<=n;i++) { for(int j=2;j<=m;j++) { if(b[i][j]==0) { if(i==2 && j==2) continue; if(i==2) p[i][j]=p[i][j-1]; if(j==2) p[i][j]=p[i-1][j]; if(i!=2 && j!=2) p[i][j]=p[i-1][j]+p[i][j-1]; } } } printf("%d",p[n][m]); return 0; } ```
by wang_zi_yi_233 @ 2024-04-19 06:33:52


没看见 **long long** 啊!!!!!给后代一个警示!!!!!
by wang_zi_yi_233 @ 2024-04-19 06:42:00


看下评测记录
by hujiarui140608 @ 2024-04-22 21:14:34


|