社区讨论
3, 4wa求助
P1002[NOIP 2002 普及组] 过河卒参与者 2已保存回复 1
讨论操作
快速查看讨论及其快照的属性,并进行相关操作。
- 当前回复
- 1 条
- 当前快照
- 1 份
- 快照标识符
- @lo87jw9b
- 此快照首次捕获于
- 2023/10/27 14:03 2 年前
- 此快照最后确认于
- 2023/10/27 14:03 2 年前
CPP
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
int m;
int rn;
int rm;
int ans;
array <array <int, 30>, 30> a;
inline void init()
{
scanf("%d%d", &rn, &rm);
scanf("%d%d", &n, &m);
rn += 3;
rm += 3;
n += 3;
m += 3;
for (int i = 3; i <= rn; i++)
{
for (int j = 3; j <= rm; j++)
{
a[i][j] = 1;
}
}
a[n][m] = -1;
a[n-1][m+2] = -1;
a[n+1][m+2] = -1;
a[n-1][m-2] = -1;
a[n+1][m-2] = -1;
a[n+2][m+1] = -1;
a[n-2][m+1] = -1;
a[n+2][m-1] = -1;
a[n-2][m-1] = -1;
}
signed main(signed argc, char **argv)
{
init();
for (int i = 3; i <= rn; i++)
{
for (int j = 3; j <= rm; j++)
{
if (i == 3 && j == 3)
{
continue;
}
if (a[i][j] == -1)
{
continue;
}
if (a[i][j-1] == -1 && a[i-1][j] == -1)
{
a[i][j] = -1;
continue;
}
if (a[i][j-1] != -1 && a[i-1][j] == -1)
{
a[i][j] = a[i][j-1];
continue;
}
if (a[i][j-1] == -1 && a[i-1][j] != -1)
{
a[i][j] = a[i-1][j];
continue;
}
a[i][j] = a[i-1][j] + a[i][j-1];
}
}
printf("%d", a[rn][rm]);
return 0;
}
回复
共 1 条回复,欢迎继续交流。
正在加载回复...