思路:
后一个状态可以由之前的推导。
对于某一个i,如果不等于前一个数,就可以继承前一个数的情况,等于就不行。
#include <bits/stdc++.h>
using namespace std;
#define io ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
//#define int ll
#define pb push_back
#define eb emplace_back
#define m_p make_pair
#define mod 998244353
#define mem(a,b) memset(a,b,sizeof a)
#define pii pair<int,int>
#define fi first
#define se second
#define inf 0x3f3f3f3f
const int N = 3e5 + 50;
//__builtin_ctzll(x);后导0的个数
//__builtin_popcount计算二进制中1的个数
int f[N][2];
int a[N], b[N];
void work() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i] >> b[i];
}
f[1][1] = f[1][0] = 1; //当前位置选正/反的情况数
for (int i = 2; i <= n; ++i) {
if (a[i] != a[i - 1])
(f[i][0] += f[i - 1][0]) %= mod;
if (a[i] != b[i - 1])
(f[i][0] += f[i - 1][1]) %= mod;
if (b[i] != a[i - 1])
(f[i][1] += f[i - 1][0]) %= mod;
if (b[i] != b[i - 1])
(f[i][1] += f[i - 1][1]) %= mod;
}
int ans = (f[n][1] + f[n][0]) % mod;
cout << ans << '\n';
}
signed main() {
io;
work();
return 0;
}
E - Find Permutation (atcoder.jp)
思路:
数据加强版的qcjj学排序。问能否确定唯一拓扑序。
但那样爆搜会t,处理一下让dfs只跑一遍全部数据即可。
注意我们这样排序出来的是数组下标,需要转化一下,按拓扑序排一下数组内容。
#include <bits/stdc++.h>
using namespace std;
#define io ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
//#define int ll
#define pb push_back
#define eb emplace_back
#define m_p make_pair
#define mod 998244353
#define mem(a,b) memset(a,b,sizeof a)
#define pii pair<int,int>
#define fi first
#define se second
#define inf 0x3f3f3f3f
const int N = 3e5 + 50;
//__builtin_ctzll(x);后导0的个数
//__builtin_popcount计算二进制中1的个数
//int a[N],b[N];
vector<int>gr[N], sm[N];
pii ans[N];
int sum = 0;
int pre[N], suf[N];
bool vis[N];
int num[N];
void dfs1(int x, vector<int>a[]) {
if (pre[x])
return;
pre[x] = 1;
for (auto y : a[x]) {
dfs1(y, a);
pre[x] = max(pre[x], pre[y] + 1);
//cout << pre[x] << " " << pre[y] + 1 << " " << y << '\n';
}
}
void dfs2(int x, vector<int>a[]) {
if (suf[x])
return;
suf[x] = 1;
for (auto y : a[x]) {
dfs2(y, a);
suf[x] = max(suf[x], suf[y] + 1);
}
}
void work() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
int a, b;
cin >> a >> b;
if (find(gr[a].begin(), gr[a].end(), b) != gr[a].end())
continue;
gr[a].pb(b);
sm[b].pb(a);
}
for (int i = 1; i <= n; ++i) {
dfs1(i, sm);
dfs2(i, gr);
if (pre[i] + suf[i] == n + 1) {
ans[pre[i]].fi = i;//下标
ans[pre[i]].se = pre[i];//顺序
} else {
cout << "No\n";
return;
}
}
sort(ans + 1, ans + 1 + n);
cout << "Yes\n";
for (int i = 1; i <= n; ++i) {
cout << ans[i].se << " \n"[i == n];
}
}
signed main() {
io;
work();
return 0;
}
F - Teleporter and Closed off (atcoder.jp)
思路:
类似牛子的夹逼dp。
预处理出来每个点距离1和n的最短路,然后遍历不经过的点把前后缀合并找最短路。
不经过i时,去枚举所有可能一步跨过i的点(j),这里k是j能走到的点,j+k需>i即令一步跨过i,把前后缀加起来再+1,即j->k一步。
#include <bits/stdc++.h>
using namespace std;
#define io ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
//#define int ll
#define pb push_back
#define eb emplace_back
#define m_p make_pair
#define mod 998244353
#define mem(a,b) memset(a,b,sizeof a)
#define pii pair<int,int>
#define fi first
#define se second
#define inf 0x3f3f3f3f
const int N = 3e5 + 50;
//__builtin_ctzll(x) 后导0的个数
//__builtin_popcount 计算二进制中1的个数
string s[N];
int pre[N], suf[N];
void work() {
int n, m;
cin >> n >> m;
mem(pre, 0x3f);
mem(suf, 0x3f);
pre[1] = 0;
suf[n] = 0;
for (int i = 1; i <= n; ++i) {
cin >> s[i];
s[i] = '0' + s[i];
for (int j = 1; j <= min(n - i, m); ++j) {
if (s[i][j] == '1')
pre[j + i] = min(pre[j + i], pre[i] + 1);
}
}
for (int i = n; i > 0; --i) {
for (int j = min(n - i, m); j > 0; --j) {
if (s[i][j] == '1')
suf[i] = min(suf[i], suf[i + j] + 1);
}
}
for (int i = 2; i < n; ++i) {
int res = 2e9;
for (int j = max(1, i - m + 1); j < i; ++j) {
for (int k = 1; k <= m; ++k) {
if (j + k > i && s[j][k] == '1') {
res = min(res, pre[j] + 1 + suf[j + k]);
}
}
}
if (res > 1e9)
res = -1;
cout << res << " ";
}
}
signed main() {
io;
work();
return 0;
}