传送门
分析
我们分析一下,假设
f
[
i
]
f[i]
f[i]表示
i
i
i点是否放置地雷,那么可以写出
a
[
i
]
=
f
[
i
]
+
f
[
i
−
1
]
+
f
[
i
+
1
]
a[i] = f[i] + f[i - 1] + f[i + 1]
a[i]=f[i]+f[i−1]+f[i+1]
我们把
i
i
i用
i
−
1
i - 1
i−1代替,可以得倒
a
[
i
−
1
]
=
f
[
i
−
1
]
+
f
[
i
−
2
]
+
f
[
i
]
a[i - 1] = f[i - 1] + f[i - 2] + f[i]
a[i−1]=f[i−1]+f[i−2]+f[i]
f
[
i
]
=
a
[
i
−
1
]
−
f
[
i
−
1
]
−
f
[
i
−
2
]
f[i] = a[i - 1] - f[i - 1] - f[i - 2]
f[i]=a[i−1]−f[i−1]−f[i−2]
这样就可以得到一个无后效性的表达式,递推判断合法性即可
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 10;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
int a[N],f[N];
int n;
int check(int x){
memset(f,0,sizeof f);
f[1] = x;
for(int i = 2;i <= n;i++){
f[i] = a[i - 1] - f[i - 1] - f[i - 2];
if(f[i] == 1 || f[i] == 0) continue;
else return 0;
}
if(f[n - 1] + f[n] != a[n]) return 0;
return 1;
}
int main() {
read(n);
for(int i = 1;i <= n;i++) read(a[i]);
int ans = 0;
ans += check(0);
ans += check(1);
di(ans);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/